MXPA06011059A - System and method for scalable multifunctional network communication - Google Patents

Abstract

A system (10) and method for scalable multifunctional network communication between presentation devices (23) and service providers (43) are disclosed. A group of consumer premise equipment (CPE) (21) units are coupled to the presentation devices (23), and a headend control computer (HCC) (38) receives upstream messages from the CPE (21) units. A group of service provider control subsystem interface (SPCS) (45) between the HCC (38) and the service providers (43). The HCC (38) receives messages from the CPE (21) units and transports them to SPCS (45), and the HCC (38) receives messages from the SPCS (45) and transports them to the CPE (21) units.

Description

A DISPOSITION AND A METHOD FOR SCALABLE MULTIFUNCTIONAL NETWORK COMMUNICATION BACKGROUND OF THE INVENTION There is no admission that the prior art disclosed in this section legally constitutes prior art.

There have been many different types and types of communication networks. Reference may be made to U.S. Patent 5,390,181; 5,590,131; 5,936,949; 5,966,163; 6,278,713; 6,292,493; 6,370,153; and 6,408,009. See also the Patent Cooperation Treaty, patent applications W098 / 47236 and WO96 / 33590.

However, none of the patents mentioned above reveal "the last mile problem" in which a communication technique is provided in a scalable, multi-functional network at low cost for a number of properties such as private residences and companies distributed throughout the country. a wide geographical location. In this regard, none has successfully proposed the provision of a communication network for 2-way digital communication connectivity at low cost in a large metropolitan or rural area.

Currently, fiber optic cable systems require, in a modern way, the installation of cables in each individual site of a subscriber. This task is, of course, quite expensive and requires a lot of time to install.

BRIEF DESCRIPTION OF THE FIGURES The aspects of this invention and the manner of achieving them will be clear, and the invention itself will be better understood by referring to the following description of certain embodiments of the invention taken in conjunction with the accompanying drawings, in the cuaies: Fig. 1 is a symbolic block diagram of a control computer of system 5 of Fig. 1 A.

Fig. 1A is a symbolic block diagram of a system for scalable multi-functional network communication according to an embodiment of the present invention; Fig. 2 is a symbolic block diagram of a unit of equipment owned by the customer of the system of Fig. 1 A, wherein: A = display devices.

Figures 3.1, 3.2 and 3.3 are diagrams illustrating a channel structure for the system of Fig. 1 A, where: T = time S = slot I = interval M = message B = signal.

Fig. 4 is a diagram illustrating a downlink synchronization scheme for the system of Fig. 1 A; Fig. 5 is a diagram of a message format for the system of Fig. 1 A, wherein: C = message player D = message header E = acquisition sequence F = data structure DTA G = address H = Application ID J = type and priority K = length of the message field.

Figures 6.1 and 6.2 are diagrams illustrating an interval request for the system of Fig. 1 A, where: L = other control information A '= empty or content a = optional, IR age b = optional - time transmission c = optional - IR counter.

Figures 7.1 and 7.2 are diagrams showing the order queue for the system of Fig. 1 A, where: B '= RQ insertion algorithm = transmission poser E' = discard F '= request queue of the master J '= clock of the master system. D '= transmission gate G' = local system clock H '= message transmission queue I' = message transmission K '= local request queue.

Fig. 8 is a diagram illustrating the time of existence of a given state in the order queue and a single client-owned equipment, where: d = RQ HCC timeline e = timeline of CPE of RQ.

Fig. 9 is a request queue synchronization of a flowchart for the system of Fig. 1A, where: 1 = initiate synchronization process of RQ 2 = are RQUM skipped? 3 = RQ cleared? 4 = cut depth of RQ.

Fig. 10 is a flowchart of a transmitter of the equipment owned by the client for the system of Fig. 1A, where: 5 = select IR from a local IR concentration 6 = plan the ALOHA slot 7 = wait for slot ALOHA 8 = synchronized? 9 = monitor RQUM / confirm IRM? 10 = place associated IR in local IR reservation 11 = wait for transmission time 12 = Is there IR for local message? 13 = discard IR from RQ 14 = transmit message 15 = access IR to the top of RQ f = new message g = transmission time h = wait synchronization j = recently synchronized and Figures 11-19 are diagrams that are useful for understanding the disclosed embodiments of the invention, wherein: Ms = messages / slots Nu = number of users, large N Pr = probability of an BSDP attempt IR in an ALQHA slot Arm = average requests / message SI = slots Ef = efficiency-slots / message Rt = delay BSPP - expected number of Irs / Message Ps = probability of success Re = requests I = Np for the probability of success given with limit of request II = probability of success lll = number of request attempts Psm = maximum sustainable speed increase for new requests Op = operating point = Np.

DETAILED DESCRIPTION OF THE INVENTION A system and method for the communication of scalable muiti-functional network between presentation devices and service providers are disclosed. A group of customer-owned equipment units (CPE) joins the display devices and the control computer receives the upstream messages from the CPE units and sends the downstream messages to the CPE units. A group of control subsystems of the service provider makes an interface between the control computer and the service providers. The control computer receives the messages from the CPE units and transports them to the control subsystems of the service provider and the control computer receives the messages from the control subsystems of the service provider and transports them to the CPE units.

The disclosed embodiments of the invention provide a system and method for low cost two-way digital communications connectivity between customer-owned equipment (CPE) for use in homes or other premises and a center that includes a computer of control and control subsystems of the service provider, for a complete metropolitan area or another area. The method of the disclosed embodiment can be used for inexpensive two-way digital communications connectivity within embodiments that involve a variety of location arrangements and applications, ranging from the urban environment cited above, to provide low cost two-way digital communications connectivity among a number of companies in one rural geographic location or another. The disclosed methods can be implemented in a wide range of physical means, substantially all known or at least many physical layer technologies, including but not limited to wireless, fiber optic, call coordinator, LAN, cable and satellite. The disclosed methods can be implemented in a variety of terminal technologies that include, but are not limited to, mobile or fixed terminals. The means of the immediately reference embodiment are wireless, operating with a frequency range such that the homes can be served within a range of about 50 miles from the center. The developed method can be implemented with CPE equipment at a low cost; the cost is minimized because the CPE equipment may only need to receive on a fixed channel from a fixed address and transmit on a fixed channel at a fixed address.

The method and system of the disclosed embodiments provide two-way digital communications connectivity between many CPEs and one HCC in a single configuration, such that the number of terminals can not be limited, except that the access time available to them is reduced regularly when the number of terminals increases. The disclosed embodiments usefully serve a large number of CPEs with digital services within a practical and moderate frequency bandwidth. The disclosed method can sustain uplink communications capacity allocation in response to the needs of the users when they develop them in real time. The revealed method may not be sensitive to the purpose or use of data whose communications it regulates. One purpose is for the revealed method to sustain Internet access at a low cost, but it can also support the telephone, interactive education, scheduled television, radio and substantially all other services that require remote digital communications.

According to the disclosed embodiments, the CPE display devices can communicate directly with other services, when they are manifested by the control subsystems of the service provider that are associated and possibly co-located with the header and can be indirectly communicated with other CPE presentation devices through control subsystems of the service provider; whereby, the information that flows from one CPE to another flows to the header from the source CPE, outside the header to a subsystem control of the service provider is sent through that subsystem control of the service provider back to the header (headend) and from there on the downstream to the CPE destination.

The communication system of the disclosed embodiment provides communication with efficient use of the channel capacity, such that only a small percentage of the available communications capacity is required to sustain the method itself. The revealed method can sustain the transmission of data with little delay between the CPEs of the network, or between a CPE and a subsystem of service provider, within the limits of delay suitable for telephone conversations and video transmission, either between CPEs or inside and outside the network.

The system and the revealed method as revealed can sustain a large number of CPEs, commonly homes and / or businesses. There is no rigid limit on the number of terminals that can be held in a given bandwidth. Many users with typical access patterns can be efficiently supported by Hertz bandwidth. The system and the revealed method allow the practical and effective use of a wireless medium to reach a large number of users from a single center with a general purpose of two-way digital connection with a high bandwidth. The diffusion spectrum in the range of 50 to 800 MHz can be such a medium. With the disclosed embodiments, the capacity is used efficiently. When a network operates at the level of traffic load for which it is designed, with reasonable fluctuations around this level of load, said traffic load called hereinafter the operating point of the subject network, the channel capacity of Uplink is used with efficiency between 90% and 100%. Efficiency may be inherent for some applications because these applications can avoid dedicated allocations of capacity to users during transactions, such dedicated allocations are commonly called circuits. Efficiency can be increased by distributed control of the revealed method that limits the control traffic header.

Note: "n" lowercase or "N" uppercase for network up and down.

The revealed network may not be fully loaded with traffic and is flexible to load.

The delay in sending messages through a network that uses the revealed method decreases with the decreased traffic load. The delay of traffic through a fully loaded network in a typical embodiment below the sensitivity level for the telephone application.

The effectiveness of the revealed method is not affected by the purpose of the information it carries. Access to the Internet, telephone access, television transmission and interactive education and other services can be taken to the home or other property. The effectiveness of the revealed method is not affected by the nature of the presentation devices in the CPE. Said devices can be devices made by orders or devices that are acquired in businesses, such as personal computers, laptops, televisions, telephones, interactive gaming terminals and others. The CPE can be of a low cost to manufacture. Its structure can be simple and easy to implement in software or semiconductors.

The disclosed embodiments of the invention require a simple communications arrangement. The CPE often communicates in a single address. In the simplest embodiment, it receives continuously, but rarely transmits over an adjacent channel. The CPE always or substantially can always transmit on the same frequency with the same bandwidth and always or substantially can always receive on the same frequency with the same bandwidth. However, the reception frequency may be different from the transmission frequency but they need to be. The CPE does not have to receive its own or any other CPE transmission. The CPE only needs to receive from the HCC. This approach can lead to a low cost transmission and reception architecture for the CPE for some applications. The HCC design revealed also lends itself to low cost execution.

The embodiments. disclosed of the invention require clock synchronization of HCC and the watches of the CPEs. One embodiment may require loose synchronization (multiple bits), or adjusted synchronization (sub-bit); in the first case the header information can be used to synchronize the channel on a message-to-message basis; in the latter case the header information may not be necessary to maintain channel synchronization. The disclosed embodiments of the invention are not affected by the choice of modulation or service protocols. Modulations such as those known for cable, fiber, satellite and wireless can be used. The disclosed embodiments can be used in a high or low noise environment. The channel encoding can be incorporated with the invention and the code synchronization data can be provided in control messages or in header messages.

Note: Observe "Message" before "Message" here above and below.

The disclosed embodiments of the invention may provide the priority of message traffic for the purpose of controlling the service and the specific control delay of and possibly the loss of messages. The revealed method can be performed where messages are allowed to be "lost" messages due to instant traffic patterns, such as with TCP / IP or ATM. However, it can also be implemented where the loss of messages is not allowed.

Considering now the details of the construction of the system and the method of the disclosed embodiments of the present invention, a technique for scalable multi-functional network communication is provided by means of service messages between the presentation devices and the service providers. A plurality of display devices is associated with, and commonly co-located with, a single CPE. A plurality of control subsystems of the service provider is associated with, and may be co-located with the HCC.

The technique of the present invention includes communication between the HCC and CPE units by means of control messages.

The HCC receives upstream messages from the CPE units and sends downstream messages to the CPE units, said message streams being a random or ordered set of service messages and control messages. A CPE receives downstream messages from the HCC and sends upstream messages to the HCC, said message streams being a random or ordered set of service messages and control messages. In the disclosed embodiment only the messages are sent on the upstream and on the downstream.

The HCC also receives messages locally from the control subsystems of the service provider and from the control applications within the HCC itself. A CPE also receives from the Service Interface Modules (SIMs), which are a part of the CPE, and from the control applications within the CPE itself. The SIMs form the interface between a CPE and the plurality of associated display devices.

The HCC orders in one or more transmission queues those messages that are to be sent to the CPE units. The HCC orders in several reception queues those messages that are received from the CPEs and that will be distributed to the control subsystems of the service provider and to the internal control applications.

A CPE orders in one or more transmission queues those messages that are to be sent to the HCC. The CPE orders in several queues those messages that are going to be distributed to the SIMs (and consequently to the presentation devices) and to the internal control applications.

Considering certain control messages, which provide a part of the means for managing upstream traffic in the disclosed embodiments of the invention, any of the CPEs, HCC control applications, or service provider subsystems may initiate a request for the transmission time on the upstream. These requests are for time intervals on the upstream. These requests, once formed, are called interval requests (IRs). Irs appear in upstream control messages called IR messages (IRMs), and in downstream control messages called Request Queue Update Messages (RQUMs). They also appear in a structure called Request Queue (RQ) that resides in HCCs and CPEs.

An IR is created by HCC when a control subsystem of the service provider or an internal application wishes to provide space on the uplink to transmit one or more messages from a plurality of CPEs. An IR is created by a CPE generally when a SIM or an internal control application presents a message to transmit, but it can be created when a SIM or an internal control subsystem wishes to provide space on the uplink to transmit one or more messages by means of one or a plurality of CPEs, not necessarily including the request CPE.

An IR that is created by CPE is transmitted to the HCC in an IRM. An IRM is formed by the CPE and is transmitted in a sub-interval called the Aloha slot. An IRM comprises an IR with a header. The Aloha slots appear in bursts on the updraft, said bursts are called Aloha slot burst intervals (ASBIs).

The IRs arrive at the HCC from the CPEs in IRMs and arrive from several local sources.

These IRs from various sources are collected together in an IR group in the HCC.

The HCC selects a set of IRs from the IR group, generally selects all the IRs present, and with these forms an update queue order message (RQUM). RQUMs carry the IRs to the CPEs where the information they carry is used in the disclosed embodiments of the invention in the process of programming the traffic on the upstream.

Referring now to the figures, and more particularly to Figures 1 A, 1 and 2 thereof, a scalable multi-functional network communication system 10 is constructed, according to an embodiment of the present invention and allows that communication be established between a group of consumer properties, such as consumer properties 12, 14, 16 and 18 over a widely distributed geographical area. Each property or building houses a CPE 21 that includes a CPE control computer 22. The CPE 21 connects in communication with at least one display device as generally indicated at 23. The viewfinder devices 23 may include a connected television 25. via a subscriber interface module 26 (SIM) to the CPE control computer 22. Similarly, a personal computer 27, and a telephone 29 can be connected via a SIM 28 to the computer 22. They can also exist other display devices 32 each of which is connected to the CPE control computer 22 by means of a SIM 33.

The CPE 21 includes an antenna 34 for wireless communication with a transmission tower 36 that can be transmitted at a suitable radio frequency such as UHF on a channel not otherwise used. A header control computer 38 (HCC) is electrically connected to the transmission tower 36 in such a way that the CPEs such as the CPE 21 can communicate upstream to the HCC 38, and the HCC 38 can communicate downstream to each of the CPEs. The HCC 38 may be housed within a building or building 41 that may be located near the transmission tower 36.

The HCC 38 may be connected in communication with at least one service provider such as the service providers indicated generally at 43 (Fig. 1 A). A group of service provider control subsystems (SPCS) generally indicated at 45 provides an interface between service providers 43 and HCC 38. These interfaces change the format for the flow of data in and out of the network, from In such a way that the data are presented in the form of a message on the network, and on the service side, these data are presented in the form and with conventional time to the service. In this regard, an SPCS 47 connects the HCC 38 with the television broadcast center 49. Similarly, an SPCS 52 interfaces between a control center of the Internet service provider 54 and the HCC 38 and an SPCS 56 it interfaces between a call coordinator or point of presence 58 and HCC 38.

An SPCS 61 interfaces between an additional service control center of the unspecified purpose 63 and the HCC 38 to provide messages to a representative unspecified device 32. It should be understood that the SPCSs may be located in the HCC 38 within the building 41, or they may be located elsewhere, such as in the operations center of the SPCS service provider.

The HCC includes a reception indicator 65, which receives messages from the CPEs such as the CPE 21 via the transmission tower 36. The HCC 38 also includes a transmission scheduler 67 for programming the sending of downstream messages to the CPEs via the transmit tower 36. Also, CPE 21 includes a receiver indicator 74, which receives messages from the HCC via the local antenna 34. The CPE 21 further includes a transmission scheduler 82 for programming the sending of upstream messages to the HCC via the local antenna 34.

The service admission control functions are a gateway for the messages that enter the system, that is, for the messages that are going to be transmitted through the network.

In the HCC (Fig. 1), the IRs reach the IR group from the CPEs through the IRMs. In this regard, a control application 69 downloads Irs from the messages in the message receiving queue 70 designated for the IRMs and places them in IR Master 71 group. Occasionally, a request administrator 75 makes a selection of Irs from the IR Master 71 group, they generally select all the Irs in the group, and place them in the order queue update message (RQUM), which is then placed in a queue to be transmitted. The transmission programmer 67 takes the messages to be transmitted, according to the claimed method from any of the queues to be transmitted, indicated generally at 80 and initiates its transmission. Once the RQUMs are transferred they are transferred to the message queues to be transmitted 80, a copy of the RQUM is inserted into a Master request queue (Master RQ) 72 via a request insertion algorithm 83.

A master clock 85 controls the operation of the HCC 41. The CPEs are synchronized to this clock.

In the CPE, as best seen in Fig. 2, a reception indicator 74 receives the messages from the HCC 41 and transfers them to the message receiving queues 77. The service messages are transferred directly from the queues of reception of messages 77 to SIMs such as SIM 26.

The admission control function can only regulate the flow of messages within the network. It can not act on received messages that are flowing out of the network (to SIMs).

The control messages received by the control message reception queues, such as certain of those indicated in 77, are transferred to several internal control applications 76. In particular, an RQUM is routed to a queue carrying, possibly between others, the messages intended for the request queue insertion algorithm 79. The RQ insertion algorithm 79 places the IRs contained in a received RQUM within the local request queue (Local RQ) 78. The local RQ 78 serves to sequencing a transmission scheduler 82 to send upstream messages to the HCC 41.

The transmission scheduler 82 has a second function. It locates the requests to use upstream currents of specific size, in order to send particular messages. These requests are formed as Irs and meet in the local IR group 88 until such time as the upstream space is available to send requests to the HCC 41. An upstream space for carrying a request is called a slot. Aloha A flurry of Aloha slots happens on the updraft from time to time. This burst, which is formed within a single interval, is called an Aloha slot burst interval (ASB1). The transmission scheduler 82 places one or more requests in an ASB1 in slots that it raises at random.

Note: ASBI introduces a page or more previously.

In use, it is assumed that a telephone call is initiated by a caller who uses a standard telephone associated with CPE 21 and dial in a conventional manner. This signal flows from the phone to your associated SIM that forms a message that is sent to the SCPC associated with the telephone service provider. This message contains a service data packet that describes the call that is being established. To send this message, the CPE 21 must send an IR to the header HCC 38 requesting a rising current interval for the message. For the purpose of sending the IR, an Aloha slot must be available for the CPE 21.

The AIoha slots are made available when the head HCC 38 decides to gather additional IR requests. At this time, the HCC 38 header itself, creates an IR for an ASBI and adds this IR to the IR Master 71 group. The HCC 38 occasionally decides to send a request queue update message (RQUM) about the upstream, in order to add requests to the request queues 71 and 78, which are used to program the transmissions on the upstream. The RQUM is generally formed from all the IRs of the IR group, although for priority or traffic control reasons, a subgroup of the IRs present can be selected.

While in the current telephone call, the IR rests in the local IR group (number) in the CPE21, the HCC 38 forms an IR requesting an ASBI. This IR is then placed in an RQUM and sent to all CPEs. The requested ASBI could have, for example, 64 AIoha slots that are available for the CPEs 21 to be used to transmit IR messages.

Upon receipt of an RQUM, the CPE 21 loads its RQ 78 with the received IRs, including the request for ASBI, and expects this particular request to appear at the top of RQ 78 which indicates that an AIoha slot burst interval is scheduled. When the burst interval, consequently arrives, the CPE has the IR telephone call on hold in its IR group (number). The CPE can randomly select one of the AIoha slots of the ASBI, place the IR in a small message (an IRM) when adding a header, and locate those IRMs in the selected AIoha slot. The IRM contains the request for an interval to carry the telephone call packet message. It should be understood there are many types and kinds of techniques to select an AIoha slot.

The RQUM includes a header that has data that allows the CPE 21 to check the synchronization of its clock 91 and RQ 78 with clock 85 of the HCC and RQ 71. If the CPE 21 is not in synchrony with the HCC 38, the CPE will not make any transmission until it is synchronized again, it delays sending the request of the telephone call of the example.

The IRM transmitted phone call pack may be damaged from content due to other IR messengers or from noise. In any case, it can not be received in HCC 38 and consequently, your IR will not enter the IR Master 71 group and will not receive back in CPE 38 in a RQUM. The CPE requesting will know when this IR should arrive in a RQUM (or perhaps in any of a group of RQUMs, depending on the embodiment). When the requested CPE 38 determines that the IR was lost, it reverts to the resolution algorithm of the appropriate content that may include IR resending. IRs transmitted by a CPE 38 can be saved for possible resends until secure reception is confirmed.

The IRM containing the object IR request is received and entered into the header HCC 38, the IR is downloaded from the IRM and is located in the IR 71 group. Once the header HCC 41 determines that all the small slots have been received, then the slots containing information such as the IR request of the CPE 21 , they can be sorted and arranged, if desired, according to any desired algorithm. Assuming, for example, that only 30 of the 64 slots contain messages, all 30 messages are transferred to the message transmission queue 80, along with other IR messages, if any, from the IR 71 group. In this way, the sequence of the IR messages is then transmitted downstream to each of the CPEsm and a copy of the sequence is placed in the master request queue 72.

The RQUM containing the IR associated with the example telephone call packet is received at CPE 21 and its IRs are located in the local IR queue by means of algorithm 79 as was the case in which the IR for an ASBI was distributed in the sequence of events mentioned above. The RQUM insertion algorithm (number) takes the set of IRs received in the RQUM and locates them according to an algorithm in the RQUM. The simplest algorithm is that the IRs of the RQUM enter the back of the RQ in the order in which they are received.

The IR sent out to the CPE will finally complete its cycle with the front of the local RQ 78, and at that moment the CPE 21 transmits the telephone call packet example on the upstream to the HCC 38. The contents of this first telephone packet would include all the digit information needed to initiate the call through the call coordinator. It should be understood that the complex process described so far may have taken a short time, such as a few thousandths of a second, to conclude.

When the message containing the first telephone call packet from the CPE 21 is received at HCC 38, it is sent via the reception indicator (number) to the call coordinator (number) via the service provider control subsystem. (SPCS) of that coordinator.

The coordinator then establishes the call, by conventional means. The coordinator uses the protocols and processes of its standard POTS system if the destination part is external to the network 10. The coordinator uses exactly the same protocols and processes if the destination party is in the network 10. The SPCS translates between the network and the coordinator to make the coordinator appear as a part of a conventional telephone system. The SPCS works with the call participants who are internal to the network 10 by translating the actions of the coordinator into appropriate messages that are sent to the participants.

It is assumed that the so-called example is a part of the network 10. At the initiation the coordinator (number) signals a call and the SPCS then sends a message to the other property of the called party, such as the property 14, said message causes that SIM 56 in the destination rings the phone (not shown) for that consumer. The resulting two-way conversation is digitized and communicated in a similar manner between the calling party and the called party.

HCC Referring to Fig. 1, the HCC (Header Control Computer) is located in a site and is implemented in one or more hardware devices made by order or available in business, which may include a digital computer. The functions of the HCC can be implemented in hardware, including integrated circuit, in software, or a combination thereof.

The revealed method is used to regulate the traffic of data in a Network, said traffic that flows in both directions between the set of control subsystems of the service provider (SPCSs) in a central location and the service interface modules (SIMs) which are located in many distant places. SIMs are hardware and software functions that allow data to flow between a network connection point on distant client sites, the network that uses the disclosed method, and presentation devices, such as personal computers, televisions, and telephones that are local to distant client sites. These presentation devices present and receive information associated with the use of offers from service providers. The SPCSs are the source of all service messages transmitted by the HCC and are the destination for all service messages received by the HCC. For reasons of clarity, Fig. 1 represents those elements that must be contained in an SPCS to allow it to interface with the HCC; and it does not represent other elements, which can be expected in an SPCS.

As indicated in Fig. 1, the elliptical edge of the indicated region encloses a diagram that highlights the key functions for control applications of the HCC control structure. This control structure regulates the traffic of data that go over the downlink of the Network, and cooperates with the CPEs (Customer-owned Equipment) of the Network to regulate the traffic of data that go over the uplink of the Network. Master system clock is located in the HCC and provides a time reference for the HCC and for the CPEs. In the disclosed method, the time range is all that is necessary for a practical and useful embodiment. The time itself can be used in variants, extensions or improvements of the revealed method.

Proper transmission timing is important in the disclosed method. In this way, you can set and know the delay between the time a message leaves the HCC and the time it arrives on the physical medium.

The reception indicator receives and indicates incoming messages to the message reception queues, as indicated in Fig. 1. Each message destined for an SPCS carries a header that contains the appropriate information to determine the specific message receipt queue which will be served by the appropriate SPCS. For reasons of clarity, there may be more than one message receiving queue to interface with a single SPCS.

The control messages received by the HCC are routed to the control applications through a queue of message reception or queues. In particular, all IRM messages can be routed to a message receiving queue from which they are directed to the IR Master group.

The message buffers, referred to as SPCS message queues, used for the input and output of service messages are indicated in the SPCS structure. These may not be part of the revealed method, but represent functions that may be present in the interface SPCS-HCC. These entities indicate the starting points and destinations for the flow of service messages through the HCC.

The message buffers, referred to as message receiving queues and message transmission queues are indicated in the drawing as a part of the HCC. The function of these tails can be part of the revealed method.

The message reception queues contain service messages and control messages. Each queue is assigned to an application, either a service application or a control application, and that application opportunely serves the queue (that is, it carries messages from the queue). There must be at least one message receiving queue for an HCC embodiment.

Message transmission queues contain service messages and control messages. These tails may be designed in an embodiment to maintain messages of a particular priority or type, or messages from a particular service of a particular type, or messages from certain control applications. The number and role of tails is a function of the embodiment. There may be at least one message transmission queue in the HCC and one message transmission queue in each CPE in the disclosed method.

The message flow through the interface between the HCC and an SPCS is indicated in the fi. 1. The service messages to be transmitted are located in the message transmission queue or queues. The service messages to be received are taken from the queue of messages or queues. The additional control information typically flows through the interface.

The SACF (Service Message Admission Control Function) is a server that selects the messages to be transmitted from the SPCS and regulates the length and frequency of transmission of such messages to ensure that these factors are within the limits required by the disclosed embodiment. For reasons of clarity, the combined effect of the downlink traffic discipline from each CPCS is required to be such that the complete downlink traffic configuration of the Network is within the limits of a group of values set for the embodiment of the disclosed method.

The control applications in the HCC carry out a system and other control functions. The request manager and the RQ insertion algorithm are example applications that are indicated. All other control activities that are determined in a particular embodiment of the disclosed method are included in the control application and in the database area, as indicated.

RQUMs and other control messages may be located in a message transmission queue or queues by control applications. The request administrator control application forms an RQUMs. IRMs and other control messages are carried out in a timely manner from the message queue or queues by the control applications. The request administrator provides the RQ insertion algorithm with a copy of an RQUM that is created for transmission over the downlink. The request administrator uses IRs that he met in the IR Master group to form the RQUM. The RQ insertion algorithm is a control application that receives IRs from the request manager and places them in the master RQ according to a set of established rules and procedures. The RQ insertion algorithm also maintains the priority and time databases associated with RQ.

The RQ Master is a database that keeps IRs located in a particular order by the RQ insertion algorithm. It is initiated and maintained by the RQ insertion algorithm, said maintenance involves setting priorities and IR IR transmission times when each RQUM is received from the request administrator. For reasons of clarity, no RQ synchronization in the HCC can be required and the RQ synchronization algorithm can not present in the HCC.

CPE Referring now to Fig. 2, CPE (Client-Owned Equipment) is located at a site distant from the HCC site and is implemented on one or more hardware devices made by order or available in business, which may include a digital computer CPE functions can be implemented in hardware, including integrated circuit, in software, or in a combination of them. The CPE includes a CPE control computer (CPE CC). In most of the embodiments seen, the CPE also includes the transmission / reception equipment associated with the medium, and includes interfaces with the presentation equipment that is also located in the same site.

The revealed method is used to regulate traffic on a Network, said traffic flowing in both directions between a set of SPCSs (see Fig. 1) and many SIMs (equivalent to Service Interface Modules) that are located at distant sites, said SIMs to communicate with the presentation devices, such like personal computers, televisions and phones that are local to your site. A set of SIMs is described. SIMs are the source of all service messages transmitted by CPE and are the destination for all service messages received by CPE.

In a preferred embodiment of the disclosed method, the SIMs are modules similar to the PC cards that are attached to the CPE equipment made on request containing the CPE CC. An alternative embodiment is that the SIMs are part of the presentation devices.

A set of control applications and databases of the CPE CC are indicated enclosed in an elliptical border in the drawing. Certain key elements of the CPE control structure are indicated. This control structure cooperates with HCC to regulate the traffic that goes over the uplink of the Network and regulates the traffic coming from the downlink of the Network.

The local system clock located in the CPE can be used to provide a time range reference (ie, signal range) for the CPE CC BSDP functions. In the disclosed method, the time range is all that is necessary for a useful and practical embodiment. The time itself, however, can be used in variants, extensions, or improvements of the revealed method. The local system clock can be locked to the master system clock in the revealed method.

In Fig. 2, the interfaces are indicated with the terminal reception subsystem (See transmission scheduler). An appropriate transmission synchronization can be critical in the disclosed method. In this way, you can set and know the delay between the time in which a message leaves the CPE CC and reaches the physical medium.

The reception indicator receives and routes the incoming messages to the message reception queues as indicated in Fig. 2. Each message destined for a SIM carries a header that carries a header that contains the appropriate information to determine the queue of reception of messages. specific message that will be served by the appropriate SIM. For reasons of clarity, there may be more than one message receiving queue for interfacing with a single SIM.

All control messages received by the CPE can be routed to control applications. This is achieved through message receiving queues. In particular, all RQUMs are routed to a message receiving queue from which they are directed to the RQ insertion algorithm.

Message buffers, as indicated in the SIM descriptions in the figures, are used for input and output of service messages. These are not part of the revealed method, but represent functions that must be present in the SIM-CPE CC interface. These entities indicate the starting points and destinations for the service messages that flow through the CPE CC.

The message buffers, called message reception queues and message transmission queues are indicated in the figures as part of the CPE CC. The function of these tails is part of the revealed method.

The message receiving queues contain service messages and control messages. Each queue is assigned to an application, either a service application or a control application, and that application opportunely serves the queue (that is, it carries the messages from the queue). There may be at least one message receiving queue for one embodiment CPE.

Message transmission queues contain service messages and control messages. These queues may be assigned in an embodiment to maintain messages of a particular priority or type, or messages from a particular service of a particular type, or messages from certain control applications. The number and role of the tails is a function of the embodiment. There may be at least one message transmission queue in the CPE.

Figure 2 shows the flow of messages through an interface between the CPE CC and SIM. The service messages to be transmitted are located in a message or queue transmission queue. The service messages to receive are taken from the message reception queue or queues. The additional control information typically flows through this interface.

The interface technology to interface between a SIM and the CPE CC for useful and practical embodiments of the disclosed method is within the known state of the art.

The SACF (Service Message Admission Control Function) is a server that selects the messages to be transmitted from the SIM and regulates the length and frequency of transmission of such messages to ensure that these factors are within the limits required by the disclosed embodiment. For reasons of clarity, the combined effect of the uplink traffic discipline from each SIM in the network is required to be such that the complete uplink traffic configuration of the Network is within the limits of a set group. of values for the embodiment of the disclosed method.

For reasons of clarity, the SACF function can exist in each SCPC for the purpose of regulating message traffic over the downlink and the SACF functions exist in each SIM for the purpose of regulating the message traffic on the uplink. The CPE CC control applications carry out the system and other control functions. The RQ synchronization algorithm and the insertion algorithm are example applications that are displayed. All other activities that are determined in a particular embodiment of the disclosed method are included in the control application area as described.

IRMs and other control messages are placed in the message or queue transmission queue through control applications. The CPE transmission programmer forms IRMs.

RQUM and other control messages can be carried out in a timely manner from the message queue or queues using control applications. The transmission scheduler is a server that selects messages to be transmitted from the transmission queue of messages or queues to ensure that these are within the limits required by the embodiment. The transmission scheduler for CPE only causes a message to be transmitted when the CPE is synchronized according to a disclosed embodiment of the invention.

The CPE transmission programmer forms an IRM for each message entered by other applications in the message transmission queues. The CPE transmission scheduler manages the transmission of IRMs using the AIoha slots according to the disclosed method. The CPE transmission programmer schedules the transmission of messages, other than IRMs, in the message transmission queues by following the uplink message transmission program as determined locally and presented in the local RQ. The RQ insertion algorithm is a control application that receives IRs in RQUMs (directly from a message reception queue) and locates them in the local RQ according to an established algorithm. The RQ insertion algorithm also maintains time and priority databases associated with RQ.

The RQ synchronization algorithm is a control application that controls the RQ and the received control data to determine that the RQ synchronization is maintained and sets the RQ synchronization when the CPE is or becomes external to the RQ synchronization. The local RQ is a database that keeps the IRs located in a particular order by the RQ insertion algorithm. It is initiated by the RQ synchronization algorithm, and is maintained by the RQ insertion algorithm, said maintenance including setting IR IR transmission times and priorities as each RQUM is received from the request manager.

Channel structure Referring now to Fig. 3 A, a channel is a dedicated physical medium that can carry a stream of symbols. In the networks that the revealed method uses, the channels are divided into time at intervals. In the preferred embodiment these intervals are contiguous, one interval that follows immediately after another. The intervals on the downlink and on the uplink have lengths that vary as determined in real time by the HCC control circuit. In a preferred embodiment, the downlink and the uplink are continued in different channels. An alternative embodiment comprises downlink and uplink information continued in the same channel.

Channel time, in addition to can divide in the case of some intervals. These intervals are divided into slots. In the preferred embodiment of the BSDP method, the slots are of a fixed length in a given type of interval, for reasons of structure simplicity. However, the BSDP method allows the slots within a range to be of a variable length. Slots are provided to allow the gathering of small messages in a single interval. This provides a means to increase the efficiency of channel use in the BSDP method.

The clock used to provide time for the revealed method is the master system clock. The HCC carries the master system clock. The CPE carries a local system clock that is locked to the master system clock (Fig. 2). The interval time and the edges of the slot refer to the master system clock and is measured when the interval is in the HCC, that is, when it is transmitted for the downlink, and when it is received for the uplink. In the revealed method, CPEs computes the arrival time of an interval in the HCC in determining when to transmit.

Messages are transmitted in intervals and in slots. There is a maximum of one message per interval, unless the interval is divided into slots. In this case there may be at most one message per slot. For the preferred embodiment, as indicated in Fig. 3 A, the timing is maintained at an accuracy that allows tracing of the edge of the symbol through the interval edges and no space is needed in the range to justify the irresolution of timing when placing a message. In addition, the preferred embodiment includes continuous downlink transmission with coherent symbol modulation from one message to the other.

Message headers and related subparagraphs are indicated in all messages in Fig. 3 A. These message headers are indicated to include acquisition sequences, which are used to sustain the acquisition by the receiving terminal of the attributes of the message. modulation in the physical layer. The message headers are required in the method revealed in the downlink messages. The acquisition sequences are only required in some messages on downlink, their exact location depends on the requirements of a particular embodiment.

Message headers may not be required on the uplink. For reasons of clarity, acquisition sequences are required from time to time, but may be in the body of a control message or in a message header, or both.

Fig. 3 B emphasizes that in the disclosed method, a message header may not be necessary in most messages on the uplink for the HCC to know the attributes of the message. The information required in the method does not need to be in the message headers over upstream messages because said required information has previously been transmitted in an IRM to the HCC. In this way, the sole purpose of an uplink message header, if present, may be to sustain the acquisition. With some means, this is not necessary. With all means, if the tracing of the edge of the symbol is maintained across a range or slot edge, the acquisition that uses the data of the body of the message can cause a high error range only over the first few symbols of a message , but coding and interleaving can be used to recover this data, therefore, allowing the exclusion of a header from the message. This approach also applies to the consideration of acquisition elimination that aids sequences over downlink messages. However, on downlink messages, certain data must be present in the message header in order for the CPEs to successfully capture and route the message.

Fig. 3C illustrates an embodiment having spaces in the intervals. By excluding the headers of the messages, it is implied in the diagram that this is an uplink channel. The downlink channels may also allow similar spaces in this type of embodiment.

Fig. 3 D illustrates a channel arrangement in which the messages are located in intervals and slots that have custody space, and the messages have headers that support the acquisition of each message. The custody space allows messages to be transmitted with some somewhat inaccurate clocks, as can be found in the uplink in an embodiment with the objective of supporting a network with CPE terminals at a low cost. The inaccuracy of the clocks in the CPE can also be found in Networks where the transmission on the downlink is intermittent, therefore creating an environment where the local system clock can derive from the value of the master system clock. This embodiment is also appropriate over the downlink in case the terminals are often joined and leaving the Network, or where the transmission by the HCC is intermittent.

Downlink Synchronization Referring now to Fig. 4, messages are continued on the downlink. The downstream messages have a message header and a message body (see claim 110 with its subparagraphs). The message header may contain a DTA data structure. The object embodiment has continuous transmission of messages on the downlink (at least up here as the set of messages containing DTA data structures), and maintains symbol alignment through the message edges (i.e., the edge). of the end of the last symbol in a message coincides in time with the edge of the first symbol of the following message). It is important, but not essential to the method described herein, that the embodiment maintain phase coherence from one symbol to the other across the edges of the message in those network channels where such a demodulation method is germane.

All downlink messages can have message headers that contain at least one message length and one address. The message headers can also contain DTA data structures and acquisition sequences to support the CPE acquisition and data tracing and downlink formats. For reasons of clarity, the acquisition sequences are used to sustain acquisition by frequency, phase and symbol edge receivers, said acquisition which may not be related to the acquisition of interval edges as directed in the drawings.

The field can be displayed inside the header, but not necessarily on your forehead. By the time the CPE returns to downlink synchronization, it has acquired the downlink symbol stream. In this way, the DTA data structure does not need to be the first to arrive in a sequence of fields within a message header. In some embodiments, it may be preferable to have the data structure DTA at some distance behind the front of the message. The CPE detects the only sequence in this field and establishes a correlation, therefore, it determines exactly where the start and end points of the field are in the bitstream. This is the indicator that allows the CPE to determine all the interval edges that follow, and therefore, the downlink synchronization.

Each message header on the downlink contains a message length field in a fixed and known relative position to start the message. The format of the message containing the DTA data structure is known by the CPE to the end that knows the number of bits between the end of the DTA data structure and the beginning of the message length field. In this way, the CPE can access the message length field.

The value of the message length allows the CPE to calculate the location of the body of the current message and code it. It also allows the CPE to calculate the edge of the interval between the current interval and the next interval, therefore, downlink synchronization is achieved.

Message Format Referring now to Fig. 5, the disclosed method does not require a particular order or location of the various fields of a message. However, the data fields of the message header and the field or fields of the message body may be in known locations relative to the beginning of the message. As an example, the header information of the message may be spread on a known path between the body parts of the message. There is virtually no guarantee of the size of the message body in the disclosed method, although a minimum message body size can be set in a particular embodiment. In this way, typically, the message header information may be located on the front of the message such that the location of the various fields is known, regardless of the size of the message body. There is an exception to the flexibility allowed in the location of the field in a message, which is a matter of known art: the acquisition sequence supports the physical layer functions associated with the method. If the embodiment requires that the receiving terminal also decode the message, whereby physical layer acquisition is achieved, then the acquisition sequence must first come in the message. The message in the revealed method contains a body of the message, which an application provides. The downlink message must contain a message header. The uplink message may contain a message header, depending on the embodiment. For reasons of clarity, each uplink message was associated with an IR carrying certain control information related to the message. This associated IR is disseminated to the HCC and each CPE of a network in the BSDP method by means of several control messages. The information in the IR is suitable for the fundamental message control function of the disclosed method, therefore, the design of the embodiment is given the option of not including a message header on the upstream sessions.

The message header may contain a number of system control information fields, as mentioned. The message header is indicated with non-designed data areas. These areas constitute a field called information from another control that indicates that the designer of the embodiment may choose to use message headers to carry information not required by the disclosed method, but improving it. An example of such control information is a set of parameters that is changed from time to time; said parameters used in a system control algorithm in the CPEs.

An acquisition sequence may be present at the beginning of a message header or within the message header. They may be present in the message control body.

The DTA data structure may be present in a message header to sustain downstream synchronization. In the downlink synchronization process, the edges of the downlink intervals are located. (More precisely, the edges of the beginning of a message or the sequence of messages are located, which implies that that determination of interval edges is completed with satisfactory accuracy).

The address may be present on the downstream. On the downstream, this address designates which CPE or CPEs will receive the message. The destination address does not need to be present on upstream messages because the HCC receives all upstream messages. Nevertheless, the address field associated with an upstream message designates the controlling entity address, which is generally the messenger, but may be HCC or some other CPE. This controlling entity address is carried in the IRM associated with a message and may also be carried in the address field of the message header in certain embodiments. The address is provided to the system transmission function by the application that is requesting that the message be transmitted.

The length field of the message contains a value that designs the length of the message; said length can be agreed in terms of time, MTUs, or data units. The examples of data units are: (1) bits, (2) bytes, or (3) in terms of the minimum size of message resolution, for example, 8 units byte. The downlink message must contain the length field of the message. The uplink message can contain the length field of the message. The length of the message may be known about the upstream, but this information is also available in an associated IR.

The application field ID identifies the application within a terminal that receives the message to be routed. The application ID can map in the receiving terminal to a single queue for receiving messages (Figs 1 and 2), said queue, whether served by a BSDP control application, or by an application in an SCPC or a SIM. The application ID information is provided to the system transmission programmer by means of the application that requests that the message be transmitted, usually simply by providing the header to the message.

The type and priority field contains additional control information that is used by the application of the RQ insertion algorithm in locating the associated IR in RQ. In addition, this field may have the information used for other control functions. An example is a parameter that indicates that the message contains slots of a particular size and for a particular system function. The identification of the type and priority information is provided to the system that transmits function through the application that requests that the message be transmitted, generally, simply by providing the message header with the message.

Request Data Referring now to Fig. 6, the data elements are encoded as indicated in the drawings. For reasons of clarity, the message headers do not contain control information used by service elements. The blank is used for the background or non-specific data in an interval request.

The format of the interval request (IR) is presented in Fig. 6. One and only one IR is associated with each uplink interval, called the associated interval. The associated interval is typically used to have one and only one message called the associated message. The IR format contains common data fields with those designated for a message, with the exception that the interval length of an IR may be longer than the message length of the associated message. The transmission scheduler forms the IR; said application uses the IR to make requests of an associated interval. Apart from the typical case where an interval is requested for the purpose of sending a single message, one interval can be requested by one CPE for another or by the HCC for a CPE, or by any of these for a slotted interval to be used in a more complex way as determined by the control applications, SCPCs, or SIMs that work with a transmission scheduler control application. An example is the IR established by the request administrator in the HCC for the purpose of requesting a SABIH in the link.

The IR contains an address that represents the control entity. Such an address would typically be the CPE that is requesting the interval to transport an upstream service message. However, the revealed method supports complex actions such as scrutinizing the HCC; the service level control of complex interactions, interval planning with slots, and others; and in such cases the address may be different from the CPE or CPEs that may use the interval.

The ID application serves to provide system control applications with the necessary information to route the message or associated messages in the HCC or CPE receiver. This field information can be used for other auxiliary control functions. The type and field priority can provide the information needed by the RQ insertion algorithm to plan the interval. This field information can be used by other auxiliary control functions.

The length of the interval field contains the length of the associated interval. To clarify, this field in the IR always refers to an interval, whereas the comparable field in a message header refers to the length of that message. The IR interval (ie the AIoha slot) may include security space, and therefore be larger than the length of the associated MRI message of the associated message. The space called other control information is allowed in an IR; the use of such space being specific to a particular embodiment.

In one embodiment, a field may be present in IR called the IR counter.

This field allows control applications to distinguish IRs from the same CPE, this being useful in the case where multiple IRs are in the distribution of the same CPE, or when multiple copies of the same IR have been received by the HCC of a CPE.

In a given embodiment, a field may be present in the IR version carried in RQ, such field being IR birth time and / or IR age. The IR insertion variants and some RQ synchronization variants can use this field information to organize and synchronize RQ. In the disclosed embodiment, the IR transmission time field may be present in the IR version carried in RQ. In the disclosed method, for the claimed variant, such value can be in a database associated with RQ and accessible to the transmission scheduler, and the IR data element can provide an appropriate location for the data.

The RQUM may have two required fields in its message header (alternatively the information must reach the CPE by another means that is functionally equivalent). The RQ depth field provides the depth of the master RQ at the instant that the RQUM is transmitted, such depth being measured in convenient terms, one being the number of IRs in the master RQ.

A second RQUM message header field that may be present (or the equivalent function provided by an alternative means in the BSDP method) in the upper time RQUM. This provides the exact transmission time to the upper element of the master RQ, in terms of the master system clock. A useful way to do this could be to provide the transmission time to the upper element in relation to the transmission time of RQUM.

A field that is used in some variants of the revealed method, and is therefore optional, is the field of the RQUM counter. The value of this field is incremented each time an RQUM is sent. This allows the CPE to easily detect that one or more RQUMs have been lost in the transmission, and therefore, declare out of synchronization.

IRs are typically placed contiguously in a RQUM. The method allows other control information to be placed in the body of the RQUM message at the discretion of the designer of the embodiment.

The IRs are transmitted in the uplink in IR messages as shown in FIG. 6. Such messages have a message header in a typical embodiment, although applications in which a message header is not required are not provided.

Request queue With reference to 7, the request queue is displayed. The representation for RQ indicates that the top of the queue is on the right. This is where elements are removed from the queue. They are placed in RQ at any point, depending on the RQ insertion algorithm.

The elements of RQ are IRs. Along with the IR information, each of these elements has associated, possibly transported in the element itself, the IR transmission time for the associated message; such time provided by the application of the RQ insertion algorithm. The IR at the top of RQ indicates the next interval to be transmitted in the uplink. The elements are taken from the top of the queue once its IR transmission time has passed. They are discarded, although they may be the cause of being archived after being removed from the RQ.

The interval request (IR) format is presented in FIG. 6 Interval requests arrive in RQUMs to the HQ RQ insertion algorithm. These RQUMs are created locally in the HCC by the request manager, and sent to the RQ insertion algorithm simultaneously to be placed in an HCC message transmission queue.

The RQ insertion algorithm in the HCC places new IRs in the master RQ and maintains the master RQ, removing IRs that may have aged too much, or whose transmission time was passed, and updating priority and other control information in the IRs. The RQ master in the HCC is the exact version of RQ. The local RQs in the CPEs represent an estimated copy of the master RQ and may be misrepresented in certain circumstances. The transmission scheduler may not schedule transmissions in the HCC using the RQ. Preferably, the RQ is simply used to track the status of the uplink. In the HCC, the transmission scheduler can remove the upper element of RQ at the time its IR transmission time is passed, thereby keeping it appropriate for uplink interval planning. This is identical with this function in the CPEs.

The master system clock in the HCC provides the time base for the BSDP method. The CPEs carry an estimate of the time speed in the master system clock, and can carry an estimate of the absolute time of this clock. The transmission scheduler uses the time base of the master system clock to plan transmissions to the HCC. The transmission time of IR transported in or associated with the IRs is in terms of the clock time of the master system.

The upper element of the RQ is discarded once its IR transmission time has passed as indicated in (g) above. The interval request (IR) format is presented in FIG. 6. The request for interval up to downward flow in RQUMs in the CPE and sent to the RQ Insertion algorithm.

The RQ insertion algorithm in the CPE places new IRs in the local RQ and maintains the local RQ, removing IRs that have aged too much, or whose transmission times have passed, and updating the priority and other control information in the IRs. The identical algorithms are used by those used by the RQ insertion algorithm in the HCC. The local RQ in the CPE is an estimate of the master RQ. This estimate is correct as soon as the CPE has received all the RQUMs with IRs still in the master RQ and the RQ synchronization algorithm has been applied to place the terminal in RQ synchronization.

The transmission scheduler in the CPE plans uplink transmissions using the local RQ. The transmission scheduler removes the upper element of the RQ at the time that its IR transmission time has passed, thus keeping it appropriate for the up-flow interval planning. This is identical with this function in the HCC.

The local system clock in the CPE provides the time base for the method revealed in the CPE. The clock of the local system is locked with the clock of the master system in relation to time.

In some embodiments, it may also be locked to the absolute time of the master system clock. The transmission time of IR transports in or associated with the IRs is in terms of the time of the local system clock. To clarify the displacement of the CPE it is either considered when determining the IR transmission time, or the factors of the transmitter of this displacement when determining the transmission time for the IR transmission time. To clarify, the IR transmission time in each terminal may be different in the revealed method, because the local system clocks may not be synchronized in absolute time. The transmission times are determined so that the affected transmission arrives at the HCC at the time of the planned interval based on the clock of the master system.

The upper element of the RQ is discarded once its IR transmission time has passed. The upper IR discarded if it refers to local messages or to a message in another CPE. This is identical with said function in the HCC in accordance with what is indicated in (i) above.

In the CPE messages to be transmitted they are kept in one or more message transmission queues. The transmission scheduler regulates the transmission of messages in the upstream.

RQ timeline Referring now to FIG. 8, the time distribution of a sequence of actions is shown by the RQ insertion algorithm in the HCC and the RQ insertion algorithm in a CPE. The same (ie identical) RQUM, or equivalent data set, above the HCC and the CPE. This data arrives close in time, but not coincident in time. The RQUM arrives at the HCC RQ insertion algorithm coincident with being placed in a message transmission queue. Therefore, up to the HQ RQ insertion algorithm before arriving at any RQ insertion algorithm. In all cases the time between the arrival of data to the HCC and the CPE is short enough to be in time for the satisfactory operation of the revealed method (ie no uplink transmission will happen to be incorrect in time).

The RQ insertion algorithm in all sites reacts against the arrival of new data when making changes in the database in RQ. This includes placing new IRs that have arrived and adjusting time references such as transmission time and IR age. While the CPE remains in RQ synchronization, the calculations made at this time result in the local RQ being a satisfactory approximation of the master RQ, including such an approximation that the two RQs have the same IR element in the same order. Certain fields of these elements may be different, or have approximately identical values, according to the details of each embodiment.

In the period after the time to update the RQs, the HQ RQ and the CPE RQ are in condition to be compared. When it is stated that the RQs meet certain conditions when compared, it means that the comparison is between the two RQs during the time intervals in FIG. 8. If the CPE has been in RQ synchronization and the reference RQUM in FIG 8, the CPE remains in RQ synchronization. If the CPE does not receive the RQUM at the expected time, as indicated, the contents of the local RQ diverge from the contents of the master RQ and the CPE departs from RQ synchronization.

RQ Synchronization Referring now to FIG. 8 the request queue is displayed. The RQ synchronization algorithm located in the CPE can perform the RQ synchronization process. This process can be carried out in two stages. The first stage is to establish cleared RQ ensuring that no IR is missing from the local RQ that is in the master RQ. The second stage is to eliminate IRs from the local RQ that are not in the master RQ.

The elements of RQ are IRs. Each of these elements can have associated with it, possibly transported in the element itself, the IR transmission time, which is the precise moment of transmission of the associated message, such moment provided by the application of the RQ insertion algorithm. The RQ insertion algorithm determines from information conveyed in, or associated with, each RQUM if it has been skipped to receive an RQUM. If an RQUM (or equivalent data delivery mechanism) has been skipped, the RQ synchronization algorithm restarts the RQ synchronization process. The process is started with the newly received RQUM information.

If it is determined by the RQ insertion algorithm that an RQUM has not been skipped before the received RQUM present, then this application determines whether the terminal has achieved the cleared RQ state. If the CPE is not yet in the cleared RQ state the RQ synchronization algorithm joins another RQUM and repeats the process. In the case where the CPE has achieved the cleared RQ status, the RQ synchronization process removes the IRs surplus from the local IR. In this stage, the local RQ is equal to the master RQ.

In the case where the CPE has achieved cleared RQ status, the RQ synchronization process removes IRs surplus from the local IR. In this stage, the local RQ is equal to the master RQ. The RQ synchronization algorithm then declares the CPE in RQ synchronization, or waits for a confirmation cycle before declaring the CPE in RQ synchronization.

CPE transmission scheduler With reference to FIG. 10, the CPE transmission scheduler can perform the three functions shown, each of which is a planning part and send a message from the CPE. The process of sending a message to a CPE may begin when an application places the message in a message transmission queue. It ends when the transmission scheduler affects message transmission. Between these two events, the transmission scheduler searches and obtains an interval in the uplink assigned for the transmission of the message. The transmission planner carries out three activities in the process.

The transmission scheduler monitors the queue entry or message transmission queues and forms an IR for each new message. The IR is placed in the local IR reservation. Once the CPE is synchronized, the transmission scheduler places an IR in the IR distribution as soon as possible after reaching the IR reservation. To clarify, one embodiment can support multiple IRs in the IR distribution at the same time, or it may require that one IR be distributed (ie in place in the RQ) before another RQ is allowed to enter the IR distribution.

As a first step in the IR distribution, the transmission programmer places the IR in a IRM and puts this IRM in a message transmission queue. The transmission scheduler uses the IRSF algorithm and the knowledge of slot structures AIoha of nearby intervals to select an AIoha slot to receive the transmitted IRM. For each ASBI, there is an associated IR in the RQ. The ASBI is assigned as any other uplink interval. In this way, there is an IR in RQ associated with the interval transmission. In this way, from this IR, the structure of an AIoha interval is known before it arrives. The structure of an ASBI can be fixed or known or it can vary from interval to interval.

The transmission programmer waits for the AIoha slot programmed for the IRM. Just before the transmission, the transmission scheduler confirms that the CPE is synchronized.

Since the CPE is synchronized, the transmission scheduler affects the transmission of the IRM in the AIoha slot. Then, place the IRM in the IRM retention site anticipating a possible retransmission of the IRM.

Refer to claim 30 and subparagraphs. Then, the transmission programmer monitors the IR received in RQUM, or the equivalent, trying to find that the IR that has been transmitted has been forwarded by the HCC. This wait continues for a set period of time or for a set number of RQUM depending on the details of the implementation.

If the transmitted IR does not appear in the downlink in a set time, the transmission programmer declares that this IR was not transmitted correctly, probably because of the possibilities in the AIoha slot. Then, the transmission programmer starts the IRM transmission process again. In the example shown in the diagram, there are no limits or there are very few retransmission attempts. However, in most embodiments, it is anticipated that there will be a maximum number of retransmission attempts allowed. If a transmitted IR appears on time in the downlink, the transmission programmer confirms that the IRM has been transmitted correctly and removes it from the IRM retention site and undoes it. Then it continues its process. In the example shown in the diagram, it implies that only one IR can be in the IRM retention site at a time. However, the transmission scheduler in some embodiments of the disclosed method may have multiple instances of the same process (represented in the reference scheme) occurring simultaneously, i.e., multiple messages may be programmed at the same time.

In the third diagram, the process is presented to transmit a correctly programmed message. Once the CPE is synchronized, the transmission scheduler constantly monitors the top of the Local RQ to transmit an IR associated with a local message. The transmission scheduler determines the IR transmission time of the message represented by its associated IR at the top of the Local RQ. In the transmission time begins the process of affecting the transmission. As a first step in this process, it is checked to make sure that the CPE is still synchronized. If not, the process is abandoned.

If the CPE is synchronized, it determines which message will be transmitted, and if this is a local message or is in another CPE. In an extension, there may be containment slots or intervals programmed by the IR, and the transmission scheduler determines in this case whether it should transmit in these slots or intervals.

The transmission programmer conveniently removes the IR from the RQ. The suppressed IR is discarded or archived. Then, the transmission programmer moves to repeat this process for the next IR in the RQ.

The service messages originate in the SPCS l / O queues and are presented to HC 38, which includes a part of the method of the disclosed embodiment. This flow of messages on the network can be regulated by the SACF. These messages are placed in message transmission queues and the transmission scheduler regulates its position in the downstream.

Messages received in the uplink are placed in message receiving queues. These queues are supplied by the service applications in the SPC and by the control applications in the same HCC.

The request manager gathers interval (IR) requests from certain uplink messages and from local control applications. These are placed in a master set IR 71. From time to time, the request manager 75 forms a control message containing an IR group and places it in a message transmission queue 80 and, coincident with this action, passes it to a RQ 83 insertion algorithm. The RQ 83 insertion algorithm places the IR in the Master RQ 72 and from time to time updates the data in the IR of the Master RQ. The Master RQ contains the functions of the interval program in the uplink.

As shown in Figure 2, the service messages originate in the message tails 93 and are presented to the CPE CC 22. This message flow in the network can be regulated by SACF 95. These messages are placed in transmission queues. of messages and the transmission scheduler 82 regulates its location in the downlink, using the program presented by the Local RQ.

The reception router 74 places the messages received in the uplink in the message receiving queues 77. These queues are supplied by the service applications in the SIM and by the control applications 76 in the same CPE CC 22.

The transmission scheduler 82 forms IRs, one for each interval required by it and places them in the local set IR 88. In due course, it forms request messages called IRM and transmits them to the HCC 38 using an AIoha slot protocol.

The RQ tuning algorithm manages the local RQ in relation to creating it as an exact copy of the RQ Maestro. Occasionally, an IR set is received in a downstream control message. From time to time, the RQ insertion algorithm 79 places these IRs within the local RQ 78 and updates the data in the IR of the local RQ.

The local RQ 78 contains the best calculation of the functions of the interval program in the uplink.

Referring to Figure 3A, time diagrams are present for the use of a channel in the embodiment of the method of the disclosed invention. Figure 3A describes a typical format for the use of the channel, in the uplink or downlink. Figure 3B illustrates an uplink format with messages formatted so that they do not contain message headers. Figure 3C illustrates that there may be spaces in the interval sequences in the disclosed embodiment. Figure 3D illustrates the channel format in an embodiment with security bands.

The embodiment of the disclosed method includes the organization of the channel with a TDMA structure. Mostly, there is a separate uplink and downlink channel with messages that flow in one direction. The embodiments may have multiple uplinks and / or downlinks or may share a single channel for the uplink and downlink.

Messages in the downlink may have message headers. However, all the information necessary to sustain the route may be present in the associated IR. In this way, the embodiments may not necessarily have message headers in the uplink.

The modulation and the demodulation in the links can be organized so that the reacquisition is not required message by message in the downlink. In the uplink, the time may be optimal enough for the message timeout to be preserved between messages. However, there may be at least one need for frequency, phase and level of attraction in the uplink since the messages are transmitted from different sources.

Referring to Figure 4, the time diagram is for a variant that can be used for downlink synchronization-how the receiver locates the messages in the downlink. This variant is based on the length field of the message, under certain restrictions of the organization channel to determine the location of one message followed by another. A correlation sequence called the DTA information structure is present in some message headers to aid in the acquisition of a first message used to initiate the process of tracing message boundaries. Referring to Figure 5, the format for the message of the embodiment of the method is presented. A message may contain a message body and a message header. The body of the message may contain information placed by the application that creates the message. This can be a service application in an SCPS or S1M or it can be a control application.

The message header in the downlink may contain certain fields and others. It can contain an address, an application ID, a type and priority field and a message length field (or equivalent functional structures). The messages in the uplink can have a message header and this header can contain the aforementioned information.

The message header in the downlink may contain an acquisition sequence to help demoduators acquire the message. It can contain a DTA data structure to help locate the data limits of the message. It may contain other control information in an additional space in the message header, as additional information called Other Control Information, as usage information in the particular embodiment of the method.

Referring to Figure 6, the format for the data structures associated with the interval request is presented. Figure 6A presents the interval request (IR). Figure 6B presents the interval request message (IRM). Figure 6C presents the queue update request message (RQUM).

An interval request can contain an address, an application ID, a type and priority field, and an interval length. These fields "describe" the message with which the IR is associated. In fact, the first three of these fields are the same as those found in the message headers, as shown in figure 5. The interval length field may not be identical to the message length field because the intervals may include security bands The CPE and HCC algorithms can take this factor into account and the true message lengths can be carried in the IR; the IR source can add the appropriate extra space to the length when the IR is formed or the HCC can adjust this field on the received IRs - any of these schemes are within the scope of the revealed method.

The IR may contain control information specific to a particular embodiment of the present invention, such as information that has been placed in the field of Other Control Information. The specific optional control information claims the variants of the embodiment of the disclosed method. As shown in Figure 6A, birth time, IR age, transmission time and IR counter may be included. IRs can be created by control applications or by CPE transmission programmers. For uplink transmission, IRs are encapsulated in IR messages (IRM). As shown in Figure 6B, the IRMs may or may not have message headers depending on the embodiment. The IRMs are transmitted in the AIoha slots of the broken intervals of AIoha slots. The transmission is ad hoc and can compete in the transmission period, destroying both. It can carry several transmissions before an MRI is transmitted correctly to the HCC.

The HCC transmits an IR group in the downlink message called RQUM. The format of the RQUM is shown in Figure 6C. The RQUM message header may have specific control information for a particular embodiment carried in the Other Control Information field. The RQUM message header can carry data used to synchronize the RQ in the CPE. You can carry RQ depth fields and RQUM stop time for this purpose. You can also carry an RQUM counter field, whose value is used when managing the RQ synchronization.

As shown in Figure 7, the RQ is a unique queue. The IRs are the elements of the RQ. The RQ insertion algorithm places both the HCC and the CPE in the RQ.

As time passes, the elements of the RQ (the IRs) move to the right of Figure 7A. The rightmost element can be said to be at the beginning of the queue. The RQ insertion algorithm does not need to locate new elements at the end of the queue. The elements can be placed in the queue so that the higher priority IRs, or (delay sensitivity) can be placed higher in the queue. There is a requirement in the location algorithm in which the elements located in the queue reach the first position in a reasonable time, but other algorithms can also be used.

As shown in Figure 7B, in the HCC, the Master RQ simply serves as a record of the status of the uplink. This information is used as a basis to synchronize the information sent to the CPE. It is also used by internal control algorithms to manage the uplink through various means.

As shown in Figure 7C, the CPE, the local RQ serves as a record of the status of the uplink. This information is used to determine when the CPE can transmit on the uplink. The CPE has a local RQ synchronization algorithm with the RQ Maestro, that is, it forms the local RQ so that it is substantially identical to the Master RQ and monitors this synchronization.

Figure 8 shows the timeline for maintaining a comparable RQ Maestro and a local RQ. The updated information can arrive at the HQ RQ insertion algorithm at a certain time at the start of the update cycle. At a different time, probably later, the same updated information arrives at the RQ insertion algorithm to a CPE, which can also start the update cycle. Before the update cycle begins at either terminal and after both complete the update cycle, the RQs are substantially comparable. It is said that the local RQ is synchronized RQ if it has the same IR set located in the same order as the RQ Maestro during the period after both have been updated with the same information. The updated information can mostly arrive in an RQUM in both the HCC and the CPE.

Figure 9 describes a diagram established for a typical RQ synchronization algorithm. The synchronization can happen in two phases. In the first phase, the RQ synchronization algorithm in the CPE ensures that it has received all the updated RQ information sent over a period of time. This period is determined so that all messages associated with previous RQ elements have been transmitted in the downstream. The second phase of the RQ synchronization then determines which of the two elements in the collected series remains to be transmitted, with the probability that some of the messages associated with these new elements have already been transferred at the time the determination has been made. . Such outdated IRs can be removed from the local RQ and synchronized.

With reference to figure 10, the transmission programmer in the CPE can execute three different tasks, which are shown in the established diagrams. The effect of these three tasks combined in programs is to program and transmit a message.

The transmission programmer in the CPE monitors the message transmission queues, and properly forms an IR for each required interval. There are modes of operation where a message can be placed in a range reserved by some other CPE or the HCC.

The transmission programmer can properly have an IR from a local IR set, form an IRM and transmit it using the protocol.

The transmit programmer monitors the first position of the RQ and transmits a message where the first IR position is associated with the local message.

The transmission scheduler can also remove the first IR position after the IR transmission time has elapsed.

Operation The system and method of an embodiment of the invention allows an unrestricted number of terminals to be served in a communication network that is configured with: 1) a single central terminal (the HCC) and 2) multiple terminals (CPE) ) located at a distance from the central terminal. The CPE exchanges digital data with the HCC through any two-way communication channel (duplex) or a set of channels that has capacity that can be shared by the CPE.

An embodiment of the present invention as described herein employs AIoha slot communications and a queue theory. The information exchanged can be entered in the messages by the sources. These messages are digital data sets. The length of each message is not fixed but the average message length in each channel is prescribed and the traffic is disciplined to find this prescription by several means.

The HCC receives the information to be transmitted to the CPE from an interface equipment that is connected between the HCC and control subsystems service providers, such as those Internet service providers, television stations or telephone companies. The HCC transfers the information sent by the CPE to these control subsystems service providers. The CPE and the HCC also serve as sources and destinations for control information.

In order for the information to flow from one CPE to another, a service provider in the HCC can forward it.

The physical channel or channels that carry the HCC data to the CPE is called the downlink. The physical channel or channels that carry the CPE data to the HCC is called the uplink.

The downlink data transmission can be easily controlled, on a real-time basis in a TDMA manner, by the HCC to share the available capacity among the service providers and provide several control information networks.

Hosting a large CPE number is carried out by assigning an uplink capability on the CPE handwheel as required. The protocols, processes and algorithms unique to this patent deal with the function of the uplink capacity and the execution of the transmission of the data according to this document.

The method according to the embodiment d of the invention keeps the uplink complete if the traffic allows it, and makes the access totally flexible. The method of the disclosed embodiment does not set a limit or is small in the number of terminals in the network. The capacity available for a single terminal is easily reduced while the number of terminals is increased. The disclosed method minimizes the delay of transmission of message data through the network.

The uplink is kept complete by having a reservation system so that no uplink capacity is wasted in delays caused by waiting for the exchange of control information. In other words, the uplink is kept complete by having a managed reservation structure to minimize downtime. This second criterion is established by keeping reserves in a queue of significant depth (mostly 10 to 100 reservations), thus, the request bursts and stops easily.

Access is basically flexible. The terminals or services (depending on the embodiment) have an average load prescribed in the uplink. This is the only restriction on flexibility.

There is no inherent limit in the revealed method. In fact, the method works best with several terminals present. There is an inherent requirement in the average loads of the terminal network for the traffic of loads of the total messages in the uplink to find an established limit in the design of the network, the exact nature of this prescription depending on the form of realization.

Due to the practical and established limits in the entry for the services of the downlink, the delay of the same is not significant. The uplink delay is dominated by the allocation of two phases of the uplink capacity: 1) order distribution and 2) delay of the reservation service.

A number of techniques are incorporated into the invention to reduce this delay. The data reservation elements (called interval requests), which are small compared to the average size of messages on the network, are sent upstream. Reservations are small to reduce headers. AIoha slit technology is used to prevent any structure from participating in the terminals in relation to the use of its capacity (that is, to avoid assigning fixed amounts of capacity for each terminal - the "circuit" concept). The reservation system is distributed to the CPE terminals to avoid delays and loss of capacity in the performance of reservations.

The distributed control system supports very low headings and fast response, but at a cost where the terminals can interfere with each other if they lose control information. A good part of the invention is devoted to methods and inventive means to reduce or eliminate this possibility.

The central structure in the sense to acquire a fast and effective task of the capacity of the uplink is found in the collection and distribution of orders. The requests are collected from the CPE in an ASBI that contains AIoha slots. Each AIoha slot can carry a request. The HCC controls the frequency of the ASBI and the number of slots in each interval, thereby controlling the performance of the revealed method. This control of ASBI can be performed in a very elaborate or very simple way depending on the nonsense of the embodiment. The requests flow in the HCC in one group at a time, each group of requests carries an ASBI. An important factor in the performance of the system is the smooth effect on the traffic request of this collection process. The requested transmissions are allowed to compete with the Alhoa slots - there is no structure prescribed in the terminals for the access request except that the slots selected for IR transmission are selected at random and there must be a process for effective retransmission if a containment occurred, of which a number is known.

Due to the presence of containment, it is expected that a CPE will have to repeat the transmission more than once within the average.

The requests are distributed instantaneously from the HCC to the CPE and enter the request queue (RQ) carried in each CPE. This RQ is considered an estimate or a copy of the Master RQ located in the HCC. Requests can be organized for service by priority. There are several means and methods to regulate the flow or requests through the RQ. All CPEs see the same request database and implicitly know the tasks in the uplink.

A CPE that has requested an uplink capability simply regulates the RQ, as any other terminal does. When the assignment for an interval carrying the local message is updated, the CPE reacts and transmits correctly.

The aforementioned process works well under 100 milliseconds of delay in a well-balanced embodiment for a network with uplink and downlink in full use.

Physical layout of the network System 10 includes a central site with the HCC. The HCC connects to a set of SPCS in the central location. A large number of customer sites located at a distance from the HCC site - a representative number could be more than 10,000 distant customer sites. These sites extend through a disk centered on the HCC. A representative radius of the disc could be between 5 and 50 miles.

The HCC site is associated with an existing broadcast site, with an associated antenna infrastructure. Client sites are mostly homes but other facilities can also serve for system 10. CPE sites are located in established locations with antennas attached to the structures. SIMs are a part of the physical structure of the CPE. The SIM and SCPC are coordinated to provide prescribed messages of average length and average speed messages. The decision to transmit a message to a CPE is independent of the decision to transmit a message to another CPE.

Channel structure FDD one below and one above System 10 can include a block of contiguous 6MHz channels used with a center frequency in the sending band - with a central frequency range of 54 MHz to 756MHz.

A representative size for this block is 4 channels providing a bandwidth of 24MHZ. A single channel located in the block for the uplink and a single channel for the downlink. This is an FDD provision.

Channel structure, FDD one below and several above An alternative embodiment for the channel structure may be preferably in the case where there is a desire to limit the uplink transmission power. A block of contiguous channels of 6MHz can be used.

Several unique channels are located in the block for the uplink and a single channel for the downlink. A representative number of uplink channels is 10. The CPEs are assigned to one or the other uplink permanently. This remains an FDD provision.

Channel structure TDD one below and several above An alternative embodiment for the channel structure may be preferably in the case where there is a desire to limit the uplink transmit power and a desire for the maximum possible bandwidth of the downlink. A block of contiguous 6MHz channels is used. The entire channel is used in a TDD form. The downlink uses the entire bandwidth. When a time period is assigned for the uplink, the channel is separated into a number of smaller bandwidth uplink channels with the CPE assigned to one or the other of these uplink channels permanently. When the time period for uplink transmission arrives, the CPE assigned to different uplink groups transmits in parallel.

Modulation and Coding Digital modulation is used for the uplink and downlink. The modulation supports several bits per Hertz in the downlink and uplink. A representative modulation would be 64 QAM at 6 bits per Hertz. A representative MTU is 6 bits. The channels are coded and interleaved. A representative error rate in bit with the coding of the channel is 10-10. A representative coding rate is 0.9.

The speeds of the channel symbol can be set. The information representative of the speeds after the coding is lOOMbps in the downlink and 15Mbps in the uplink.

Interval and Message Structure The downlink has continuous message transmissions. There may not be security space in the intervals.

The transmission is consistent in the limits of the message. The uplink is an aligned message boundary. A representative accuracy is 1/10 of an MTU. There may not be security space in the intervals. Uplink messages have acquisition sequences in their message headers.

System time In the registration process, the CPE is informed of the downlink symbol speed with respect to the Master System Clock. The CPE closes the speeds of the Local System Clock for the downlink and looks for this speed. The CPE does not close for the time phase of the HCC.

Operation Parameters and Operation Points The following can be operation parameters for the system 10: 1) Average message length - 640 bits; 2) Average message speed - 2580 messages per second; 3) AIoha slot rate - 10,800 slots per second; 10 4) AIoha Slots / AIoha Interval - 108 slots (100 ASBl per second); 5) Operation point - 0.4 (3.73 AIoha slots per message); 6) Resolution of the message size (MSR) - 6 bits; 7) Minimum message length - 6 bits; and 8) Maximum message length - 9.250 bits 15 General Message Format - Downlink The following can be a general downlink message format for system 10: twenty .

This structure can support more than 4 million CPE and 256 different applications with 64 different priority and type levels. It can hold messages of more than 200,000 bits in length. The upper message header may be less than 1%. The HCC sends a special control message from time to time to sustain the acquisition of the downstream.

General Message Format - Uplink The following can be a general uplink message format: OCI means Other Control Information The Address and Other Control Information are carried in the associated IR. Interval Request (IR) The following can be an IR: The IR counter is an option that is present to allow an IR number to be in distribution at the same time from the same CPE. This counter only needs to have a few bits. In the manifestation of IR in the RQ, several fields can be added: The IR transmission time is in a range of one second for a resolution of 10 nanoseconds.

The IR Age is in terms of the RQUM account. It can be started in 1, representing the RQUM that carries it and increasing each moment with the arrival of another RQUM, (in the HCC as in the CPE) Interval Request Message (IRM) The following can be an interval request message : The IRM is allowed to break the message size resolution rule to save the channel capacity. It is a known fixed length.

In one embodiment, the upper IR is 2.3% (considering the average number of IRs transmitted per message, which may be more than one by repeated transmissions).

ASB1 The following can be an ASBI: Interval Size 8640 bits Slot 1 80 Slot 108 80 Queue Update Request Message (RQUM) The RQUMs are formed and transmitted when an ASB1 arrives and processed in the HCC. This happens 100 times in a second.

There are around 29 IR per RQUM providing an average size of around more than 300 bits.

The Depth RQ field carries the IR number in the RQ.

The Maximum Time RQ is the time difference between the transmission time of the RQUM and the IR transmission time of the maximum element of the RQ (the element whose associated message has not begun to be transmitted). The RQ Maximum Time extends in seconds for a resolution of 10 nanoseconds.

The RQ Counter is a circular counter (increasing the longest number to zero).

The DTA data structure is a correlation sequence used for the downlink acquisition.

RQ size: S The following can be an RQ size: The RQ size is 1000 IR elements. The expected depth of RQ is determined: Uplink information rate: 15,000,000 bps Uplink message speed: 2850 messages per second Uplink message size: 640 bits The uplink efficiency is 97% and the average RQ depth is 36 GO. The expected delay through RQ is 36 messages or 13 thousandths of a second.

IR set size The following can be an IR set size: The IR Master set and the local IR set can hold 1000 IR.

Message Queue Structure The HCC has a receipt message queue for each present service provider, as represented in an SPCS. The limit is close to 256 service providers. It is expected that a typical number of present services will be in the order of 10. The HCC has a queue of reception messages for control messages.

Each CPE forms a queue of reception messages for each SIM present. The CPE has a receipt message queue for control messages.

The HCC has a transmission message queue for each present service provider, as represented in an SPCS. The HCC has a transmission message queue for control messages.

Each CPE forms a transmission message queue for each SIM present. The CPE has a transmission message queue for control messages.

ASSA The AIoha Slot Production Algorithm (ASSA) generates a request for an ASBI every 10 thousandths of a second. The ASBI request can be of an established slot size - 108 slots.

The slots are of an established size - 80 bits.

IRSF Each IRM transmission is transmitted with a uniform probability in a slot of the "next" ASBI. This is true for the first transmission.

For retransmissions, the CPE must receive an RQUM to determine if the IRM has been correctly received by the HCC. This RQUM is formed and sent immediately upon receipt of the ASBI in the HCC. The delay to return to the RQUM is approximately 0.5 thousandths of seconds, at most. In fact, the CPE has time to install itself and retransmit the IRM in the "next" ASBI.

Regulation of the transmission speed of the IRM The CPE may not regulate the transmission of the IRM. Multiple IRMs can be placed in the IRM distribution from a single CPE. The IR counter can be used to distinguish different IRs that are in distribution. The IR counter can be increased for each new IRM.

The regulation of message length and message speed can be left for the SIM. However, a control message is included in the embodiment that is used by the HCC to direct all terminals to cease transmission of data for a service provider. This provides a substantially fault-free mechanism for cases in which the SIM control function has an error in the design that causes your SCAF to fail or that can be tampered with or pirated.

In the case where an IRM has been retransmitted 8 times, the terminal randomly distributes the next retransmission over 20 ASBl. This occurs for an IRM in 10,000 in this embodiment and indicates a stacking of the IRM requests that is bothering the ASBl. This can add 100 milliseconds to the average of the reservation delay for these strange IR transmissions. However, all the MRIs that enter the network are transmitted correctly.

The expected number of transmission attempts for a correct IRM transmission is 1. 5. In fact, the delay is expected to be 20 thousandths of a second due to the request protocol.

Insertion RQ - FIFO The insertion algorithm RQ can locate new IRs in RQ on the back since they were removed from the RQUM - from the end of the first message header.

Insertion RQ - Priority Example An unlimited number of priority location methods may be available for consideration. The key criterion is that if the elements are lost from the local IR (compared to the Master RQ), the relative location IR may not change. An example of this method is described herein.

The IR can be removed from the message header of the nearest RQUM by the RQ insertion algorithm and considered as follows, one after the other.

The IR can be located in the RQ by the RQ insertion algorithm as follows: in the process of locating a new IR in the RQ, a search is made by the RQ insertion algorithm from the back of the RQ followed by the first IR with a speed priority greater or equal.

The IR candidate is placed as close as possible behind this IR. However, it is not placed in front of any IR with an IR age greater than the priority delay limit.

PRIORITY LIMIT OF PRIORITY DELAY 1 0 2 1 3 5 4 16 The maximum average age of IR may be RQ, which may be around 1.5.

For example, a priority of 1 IR arrives. The RQ insertion algorithm searches through the RQ, continuing past low priority IRs whose IR ages are not equal to or greater than the priority delay limit mentioned above, until it reaches a priority 3 message with an age GO 6. The new priority 1 IR is then placed immediately behind this IR.

In this example, priority 3 IR has been in the RQ for 5 transmission periods RQUM (it was initiated with an IR age of 1). This takes approximately 5 thousandths of a second. Once the resident time has been this long, no IR can be placed in front of it in the RQ and moves forward smoothly.

After adjusting the IR age values according to the completion of the location of the IRs of a RQUM, the RQ insertion algorithm deletes all IRs with an IR age greater than or equal to 64 (a probability event 0).

If an RQ overflows (a probability event 0), the RQ insertion algorithm discards the IRs of the RQ, beginning with the most recent priority 4 IR (including those arriving at the RQUM) and following through until all the priorities 4 IR are discarded and then following up to the most recent priority 3 IR, etc. Only a sufficient number of IRs are discarded to make room for the location of new IRs of adequate priority to avoid cutting.

Clock synchronization The downlink symbol speed is defined in the control information that passes to the CPE during registration. The CPE closes the downlink, using the symbol speed to handle the local system clock. The terminal is declared in clock synchronization when the phase closure loop is closed.

Downlink synchronization The DTA data structure provides a means to capture the position of this field within a RQUM by correlation. The known structure of the RQUM message header may allow the CPE to determine the location of the message length field. This can allow the CPE to close in the RQUM as well as determine where the next message length field is located. The CPE decodes following the messages through this successive location of the message length field.

The CPE can be declared in the downlink synchronization when it confirms the capture of the DTA data structure by capturing this structure in the next RQUM in the location that is expected, therefore discarding the following from a sequence of lengths of falsely detected messages.

The CPE confirms the downlink synchronization with each DTA data structure that arrives at an RQUM. If there is a fault to be confirmed, the terminal is declared out of synchronization of the downlink.

RQ Synchronization The RQ synchronization process in the disclosed embodiment can use four data elements to achieve RQ synchronization: IR age, RQ age, RQUM count and RQ count.

The IR age is measured in the number of RQUM that have been transmitted since the IR has entered the RQ. The 6-bit field can maintain a count of 64 RQUM, which represent approximately 640 thousandths of seconds on the average and about 1824 IRs (that is, messages). The RQ has a capacity of 1000 IR and an expected depth of 36 IR. In fact, this field is adequate to save the IR age for any IR in RQ.

The IR age is transmitted in RQUM and is the IR age of the oldest IR in the RQ teacher. This parameter is an example of Other Control Information specific to a given embodiment.

The RQ synchronization process begins by clearing the RQ and initiating the location of a new IR beginning with the next received RQUM. It continues to collect the IRs and incorporates them into the RQ while the RQUM counter of each new RQUM indicates that no RQUM has been overlooked. If one has been lost, the RQ synchronization process begins again.

When the RQ age in an RQUM is equal to or less than the oldest IR age in the local RQ, the RQ synchronization algorithm declares the CPE in the cleared RQ state and declares the RQUM synchronization to the associated RQUM. It can be seen that all IRs in the master RQ are present in the local RQ.

The RQ depth field in the RQUM synchronization establishes the IR number that should be in the local RQ. IRs are removed from the top of local RQ until it contains this number of elements. It can be seen that the associated messages for these IRs have already been transmitted.

The terminal is then declared to be in RQ synchronization.

Uplink Synchronization In the disclosed embodiment, after a CPE has achieved clock synchronization, downlink synchronization and RQ synchronization, uplink synchronization can be performed each time the RQUM arrives beginning with synchronization of RQUM.

In the uplink synchronization process, the IR transmission time of the maximum IR of the RQ is set to the maximum time value of RQUM minus the offset CPE (or CPE offset from initial instruction sequence) plus the local system time present . This step can bind to the IR transmission time with the local system time but does not require that the local system clock be synchronized in phase (absolute time) with the master system clock.

Before CPE registration, the CPE offset from the sequence of initial instructions is used to compute the IR transmission time. This provides the appropriate transmission time for the registration but is not suitable for the transmission of common messages. The acquisition of a shifted CPE is needed before a normal uplink transmission is allowed.

The process continues with the message length values used to calculate the IR transmission time for all IRs in the local RQ, based on the IR transmission time of the IR at the top of the local RQ.

The CPE is declared in uplink synchronization when this process occurs for the first time and thereafter it is maintained in uplink synchronization.

Registration and offset CPE adjustment After the CPE has initially achieved uplink synchronization it can perform the registration process. In the disclosed embodiment, the HCC has a list of CPE candidates to register. The operator in the HCC updates this list on a daily basis.

From time to time, the HCC may send an IR for a special registration control message containing as address, the address of a CPE candidate, that address contracted in the CPE hardware or software.

Having achieved the uplink synchronization, the CPE candidate monitors for the IR of the registration message addressed to the CPE by means of the address. When this IR appears at the top of the local RQ, the CPE transmits a registration message to the reserved upstream interval. The interval is reserved with sufficiently long security spaces to allow misalignment of the IR transmission time within a range of possible times, as determined by the propagation distance of the CPE to the HCC.

The HCC receives the registration message, records the location of the message in the interval and thereby determines the offset CPE.

The HCC transmits the CPE value moved to the CPE in a control message. The CPE records the offset CPE and uses it to update the IR transmission times thereafter. After said first update, the CPE is synchronized and in a position to transmit messages.

Occasionally, the HCC may transmit an IR designating a scroll update message and addressing an arbitrary terminal. In this special instance, the CPE may transmit the message to a point a little later than the IR transmission time of the associated IR. This small offset is chosen to place the messages in the middle of an interval with some small security spaces so that the HCC can calculate a subtle correction for the CPE moved from the terminal. The HCC cycles through all the terminals on a normal basis; adjusting your compensations while the above happens. The cycle time selected for the embodiment is 2 hours.

The disclosed method and the system 10 provide the medium access control (MAC) function for a communication system (the "network") in a form to support an exchange of scalable and responsive messages between a plurality of terminals distributed to a distance. The method of the disclosed embodiment can sustain the data communications of any digital service without preference or distinction, for example data for Internet, telephony and television services. The word "application" as used herein means hardware or software functions or processes and the method of the embodiment of the invention can be organized into a set of control applications and databases, which reside, possibly with other applications, in the physical elements of the hardware or software of the terminals.

The Header Control Computer (HCC) 21 may comprise a group of databases and applications located at a central site. The HCC is the only source of data communication system sent to the distributed terminals in the network and the only destination of the data communication system sent to the terminals distributed in the network and, even more, the HCC 21 causes the data be sent and received by the methods, protocols, techniques, formats and processes as described herein. The junction in the network that supports the data flow from the distributed terminals to the HCC is described here as an uplink. The junction in the network that supports the flow of data from the HCC to the distributed terminals is described herein as a downlink.

Each of the plurality of terminals of the user's site equipment (CPE) includes a group of databases and applications and receives, in the network, the messages that are addressed to it or to the groups that are included, such as CPE that share access to the network for the purpose of sending and receiving messages using methods, protocols, techniques, formats and processes as described herein. The CPE can be divided into the transmission / reception section, the CPE CC control section and the set of interface modules.

In a preferred embodiment of the disclosed method, the CPE is in fixed locations. The CPE can be used in mobile locations according to another embodiment.

The control information associated with the regulation of traffic flow in a network can be carried out in the same network. All or part of this control information can be carried out through links that are not part of the network.

When it is integrated, two interfaces appear, with special characteristics that provide, through the known means, the complete separation of the specific control of the service from the service control; These interfaces include databases and applications. The applications in the specific site of the service are called service applications.

An interface between the HCC and the service-specific modules or functions called service provider control subsystems (SPCS) provides one for each service that is held on the network. The interface and the control functions necessary for the use of the revealed method support the particular offers of the services. Figure 1 shows a representation of the functional locks associated with the interface between an SPCS and the HCC.

The second interface is located within the CPE, between the CPE CC and the service-specific modules or functions called service interface modules (SIM). These modules provide, for each of the services supported in the CPE site, the interface and the functions necessary for the use of the revealed method to regulate the data fiow between the presentation and storage devices associated with said services in a site of Local CPE and the SPCS that are associated with the services on the HCC site. Figure 2 shows the functional locks associated with the interface between a SIM and the CPE CC.

As a variant in the SPCS interface, when incorporated as a part of the disclosed method, an SPCS (or relative systems associated with the SPCS) forwards the messages sent from a CPE, or variations or derivatives of said messages, to a different CPE or a CPE group, in such a way that it provides a group connection between the CPEs.

The system 10 and the method provide a message service admission control (SACF) function which is one of the functions carried out by the SPCS and the SIM in an interface for the HCC and the CPE, such as the SACF with the function of disciplining or monitoring the traffic of messages offered to the network so that this traffic has the static or average properties required by the BSDP embodiment. The properties include, but are not limited to, some or all of the following: 1) average message length; and 2) average message speed (see claim 10 and subparagraphs). In order to support the SACF function, the service applications, or the control applications that act to sustain a service, can communicate with each other using service-specific control information transmitted with certain types of service messages. Figures 1 and 2 represent the role of the SACF function in SPCS and SIM in regulating the flow of messages to the network.

The system 10 and the method for a network can share one or more channels using time division multiple access (TDMA), which are claimed when they are integrated into the system structures. Figure 3 presents the physical organization of the channels in the revealed method.

The transmission time can be organized in series of contiguous time periods of a variable length denominated in the present intervals. Interval limit times are measured in the HCC in relation to the master system clock Some devices have substructures that provide more than one contiguous period of time in the interval. These substructures of time periods are called slots. Whether or not an interval has slots is implied in the message header in the downlink and in the upstream interval request. For a better understanding, the slots have the purpose of allowing several messages to be carried within an interval. As the upper control of the system 10 is associated with the programming intervals, the use of slots can increase the efficiency of the use of the channel with the revealed method.

The messages can be moved in the uplink and downstream intervals. Each of these intervals can be dynamically assigned and measured to carry exactly one message with an efficiency and effectiveness commensurate with the objectives of the embodiment - mostly the 'message fits exactly or almost exactly in the interval. For some purposes, the slots can be assigned to carry a specific message or a non-specific message of an application and known length (for example, voice packets). For a better understanding, different CPEs can transmit the messages in the uplink in different slots of a single interval. Empty slots or intervals are allowed or in which more than one message may be transmitted in a slot or interval in such a way that the signals may compete or struggle and the information may be overshadowed or destroyed.

The upstream messages are transmitted so that they can reach the HCC correctly positioned within the associated range or the slot time limits and the downstream messages can be transmitted so that they can leave the HCC correctly positioned within the associated range or limits of slot time.

The system 10 uses frequency bands of separate physical layers for the transmission of uplink and downlink messages, an organization known in the art as frequency division duplex (FDD).

The system 10 sends uplink and downlink messages in a shared TDMA physical frequency band, such channel organization is referred to in the art as time division duplex (TDD).

For the FDD organization channel, the uplink intervals are a contiguous sequence with an end time of a range that serves as the start time of the next interval; and the downlink intervals are located in a contiguous sequence with a time completion of a range that serves as the start time for the next interval.

An alternative also claimed is that the unused spaces are allowed between the intervals in both the uplink channels and the downlink channels, or both. Figure 3 illustrates the locations of the intervals in the channels.

For the TDD channel organization, the intervals are located in a contiguous sequence with an end time of one interval serving as the start time of the next interval, but each interval may be an uplink interval as a downstream. An alternative also claimed is that the unused spaces are allowed between the intervals in the organization of the TDD channel. Figure 3 contains examples of the use of intervals in channels and are incorporated herein for reference.

A CPE network is organized into groups assigned to subchannels. The tasks can be static, that is, performed once or once in a while during the life of the group, or dynamic, that is, carried out in the steering wheel as a function of the instantaneous needs of the CPE or the pattern of use of the net. An elaboration of the TDD structure is performed with a complete bandwidth, a downlink channel and an uplink channel divided into a number of narrowband channels which together have the same center frequency and the total bandwidth as the downlink channel; said arrangement is designed to need lower CPE transmission power but to maintain a high bandwidth downlink connection. For a better understanding, in that structure, the HCC maintains a master RQ for each uplink group.

Some or all of the slots and slots may include a security space (a protection time slot between messages). The need for such security spaces depends on the accuracy of the local system clock in tracking the master system clock in a particular embodiment.

The system 10 modulates, transmits, obtains, searches and demodulates signals in the uplink and downlink, mostly referred to as the physical layer. The physical layer may be appropriate for the medium and application of a particular embodiment. The forms of the physical medium and / or modulation are different in the uplink and downlink. The forms of uplink and downlink modulation and data rates can be controlled within the system 10 to be altered in real time to optimize the performance of the data transmission in the different channels of an embodiment.

Each message in a channel can be a contiguous sequence of a physical layer of minimum transmission units (MTU), organized and formatted and transmitted in a coherent manner during an interval or slot. An MTU is the smallest data transmission in which the physical layer implementation is capable. The size of an MTU, measured in bits and / or seconds, may vary according to the embodiments of the physical layer. For example, a QPSK modulation scheme can have a 2-bit MTU. The size of the MTU can be different in the uplink and downlink or it can differ while the time elapses.

The upstream and downstream messages on the FDD channels or subchannels are sent back-to-back, the last MTU of a message followed immediately by the first MTU of the next message. Upstream and downstream messages from a single TDD or subchannel channel can be mixed within the sequence, but can be sent back to back.

In the absence of SPCS messages or the need for control messages in the message transmission queues (Figure 1), the HCC maintains the downlink intervals of the network complete with innocuous or null control messages or a combination of both . In the absence of requested message intervals from the CPE or the need for uplink control messages, the uplink channels of the network are kept complete with innocuous or null control messages or a combination of both, as requested by the HCC .

There may be spaces in the downstream and / or upstream message transmissions. These spaces can be associated with empty intervals or slots or with the absence of intervals.

Clock synchronization can be maintained at a precision that allows demodulation without the loss of symbol boundaries between one interval and the other, both in the downlink and in the uplink or in both. The downlink transmission by the HCC can be consistent from one message to another.

An acquisition sequence field is used in the front of some or all of the message headers or in special control messages to support, by known methods, some or all of the frequency, phase and symbol limit acquisitions and other functions, the specific to that field depend on the embodiment.

The message uplink sequence may have contiguous boundaries and a specific frequency alignment, both are adequate to provide the means to correctly track the symbol boundary and the frequency of one message to another, these methods provide the means to eliminate the information acquired in the message header. For a better understanding, the HCC demodulator in this variant is able to track or close the modulation of each incoming message without retracting the full signal acquisition. Known methods of channel coding and interleaving are used to retrieve the symbol errors from the message as in the first symbols of a message resulting from the application of this variant.

The integration of known methods of digital signal acquisition, demodulation and tracking to be used for CPE clock synchronization, called the local system clock, can be used to determine the time for actions associated with the system; the synchronization that is with the HCC clock, called the master system clock, can be used to determine the time for the actions associated with the system in the HCC; synchronization (clock synchronization) in the present means that the local system clock runs (ie, at an instantaneous speed) at the same speed as the master system clock. The local system clock also tracks the phase (i.e., time) of the master system clock, with a time possibly set by some known set value such as the CP offset. For a better understanding, in the preferred embodiment of the disclosed method, the local system clock may not need to provide the master system clock time. It is appropriate to track the progress of the master system clock by the local system clock (ie, the instantaneous speed).The clock rate of the master system clock is determined by downlink data rate tracking means, said methods being by the use of a closed phase return or other known methods, in combination with a data rate value of defined and communicative downlink or a protocol based on marked time. A data element that records the clock synchronization state is maintained in the CPE - the e emem e e graph that is inside or outside the clock synchronization, that state determined by the clock synchronization method. For example, if a closed phase lap that tracks downlink data is closed, the CPE is within clock synchronization.

The MTU transmission speed CPE is determined based on the local system clock that is within the clock synchronization. The uplink closes for the downlink. The HCC knows exactly the baud rate in the uplink related to the master system clock and can compute the time lapse associated with a message length or interval.

Conventional methods for the CPE can be used to acquire and trace the uplink interval limits, called the downlink tracking algorithm (DTA).

It is said to be the synchronized downlink also called downlink synchronization when a CPE has the information of a start time of the downlink messages, measured in relation to the master system clock, with a useful certainty (ie for a probability suitable for the purposes of the embodiment).

Each downstream message has an acquisition sequence and the CPE obtains each message, so that the start time of the message is automatically determined and thus always maintained in a downlink synchronization state. For a better understanding, this method is useful when the message start time can not be known exactly, for example in the case where the HCC transmitter is turned on to transmit each message and then off.

The message length field located in the message header of the associated downstream message provides a means for determining the next interval limit and so on; such variants include the use of a DTA data structure located in some convenient group of downlink control messages, such as RQUM, but may not be located in all downlink messages and the DTA data structure is used to determine the location of the message length field of the associated message, which, in turn, is used to define the location of the associated message and to find the associated message field of the next message, thereby supporting the start of said determination of recursive interval limits; this variant is applied in the case that the downlink messages are transmitted continuously (allowing, however, the start-up exceptions and occasional spaces that cause the loss of a known and acceptable amount of data transmitted by the CPE) without the security spaces in the intervals and with the modulation maintaining the alignment of the symbol limits of one message to the other and with or without the coherence phase through the message limits.

The DTA data structure has a structure that has a data pattern that rarely occurs and an attractive auto-correlation property, appropriate for each embodiment. For a better understanding, the DTA data structure does not support the basic physical layer channel acquisition functions of frequency, phase and symbol acquisition. A variant of the DTA data structure claims that it is known in the art as a correlation sequence (i.e., a sequence of fixed bits, with the property that it has a very low self-correlation unless it is correctly aligned with itself). ), said sequence with false detection and removal probabilities suitable for sustaining a useful downlink synchronization, as required in a specific embodiment.

The CPE may capture each DTA data structure and use a cross-check with a predicted location of said correlation sequence to establish and confirm the downward synchronization. If such a check fails, the CPE declares that the terminal is not in the descending synchronization.

A data structure, called a message, is shown in Figure 5, which illustrates the structure of the message. Messages are carried in intervals or slots.

The format of the body of the message (Figure 5) for a particular message, as designated for a particular application ID, is determined by the designer of those applications that are intended to send and receive the message, whether service applications or control. In the disclosed method, a message may have a message header (Figure 5) or its functional equivalent. The message header is represented in figure 5. A downstream message will have a message header or functional equivalent. A rising chain message may not have a message header, depending on the embodiment. For a better understanding, this occurs because in the revealed method the control information that needs to be associated with the message can be carried in an associated IR. A message header carries the control information used in the disclosed method to determine, among other things, the route, priority and format of a message. The message header can also be used to carry the information of synchronization and acquisition.

A message length field (FIG. 5) carries the value of the associated message length, said value from the time point of view, MTU or other data units or functional equivalents, as appropriate. The message length field is included in the BSDP method, in the downlink message message header, and may be included in the upstream messages.

An address (Figure 5) is included in the downstream message message header and may be included in the upstream message message header. For a downlink message, the destination is designated in the address field, said destination can be a CPE, a CPE group and all CPEs. For a rising current message, the control entity is designated in the address field, if this field is present. This is the HCC or a CPE. Mostly, the designated CPE is the one that transmits a message to the interval. However, the control entity may be other than said transmission entity. The control entity may request the interval for use by another or other entities as organized and controlled by the service and / or control applications in a particular embodiment.

An application ID (figure 5) is included in the message header of the upstream messages. The ID application indicates to the receiving route which service or control application is the proposed destination and provides said receiving route with the necessary information to route the message.

A type and priority field (Figure 5) is included in the message header of downstream messages and can be included in the message header of upstream messages. The type and priority field is used by the RQ insertion algorithm application to determine the programming of a message and can be used for other purposes.

The message header may carry additional control information specific to the embodiment, called other control information.

In the revealed method, the service applications organize and direct the service messages to be transmitted; said service message is a type of message. Service messages are directed to service applications.

The control applications that reside in the HCC or CPE CC (figures 1 and 2) organize and direct the control messages to be transmitted; said control message is a type of message. The control messages are directed to control applications. Some embodiments may include control messages associated with: i) the CPEs that join the network including the registration and determination of the CPE offset (see claim 26 and subparagraphs) ii) the establishment and support of various priority and categorization arrays iíi) the updating of the control algorithms iv) the synchronization of the encryption systems v) the modification or variation of the modulation and other physical layer modes; and vi) the sustenance of other administration and control functions considered necessary by the designer of the specific implementation. For any given embodiment, there is a required group of control message types and associated data types that are present, as defined later.

A request interval (IR) (FIG 6). The IR data structure is used to transmit a range of uplink channel capacity. It is called an interval associated with the upstream interval associated with an IR. An IR associated with an ascending interval. It is called the IR associated with the IR associated with a current interval. Each interval has one and only one associated IR. If the interval has no slots, it is then associated with one and only one message (see claim 5 (c), these messages being referred to in this case as the associated message.) Certain key message characteristics, illustrated in figure 6, are recorded In the IR, each IR has a length range field, which defines the length of the associated interval in terms of a convenient measure (see claim 10 (c) for the length of the message field comparable to a header message). clarify, due to the presence of the security space, 5, the interval length for a length interval, may be greater than the length of a message for an associated message, or greater than the lengths of the combined messages for a set of messages to be placed in the slots of a single interval.The IR contains address, application ID, and type and field priority.The combination of these three fields can be used in a This is used to transmit the necessary control information in the MAC layer, to organize different and separate message transmissions in slots of a single interval. The IR may contain other control information according to claim 10 (g) The IR is present in several different control message types - namely at least in IRM and RQUM, and is the element, or provides element information, ported in the request row. For clarification, an RQ element may contain a data structure comprising a part of the IR information, or independent information in addition to some or all of the IR information, depending on the detailed design of the embodiment. However, the RQ element must, at a minimum, contain the address and interval length of the IR on which it is based (see FIG 6).

For the convenience of the description, the RQ elements are also called IRs. There is one and only one RQ element created for each IR received for the application of the RQ insertion algorithm. Each IR as an element of RQ is associated with a data element of time transmitted, such time being the best estimate by the RQ estimation algorithm of the time that the associated message (being local or not) will be transmitted. When reference is made herein to the time of transmission of a message, as such transmission time is conveyed as the value of a data element associated with said IR associated with the message, it is referred to as the IR transmission time. The transmission time is an IR field added by the RQ insertion algorithm when the IR is modified to place it in the RQ. The transmission time is measured in terms of the terminal system clock - in terms of the master system clock for the HCC, and the local system clock for each CPEs OR? Interval request message (IRM) is a control message that carries, in the uplink, a request for a CPE interval to the HCC. The IRM has fixed length. The IRM is of variable length. The MRI is illustrated in FIG. 6. 5.

An AIoha slot is a slot of a fixed size to better suit the transport of an IRM message. Since IRMs are allowed to have variable lengths, the AIoha slot can be of variable size, with the size for a particular slot chosen for a particular size IRM to enter. For clarity, additional control messages may be used, or there may be rules in the embodiment for this variant of BSDP, so that the AIoha slots may be designed to appropriately adapt the intended IRMs without said information being provided on the basis of an individual IRM. . For example, the size of the IRM can be based on the time of day, or the realization can include different types of intervals, as it was designed in the type and priority field, to transport IRMs of different sizes, the different sizes used for the types of different messages - perhaps for different service messages. The preferred embodiment is that the IRMs are of fixed size for all messages and that the AIoha slots are of fixed size.

ASBIs are assigned intervals in the uplink to transport a contiguous set of one or more AIoha slots. A variant is claimed in which different types of ASBIs transport different types of AIoha slots, either with different formats or with different purposes. An ASBl is typified to transport IRMs that have been transmitted a given number of times previously and have suffered containment in those transmissions, or variations in it. The ID of the application and / or field of the type and priority of the IR for the ASBl can be used to designate different types of ASBl.

An update message of the request list (RQUM) is a control message that is a downstream length message that originates in the HCC that contains variable numbers of requests for intervals and, possibly, additional control data in the body of the message FIG. 6 presents an example of the structure of RQUM and is incorporated in this claim as reference.

The upper time field of RQUM is contained in the message header of an RQUM message; This field contains information to precisely define the transmission time for that message, which is the first one of the master RQ (that is, whose transmission has not yet started) at the moment that the RQUM is transmitted. The time is taken in relation to the exact transmission time of the RQUM - that is, the time period of the transmission time of the RQUM and the planned transmission time of the upper element of the master RQ, thus providing the CPE with the opportunity to adjust said transmission time as calculated locally. For clarity, this variant allows the local system clock CPEs' to be locked only in clock speed of the master system, and not in absolute time. The upper time field RQUM can be transported in another control message of the embodiment.

The depth field RQ is contained in the message header of an RQUM message; containing such information field used to define the number of entities in the RQ Master at the time of transmission of the RQUM, the entities possibly being measured in (1) numbers of IRs; (2) numbers of MTUs; (3) period of time between the inferior and the superior of RQ; u (4) other measures of convenience. The other control information field of the message header of an RQUM is null, or it contains control information in particular to an individual embodiment. The other control information field contains, as a sub-field or as a complete field, a data field called an RQUM counter (FIG 6) that provides information that allows a CPE to determine that an RQUM has been bypassed , an example of an RQUM counter is a field of some fixed numbers of bits that increases circularly (that is, after reaching the largest number, the next increment is 0) for each transmitted RQUM. The other control information field contains, in a subfield or the entire field, a DTA data structure.

HCC and CPEs contain message transmission queues and received message queues (FIGS 1 and 2) or the equivalent.

The rows of received messages have messages that have been received. These queues are filled with received routers and are served in time by control and service applications. There may be one, or more than one, queue of messages received in a CPE and in an HCC.

Each message queue received is assigned to one or only one application (which can itself be a router), which facilitates the routing of messages.

The transmitted message queues have messages to be transmitted. There may be one, or more than one transmission message queue in a CPE or in an HCC, or there may be more than one. The transmission message queues are filled with control and service applications and are served in time by the transmission scheduler.

When a service message is presented as an entry for a SIM or SPCS, according to the specific service policies and SACF regulations, the message is stored in a message transmission queue. The location in the queue is by means of a location algorithm, which can be FIFO, or a priority-based algorithm that places higher-priority messages in order to be served more quickly in the message transmission queue. When a message reaches the top of the queue, it is the candidate to be the one transmitted next.

In the event that more than one transmission message queue is used in the HCC or the CPE, the specific transmission message queue selected for the location of a message by an application is determined by characteristics of the message that includes but is not limited to to applications of ID, priority and type, and message length.

Control messages that originate with a control application within a control application within HCC or CPE are located in a message transmission queue. The location in this queue is by means of a location algorithm, which can be FIFO, or a priority-based algorithm that places high-priority messages so that they can be served more quickly in the transmission message queue. When a message reaches the top of the queue, it is the candidate to be the next to be transmitted.

The request queue (RQ) is a distributed data structure. It is illustrated in FIG. 7. The RQ is formed as follows: The version for the requested queue transported in the HCC database is called the master request queue and is the correct and exact version of the request queue. Each CPE carries an estimate of the master request queue called the local request queue, which may be different from the master RQ even though the BSDP method provides the means for the CPE to keep the local RQ as a copy of the master RQ. The local RQ may be different because for a certain amount of time the CPE does not receive the HCC information necessary to maintain the local RQ identical to the master RQ. The RQ is a simple queue of interval requests, which includes a mixture of IRs for service messages and for control messages. The size of RQ is set to support variations in message speeds in the upstream.

The system 10 organizes the programming of TDMA messages in the uplink and in the downlink. The functions of the basic system associated with the organization and programming of transmission and reception of messages are: Receive a message in the CPE Receive a message in the HCC Route messages received in the terminal Transmit messages Plan transmission of messages Generation of RQUM Maintain the queue of request - the RQ insertion algorithm RQ synchronization Uplink synchronization Register Creation of IRs and IRMs Transmission of IRMs The function of expanding the interval request The resolution of IRM contention Planning of slot for ASBl and AIoha Since a CPE has achieved the downlink synchronization, a method integrated to the disclosed method is claimed, in which each CPR monitors the downlink for the purpose of selectively entering messages thereon, and for the purpose of maintaining downlink synchronization.

In variants of the downlink channel organization in which a security space exists, the CPE causes its downlink receiver to acquire and demodulate each message independently. For variants of organized downlink channels where the messages are contiguous, a CPE, once the downlink synchronization is achieved, collects each message in the downlink to the point of being able to refer to the field length of the message in the header of the message, and hereby determine how long such a message is, providing this a means to receive the contents of the message if correctly addressed, and a means to determine where the next message begins and ends. The method for determining message boundaries is fortified by a downlink synchronization method used to ensure that errors in uncorrected channels occurring in the length of the message field do not cause the CPE to lose its ability to locate messages in the message field. downlink during any significant period of time.

The HCC monitors the uplink for the purpose of entering messages, and for the purpose of maintaining acquisition and tracking in accordance with the specific accomplishment. The associated HCC receiver demodulates and deciphers upstream messages.

The receiver router is a control application, which resides in both HCC and CPE (FIGS 1 and 2).

All messages received in HCC from the associated receiving sub-system may be for HCC. The receiving router in HCC monitors the messages received from the HCC receiving sub-system and routes them according to their message headers to the appropriate message receiving queues. The receiving router in the CPE CC monitors the messages received from the receiving CPE sub-system and routes all control and service messages, which are addressed to the CPE or to groups of which the CPE is a party, to appropriate received message queues, according to their message headers, since the receiving router discards all other messages.

The receiving router selects a queue of received messages to locate a message, determined by means of the message ID application, and by which it directs said message to the appropriate application in the terminal.

The receiver router coordinates with the reception functions of the lower layer to assist said reception functions in message demodulation and tracking.

Referring to FIGS. 1 and 2, the transmission planner is a control application, which resides in both the HCC and the CPE. The means and methods of the transmission scheduler, or equivalent function, to affect the transmission of messages.

The transmission scheduler affects the transmission of messages by causing them to be taken from the transmission message queue and placed at intervals in the downlink. The transmission scheduler in the HCC determines the interval size in the downlink at the time of transmission. The transmission scheduler in a CPE is given the interval size in an associated IR for an uplink transmission. A variant is claimed in which the transmission scheduler affects the transmission of a message in a slot. Various known methods that cause groups or data messages to be transmitted based on a priority to a TDMA link can be used by the transmission scheduler.

The transmission scheduler coordinates with the transmission sub-system and programs messages to flow through the interface of this sub-system to affect the correct transmission time. In the HCC, this message information flow occurs so that the sub-system can maintain downlink message transmissions as specified in the embodiment. In the case of downlinks, this is a continuous transmission of downstream messages with an interval that follows another immediately, and each interval containing data of transmitted messages. The transmission is transmitted coherently through the limits of the interval. In the HCC, in the case where the transmission message queues are found to be empty, the transmission scheduler creates and plans null messages, formatted as appropriate for a particular embodiment. A variant is claimed in which the realization always has available control messages to the transmission scheduler in the HCC that can be planned if there are no other messages ready for transmission.

The transmission scheduler only causes a message to be transmitted if there is a message in one of the transmission message queues, but the transmission is structured such that the signals are consistent with one message for another, even when there are spaces between messages. For clarity, in the downlink of this flywheel-type transmission mode it supports exact clock synchronization in the CPEs as long as the spaces are not frequent or of long duration. In the uplink, it can support faster HCC demodulation of CPE messages.

The transmission scheduler only causes a message to be transmitted if there is a message in one of the queues, and the modulation of one message to another is not coherently related, but the MTU transmission speed and the symbol limits can be synchronized through of the messages. This mode also supports clock synchronization in the downlink, but less exactly because the synchronization process in the CPE must deal with full signal acquisition for each interval.

The transmission scheduler is a control application, which resides both in HCC and CPE (FIGS.1 and 2) to plan messages for transmission by the transmission scheduler, or functions equivalent, being illustrated in the example embodiment of FIG . 10 The transmission scheduler coordinates with other control applications to regulate the length and frequency of transmitted messages so that they are within the range of values required by the implementation.

In the CPE, the transmission scheduler only schedules a message transmission in a slot or interval if the CPE is synchronized, also called synchronized state, a CPE is synchronized when it achieves clock synchronization, downlink synchronization, RQ synchronization, synchronization uplink, and has determined the displacement of CPE. An exception to this rule is that in most variants and intended embodiments, a CPE can and could transmit at least one REGM after achieving all the synchronization stages that are in the list except for determining the CPE offset and link synchronization. upward.

In synchronized CPEs, the messages are selected by the transmission scheduler from the queue or message transmission queues, or variants thereof as follows: the transmission scheduler monitors the upper IR of the local RQ, and the associated IR transmission time, to determine whether to schedule a transmission of a message in a predefined slot or interval, or in the case that it finds that it is assigned to transmit, the transmission scheduler causes the designated message to be taken from a message transmission queue and transmitted precisely at the IR transmission time thus designated. Said determination is based on the information of all the fields of the IR, but very particularly that the address is the address of the local CPE. For clarification, the transmission scheduler may be required to make transmissions of several messages in different slots of the same interval.

The transmission scheduler makes it transmit local messages that have associated IR addresses that are not local CPEs, such criteria to transmit that it depends on some or all of the field type and priority field, other IR control information, and in lateral communications with the local SIMs. As an example, a telephone circuit can be established by a CPE and all circuit intervals have their addresses but the allocation of who speaks in said set of intervals (i.e. circuits) at any time is determined by the SPCS and SIMs associated with it. telephone service The transmission scheduler receives information from the control subsystem of the service provider (i.e., SPCS or SIM) or from other control system applications of the control system in order to have sufficient information about when to transmit a message.

The location of the slot and / or slot size is conveyed in the header as other control information and / or in the associated IR as other control information, whereby it allows the determination by the transmission scheduler of a slot that must use. A variation is claimed in which the message is designated such that the associated transmission or application scheduler randomly determines a slot for message transmission, it being understood that the content is allowed. This variant is in fact the variant used for the IRM transmission. If this variant is used for other than IRMs, it is not the function of the revealed method to solve the contentions for the slots. Local applications determine containment and re-plan accordingly according to their particular methods, this being typically service applications. To clarify, in this last variant, for service messages, SPCS applications would typically provide a means for containment resolution, working with the SIMs of a particular service. The practical value of using slots for services is that longer lengths of intervals can be maintained, while the transmission of shorter messages is sustained - a feature that affects the effectiveness of the full channel use of the revealed method. In addition, efficiency and flexibility can be obtained by having this capacity available. The transmission scheduler for each synchronized CPE and for updated RQ of HCC by removing the upper IR element from the queue, and possibly archiving it as a future reference, such removal occurring in the IR transmission time for the upper IR, and occurring even if the associated message is transmitted from the local CPE or any other CPE. To clarify, with this process, all the transmission planners that work together to effectively plan each rising flow interval.

An HCC control application called request manager collects IRs, forms RQUM, communicates the RQUM contents to the RQ insertion algorithm in the HCC, and places RQUM in a message transmission queue. (FIG.1 illustrates the function of the request manager and is incorporated herein by reference.).

The HCC receives IRs from the CPEs in ASBIs. HCC control applications also generate IRs from time to time as required in accordance with the BSDP method, and with particular requirements for particular embodiments. To clarify, the IRs can be formed by the HCC in support and working with the SPCSs, to provide uplink service messages (essentially scrutinize), intervals with slots, or intervals of other types or special priorities. In addition, SPCSs can generate IRs (essentially by planning CPE transmissions). From all possible sources, the HCC collects and maintains a pool of IRs (the main IR reserve) as illustrated in FIG. 1. All IR sources direct their IRs to the request administrator control application in the HCC.

From time to time, but in time for the purposes of realization, the request administrator forms an RQUM and places it in a message transmission queue. The request administrator takes IRs from the main .IR reservation to form an RQUM, placing them in an order in RQUM according to any standard art method, the method of which is claimed in the present when incorporated into the BSPD method. A variant is claimed in which at a time of the formation of the RQUM, each available IR is taken from the main IR reservation, said variant supporting rapid interval planning responses for requests. A variant is claimed in which certain of the IRs are selected from the reservation to form the RQUM. For clarification, this method can beneficially provide means to prioritize requests or to assist in the regulation of channel loading. As a variant claimed as a part of the BSDP method when integrated with the present, a message transmission queue in the HCC may be reserved only for RQUMs or for RQUMs and other high priority control messages. For clarification, the transmission scheduler would typically serve such a message transmission queue with high priority.

The pefición administrator plans the formation of RQUM and placement in a message transmission queue on a regular basis. The RQUMs are formed and placed at times that include at the time of receipt by the HCC an AIoha interval. A variant is claimed in which the RQUMs are formed and transmitted at times including times when one or more IRs are received from the control applications in the HCC. The RQUMs are formed and transmitted when a certain number of IRs have accumulated in the main IR reservation. The RQUMs are formed and transmitted periodically, if the IRs are present or not in the main IR reservation.

The request administrator provides the RQ insertion algorithm in the HCC, a copy or view in each and every RQUM placed in a message transmission queue, so that said action substantially coincides with the moment in which the RQUM is placed in said message transmission queue. This action is indicated in FIG. 1 by a dotted line connecting the request manager with the RQ insertion algorithm.

A control application of the RQ insertion algorithm, in the HCC and in the CPEs, receives RQUMs and places the IRs. for these RQUMs, possibly as modified by the RQ insertion algorithm, in the request queue. In the HCC, the IRs are placed in the version of the main request queue of the RQ. In the CPE, the IRs are placed in the local queue version of the RQ. To clarify, the RQ insertion algorithm carries in its task independent of the synchronization state of the terminal. If the application receives an RQUM, place the IRs for this RQUM in RQ.

In the BSDP method, the RQ insertion algorithm included in the HCC and CPEs uses an identical algorithm to place the IRs in RQ. In one embodiment, a variant is claimed in which said algorithm is static and unchanged. A variant is claimed in which the HCC can send parameters or software update to the CPE as a means to change said algorithm, such change to occur at the same point in time (with respect to the placement of IRs), in all the terminals.

In the BSDP method, the RQ insertion algorithm is such that the IRs are placed in the RQ with their conserved mutual order, even if all IRs are present or not, and each IR placed in RQ reaches the top of RQ in a reasonable time, or it is discarded.

Known methods are claimed, when integrated in the disclosed method, in which the RQ insertion algorithm is such that RQ within a reasonable time can be placed in RQ synchronization if RQ synchronization is exited. As a specific example of this set of methods, the known method of placing each new IR in the lower part (that is, the last one to be taken in the queue) of the RQ (known in the art as the FIFO method) is integrated in the method revealed as a variant.

It is possible to insert an IR into RQ in such a way that the IR transmission time planned for the associated interval, as measured at a specific CPE with a displaced transmission delay, has already passed. The message corresponding to an IR that complies with this description is not readable for transmission. However, the HCC determines that RQ is empty, arbitrarily sets the maximum time of RQUM, or equivalent, so that all CPEs, including the CPEs or CPEs they transmit, can establish the associated IR before this transmission time arrives. . The HCC RQ insertion algorithm incorporates a feature that is that it does not place IRs in the master RQ if its RQ transmission time has passed before they are received in the CPEs. The HCC generates a null IR interval, and the RQ insertion algorithm in the HCC orders a special control interval such that this interval has the highest priority when placed in RQUM and such interval is placed in RQ in order to have that the associated time period covers the period in which an actively planned transmission would begin before the associated IR arrives. For clarification, it provides padding at the beginning of RQ in which nobody transmits in the uplink. Therefore, you receive this part of the RQ transmission time without consequences.

The RQ insertion algorithm selects or removes RQ IRs in a known manner in the case that RQ grows to a certain size. To clarify, this is to control the overflow situation. It should be noted that one method to control overflow is that the RQ insertion algorithm discards any new IR when there is no more space in the RQ.

A CPE uses a control application of the RQ synchronization algorithm to determine that the local RQ of the CPE is identical (in terms of inputs and input order) to the master RQ (ie the CPE is synchronized with RQ or synchronized RQ); such comparison for the identity being made between the master RQ and the local RQ when each has completed the reception of IRs of the same RQUM or equivalent function, as illustrated in FIG. 8. To clarify, the master RQ and the local RQ do not receive IRs for the same RQUM at the same time. The IRs are received in an RQUM, or equivalent function, by the RQ insertion algorithm of the HCC and placed in the master RQ, and such RQUM is then sent to all the CPEs, or distributed with the same effect by some other methodology.

In the disclosed method, a CPE is not in RQ synchronization in a network until the RQ synchronization algorithm has placed it in the synchronized RQ condition. To clarify, a CPE that just joins the network is not synchronized in RQ. The HCC is always synchronized in RQ.

The HCC provides information on a regular basis to all CPEs so that their RQ synchronization algorithms are able to detect RQ synchronization loss in time and establish RQ synchronization. Any approach that provides such information from the HCC to the CPE is claimed herein, even if such information is provided in the RQUM messages or in other information elements of the disclosed method. To clarify, it is a feature of the revealed method that the only reason a CPE may be out of RQ synchronization is that the CPE has not received from HCC all the information that has been sent by the HCC.

Some or all of the information necessary to determine, establish and maintain RQ synchronization is carried in the RQUM messages, such data include, but not limited to, RQ depth. The RQUM confers an RQUM counter. An RQ synchronization loss detection may occur due to the difference between certain control data received from the HCC and the value of these same control data as computed by the RQ synchronization algorithm from information locally available to this application. . Such information may include part or all of what follows, but should not be limited to it: (i) depth of RQ; (ii) upper time of RQUM, and (iii) counter value of RQUM.

If the transmission of RQUM, or similar control data, is interfered with by channel noise or interference, such that the data is incorrectly received at a CPE, and therefore discarded for practical safety reasons, the CPE will be out of synchronization RQ To clarify, this condition is determined at the CPE upon receipt of the next HCC control data set, such control data typically being sent by means of an RQUM.

It is possible that the CPE can transmit while out of RQ synchronization between the moment the CPE exits RQ synchronization and the moment it receives data by means of which it detects this condition, such that a transmission by the CPE in these circumstances causing interference with another transmitted message. The administrator RQ administrator ensures the presence of a sufficient number of IRs in RQ, and the RQ insertion algorithm places IRs in RQ, so that a CPE declares itself out of RQ synchronization before any IR reaches the top of RQ. the queue with incorrect transmission time. Specific means are claimed as a part of this variant as follows: (1) after an IR has reached a certain age of IR, the IRs can not be placed before it. You could say it has ownership. When an RQUM has been received after this certain IR age has been reached by an IR, and the RQ synchronization has been confirmed, therefore, the associated message can be transmitted when the IR reaches the top of RQ with the Security to be transmitted without error. The RQ administrator guarantees that an RQUM can monitor the master RQ and ensures the transmission of an RQUM to ensure that the conformation process is effective. Therefore if such RQUM is not received the CPE is declared out of sync RQ and does not transmit; (2) After a certain number of RQUM have arrived, once an IR is in RQ, no additional IR can be placed in front, then we have the scenario of (1); (3) IRs can not be placed in front of a certain number of IRs at the top of RQ, and once an IR is in this group and an RQUM has been received, then the scenario of (1) corresponds of the present; and (4) any of said techniques in which an IR can not have IRs placed ahead in the RQ, and the synchronization of RQ is confirmed, then corresponds the scenario of (1) of the present. Messages will not be transmitted until the control information necessary to detect RQ synchronization loss has been received (usually in an RQUM) from the HCC after its associated IR position in RQ is determined so that no IR will be placed in front of future RQUMs . For clarity, messages scheduled for transmission will not be transmitted incorrectly in said vulnerable time period in this variant.

There is a maximum period of time between RQUM (or equivalent mechanisms that deliver control information to the CPE), and if an RQUM (or equivalent) does not arrive at a CPE within this time period, the CPE is declared out of synchronization RQ .

The RQ synchronization algorithm synchronizes the local RQ with the master RQ. When the RQ synchronization algorithm determines that a CPE is not in RQ synchronization, it initiates an RQ synchronization process in time, which places the CPE in RQ synchronization. All such processes are claimed, such processes share the method that they (1) determine that all the IRs present in the master RQ are present in the local RQ. When such is the case the CPE is said to be in the cleared state, or to be cleared RQ; and (2) when a CPE is cleared RQ, all IRs that are not in the master RQ are removed from the local RQ, all comparisons with respect to presence or absence of IR in the master and local RQ are performed as illustrated in FIG. 8. By completing step (2) herein, possibly also taking additional steps of confirmation, it is said that the CPE is synchronized RQ.

FIG. 9 presents a diagram state of an example of the RQ synchronization process and is incorporated herein by reference. To clarify, it is ensured that the IRs in the local RQ have always been placed in the same order as they are placed in the master RQ because it is the order property of the RQ insertion algorithm. The RQ synchronization algorithm performs the two stages of the process as defined herein, but waits to declare synchronized RQ until it confirms the RQ status with information received in one or more subsequent RQUMs or their equivalents.

The inclusion of an RQUM counter provides a means for the RQ synchronization algorithm to determine that it has received all the IRs sent by the HCC, during a certain period of time; the use of this means to determine the cleared state of RQ.

By means of one of several means, the RQ synchronization algorithm determines that a CPE is cleared RQ, and upon determining it, the RQ synchronization algorithm selects the present RQUM or a next RQUM, designated the synchronized RQUM once selected, whose information will be used by the RQ synchronization algorithm as a means for the CPE to enter the synchronization of RQ, such means being that, after the placement of the IRs of the RQUM synchronized in the RQ, the synchronization algorithm refers to the RQ depth field of the synchronization RQUM and retains in RQ those IRs to be transmitted more distant in the future (ie, at the bottom of RQ), the combined depth of such sets of IRs equals the depth value of RQ transported in the synchronized RQUIN. The remaining IRs (closest to the top of RQ) are discarded. To clarify, all IRs present in the master RQ are present in the local RQ when the CPE is cleared RQ, and they are ordered correctly. Therefore, if there are more IRs in the RQ ocal, a number of these must have been discarded in the master RQ because their IR transmission time has passed. To clarify, the CPE can not be in the cleared RQ state and have a local RQ of less depth than the master RQ. To clarify, in the example of FIG. 9, the synchronized RQUM is implicitly the RQUM whose information allowed the RQ synchronization algorithm to determine that the CPE is cleared RQ.

The initial step, common to all means to determine the cleared RQ is for the RQ synchronization algorithm to verify that the CPE has received all the IRs sent by the HCC since the beginning of the RQ synchronization process; this being equivalent to verifying that each RQUM, or transmission of equivalent information, sent during such period of time has been received successfully. In the case where the IRs were found to have been overlooked, the RQ synchronization algorithm restarts the RQ synchronization process. This procedure is illustrated in the example of FIG. 9. The RQUMs contain the RQUM counter field and this field provides a means for the RQ synchronization algorithm to determine that no RQUMs are ignored.

For clarity, in order for a CPE to be RQ cleared, all IRs that were in the master RQ, but not in the local RQ, at the beginning of the RQ synchronization process must have been considered and discarded by the transmission scheduler. HCC, that is, its associated IR transmission times must have been moved to the past.

In the case where the CPE tracks clock time of the master system, as well as the phase, the CPE records the arrival time of each RQUM or equivalent (an equivalent being to record the upper time of RQUM of an RQUM, where in this variant such RQUM top time will be provided in terms of the absolute time of the master system clock); the arrival time then being associated in a local database with the RQ entries of the IRs arriving in an RQUM, the time being called the IR birth time of these IRs. The HCC from time to time provides the IR birth time of the oldest IR in the master RQ (most conveniently done in the header of the RQUM message), thereby providing the means for the local RQ synchronization algorithm to determine when it has received all the IRs that are now in the teacher's queue and determine that the oldest IRs have been cleared or discarded from the master RQ, and therefore allow RQ to be declared clear. The IRs of an IR birth time older than some pre-established and fixed values in relation to the present time are discarded from the RQ by the RQ insertion algorithm, or equivalent. As a variant, such thresholds of time of birth of discarded IR can be varied by the HCC, and their present value be communicated in time to the CPEs by the HCC.

In certain variants of the RQ synchronization algorithm, a record is associated with each IR of RQ, said record being called the IR of age (FIG 6), the IR of age for a particular IR is initiated by the synchronization algorithm of RQ upon receipt of said IR (in the HCC and in all CPEs). The age IR for a particular IR is initiated to the zero value in the HCC at the moment that the RQUM, which contains said IR, is sent. The age IR for an IR received at a CPE is initiated at the value displaced from the CPE. The age IR associated with each IR of the RQ in a terminal is increased at the same time and in the same amount by the RQ synchronization algorithm, or equivalent function, said increment process to be performed at comparable times in the CPE and the HCC as determined by (FIG 8). If the measure used for the IR of age is time, said increase will be for the time that passed since the last increase.

(In the variant cited above, this would be the time that passed since the last RQUM.) All methods that use old IR when used as a part of the RQ synchronization algorithm, as claimed. A variant of IR of age is claimed in which the measure of age in terms of numbers of RQUMs that have been created and transmitted since the initial placement of an IR, being the CPE IR of age and the HCC IR of age initiated in said variant in the same number (1 or 0 are appropriate choices), and are incremented by "1" each time a RQUM arrives at the RQ insertion algorithm.

The HCC, from time to time, with greater convenience in the RQUM header message, provides the older IR of the older IR in the master RQ, thereby providing the means for the RQ synchronization algorithm to determine when it has received all the IRs that remain in the teacher's queue and that the oldest IRs have been cleared or discarded in the master RQ, and therefore allow the RQ synchronization algorithm to determine and declare the RQ cleared.

The age IR record can be established and maintained and the IRs older than a certain age IR called the maximum age IR are discarded from the RQ, and in addition, the RQ synchronization algorithm declares the RQ cleared when the process RQ Synchronization has collected IRs for a time equal to or greater than the maximum age IR.

The RQ insertion algorithm of a CPEe is synchronized RQ, it establishes and maintains the IR transmission time for an adequate number of IRs in the local RQ so that the transmission scheduler always has substantially the IR transmission time of the element available. superior in RQ. When the CPE is in a state in which the RQ insertion algorithm has recorded the transmission time to a suitable accuracy for the successful transmission and practice of upstream messages (ie, so that these messages are within their associated intervals) in a particular embodiment, it is said that the CPE has achieved or achieved uplink synchronization, or alternatively it is said that the CPE is in uplink, synchronized uplink synchronization.

The control application of the RQ insertion algorithm in the HCC, or an equivalent function, determines the transmission time for each interval in the uplink. To clarify, the IR transmission times are always perfectly registered in the HCC because the RQ insertion algorithm in the HCC defines them. Therefore, the HCC is always in uplink synchronization. However, the IR transmission times may be inaccurately recorded in a CPE if said CPE is not synchronized uplink.

In the BSDP method, the HCC ensures that the CPEs receive information that informs of any change in the IR transmission times of the IRs in the master RQ, such information to be received by the CPEs on time (ie before having a opportunity to transmit a message using an erroneous transmission time), thus providing each CPE with the means to maintain uplink synchronization.

The RQ insertion algorithm, upon receiving notification of the RQ synchronization algorithm that RQ synchronization has been established, establishes uplink synchronization at the first instant that a suitable set of IR transmission times can be recorded. In the case that the RQ insertion algorithm determines that the CPE has left the uplink synchronization (not necessarily the case that it has also left RQ synchronization), it immediately proceeds to establish uplink synchronization.

The upper RQUM timing of the synchronization RQUM, together with other available information to the RQ insertion algorithm in a CPE, is used as a means to establish uplink synchronization for the CPE.

The upflow intervals are contiguous, and the value of the interval length of each IR in RQ is used, at a CPE, together with the upper time of the synchronization RQUM, as a means to determine the IR transmission time for each IR in the RQ, and thus establish uplink synchronization for the CPE. To clarify, the upper time of RQUM is the transmission time of a message rather than an interval, such time possibly not coinciding with a start time for the associated interval in the case where the interval is greater than the message. In such a case a variant of the practice known in the art, claimed when integrated with the present, is that the RQ insertion algorithm in the HCC establish and maintain the transmission time for each and all messages, measured in the HCC , such that each message is transmitted in the center of the associated interval. When such transmission time is taken as the upper time of RQUM, and therefore used by the CPE RQ insertion algorithm to calculate the IR transmission time for the corresponding message, then the calculation of the transmission times causes that each of said transmission times places the associated message in the center of its associated interval, within the uncertainty of the local system clock and the CPE offset.

The IR transmission time for all IRs in an RQ are re-calculated after the arrival of an RQUM, or equivalent function information, and the placement of the IRs it transports. The re-calculation begins with the IR transmission time at the top of RQ proceeding, using the interval length value for each IR to determine the next IR transmission time, sequentially through RQ. If the insertion algorithm is FIFO, only new IR transmission times need to be calculated and entered in a synchronized CPE and in the HCC, starting with the IR transmission of the last old IR in RQ.

An embodiment that keeps IR of age and also has a maximum age IR in such variant RQ insertion algorithm, immediately after placing a set of new IRs in RQ (the set that is taken from a recently arrived RQUM), and since the terminal is in uplink synchronization, and immediately after updating the age IR for each RQ IR, it eliminates all RQ IRs whose age IR is greater than the maximum age IR; the actions to be carried out at that moment coordinated between the HCC and the CPEs (FIG 8).

A parameter of one embodiment is defined and known in the HCC and all CPE, being this parameter called RQ of maximum delay, being the variant that immediately after placing a set of new IRs in RQ any IR is discarded from the RQ whose transmission time of IR is more in the future than the RQ of maximum delay; the action to be performed at the coordinated time between the HCC and the CPEs are shown in FIG. 8, and since the terminal is in uplink synchronization.

The RQ insertion algorithm determines the transmission time of an IR using a higher time of RQUM, such time then being compared with the transmission time calculated internally using values of interval length and a higher time of previous RQUM; and if there is a substantive difference between these two times, the RQ insertion algorithm declares that the CPE is not in uplink synchronization, and therefore out of synchronization. When initially obtaining the uplink synchronization conditions, the RQ insertion algorithm confirms that the terminal has synchronization by comparing one or more of a higher time of RQUM with internally calculated values based on a higher time of previous RQUM, and only when such a process confirms the synchronization then the RQ insertion algorithm declares that the CPE has acquired or obtained uplink synchronization.

To establish with the HCC the presence of a CPE and provide the CPE with information that allows you to participate in the network, it is called the CPE registry. As a part of the record, a CPE shis determined, with the CPE offset being the propagation time in the downlink (and in the uplink, if different) between the CPE and the HCC. A displacement of CPE of own effort (bootstrap) is used to calculate the transmission time of the CPE to the HCC for the purpose of registration, being the displacement of own effort an element of the permanent database that is an estimate of displacement of CPE . Clock synchronization, downlink synchronization and RQ synchronization are achieved by the CPE by initiating the registration.

The HCC has included in its database a list of CPEs that are candidates for registration. From time to time, the HCC, by known methods, scrutinizes certain of these unregistered CPEs using control messages or control messages, in order to give them an opportunity to register. The HCC requests an interval in the uplink to be used by a CPE, or set of CPEs, to initiate the registration.

The registration by a CPE is initiated by the transmission of an uplink control message called the registration message (REGM). The interval or slot set aside for the REGM, called the registration interval (REGÍ), in said variant is to include a security space of an adequate period of time to allow a CPE to transmit a REGM in the REGÍ without having the knowledge of the displacement of CPE, but with the knowledge of a displacement of CPE of own effort. To clarify, a CPE must obtain clock synchronization, downlink synchronization and RQ synchronization before receiving and acting on an IR that assigns a REGI. To clarify, in this variant the security space is included in REGÍ that allows sufficient uncertainty time such that the CPE can transmit from the minimum (early in the interval) to the maximum (late in the interval) of the predefined interval without its messages overlap at adjacent intervals.

The realization of the system acts with alignment of the message-message symbol limit in all the uplink intervals except in the REGIs. The HCC acquires REGMs in REGIs. However, in this extension, the HCC also maintains the necessary knowledge to return to the previously established symbol limit alignment in order to acquire messages following a REGM. The HCC includes a slot or slot associated with the REGI, in whose slot or slot a separate CPE is directed to send a control message containing an acquisition sequence, thereby allowing the HCC to repurchase the uplink in time, after to acquire a REGM.

The HCC does not recognize or scrutinize CPEs that are candidates for registration, being such variant that the HCC requests REGIs from time to time without designating the users, and the REGMs are sent in these intervals by the CPEs who therefore try to initiate the registry. Containment, and management by CPEs is allowed in accordance with known containment management techniques. The HCC determines the displacement of CPE by means of the arrival time of its REGM within the REGI, such CPE displacement being provided to the CPE in a next control message.

The HCC helps each CPE maintain an accurate CPE shift, by providing time to time information to each CPE that is used as a basis to correct or update the CPE offset; the information provided by means of a control message or field of a control message; the information being gathered based on the early or late arrival of messages of said CPE.

The CPE offset, or equivalent, is provided to a CPE before registration as a known part of the data in the CPE database. In the preferred embodiment, the displacement of the CPE of the HCC is zero.

For the creation of IRs in the CPE, and IRMs as shown in FIG. 10, the CPE contains, at any moment, a set of messages to be transmitted. Messages are saved in one or more message transmission queues. The CPE transmission scheduler, or equivalent function in the CPE, refers the messages as each message arrives in a message transmission queue, and forms an associated IR for each one, which is placed in a database. database called the local IR reservation.

As shown in FIG. 10, the IRs are distributed from a local IR to the distributed RQs. The transmission scheduler, or equivalent function, in a synchronized CPE selects a IR (FIG 6) to be transmitted in time from the local IR reservation. The selection method is according to any suitable algorithm. The transmission scheduler algorithm can be used to select an IR to transmit, and determines the order of IR selection to transmit based on IR characteristics, possibly including the time the IR was created or in which associated message it arrived. The transmission scheduler, or equivalent function, creates an IRM (FIG 6) to transport the selected IR, and places this IRM in a message transmission queue.

The transmission scheduler, or equivalent, in a synchronized CPE, handles the transmission of IRMs. An IR that is actively in the process of being sent to the distributed control system, but not yet in RQ is said to be in an IR distribution process, or alternatively in IR distribution; such a process consisting of one or more attempts to transmit the IRM to the HCC from its originating CPE, using AIoha slots, and the sending of the associated IR in one RQUM to all HCC CPEs. The transmission scheduler of a synchronized CPE takes an IRM from the top of a message transmission queue as soon as possible after it appears and therefore places the associated IR in IR distribution. To clarify, the transmission scheduler can distribute IRs one at a time - ensuring that the distribution of one IR is completed before beginning the distribution of another IR, or it may be able to sustain several IRs in IR distribution at the same time, depending of the specific embodiment of the disclosed method. The transmission scheduler may delay the placement of an IR in distribution in consideration of traffic management requirements.

At the beginning of the IR distribution process for an IR, the transmission scheduler schedules and causes the associated IRM to be transmitted, the schedule and the transmission will be in an AIo slot selected by means of the IRSF. The transmission scheduler then maintains the IRM in a database called the enclosure that maintains IRM for possible retransmission. If re-transmission is required as determined by the transmission scheduler. The IRM is planned and retransmitted in an AIoha slot selected by means of the 1RSF, and the IRM is repositioned in the enclosure that maintains the IRMs for a possible additional re-transmission as above. If re-transmission is not required, the transmission scheduler removes the IRM or places it in some file database that is not essential to the disclosed method. To clarify, the enclosure that maintains the MRI may contain more than one MRI in some embodiments of the disclosed method.

The transmission scheduler modifies, in RQ, the IR start time associated with the selected ASBl for transmission of an IRM, such modification to reflect the position of the particular IRM slot in the ASBl. After a number of attempts to re-transmit IRM, said numbers called the re-transmission limit (RLIM), the transmission planner removes the IRM from the enclosure that maintains the IRM, thereby removing its associated IR from the distribution of IR, such action possibly including notifying the application of interest in the local CPE of a failure to plan the IR. The RLIM is established by any of the following means: (1) being a fixed parameter in the CPE control system; (2) being a function of the traffic pattern in the network; (3) being a function of the values transported in the IR, (4) being assigned from time to time by the HCC, or (5) other means, or any combination of these. The transmission scheduler can prioritize re-transmitted IRMs over IRMs for fresh or new messages. Different types of ASBIs are used for the re-transmission of IRMs.

Multiple IRs are in the distribution and their associated IRMs are in the same enclosure that maintains the IRMs during the same period of time, said IRMs possibly being associated with the higher messages of several queues or with multiple messages in a queue or their combination, and Besides; a means is provided for said extension to distinguish between possible ambiguities, through the contents of the IR, the associated message for that IR. A counter, called the IR counter, is included in the other IR control information field (FIG 6), said IR counter to contain an increased value (modularly, in a circular method, as determined by the size of the IR). field) from the IR counter values of the IR previously formed at the same CPE. To clarify, the purpose is to provide a means for a CPE that has multiple IRs in the distribution in the system at one time, and to easily and safely avoid confusion as to which associated message is linked to a specific RQ. The system allows m-high priority messages to preempt low priority messages during the IR distribution process.

The HCC can create an IR to be used to request an ascending flow interval, such request can be placed in a downstream RQUM along with IRs of CPEs, said interval to be used by a CPE or designated CPEs (in the case that have slots) to transmit a certain message or type of message, since these are designated by means of the address, application of ID and type or priority fields of the IR. Such an arrangement requires predisposed, cooperative, or associated means and methods on the part of SPCS and / or BSDP control applications to be of practical value. For clarification, this method provides the means to scrutinize by the HCC of designated CPEs. The HCC can form an IR based on the control action (ie, "request") of an SPCS. A medium within the revealed medium scrutinizes the related SIME CPEs for services. The HCC can form an IRM to request an interval that will sustain competitive transmission attempts.

Since the CPE can form an IRM to request an interval to be used by another CPE to transmit a certain message or message type, as designated by the application of ID and type or priority fields of the IR (FIG. they require means of predispositions, cooperatives, or associates and methods on the part of some control applications of SPCS and / or BSDP to have practical value. A CPE can form an MRI to request a range that is intended to support competitive transmission attempts.

A CPE or HCC may form an MRI to request a slotted slot, such a set of slots to be used by a set of CEPs, which may include a requesting CPER or not, to transmit messages, the provision of which requiring cooperative means or associates or methods in the part of an SPCS and / or BSDP control application to be a probability with practical value. A CPE can form an IRM to request an interval with slots that attempts to support competitive transmission attempts. To clarify, it is noted that the structure of this extension and / or variants may be useful in achieving an average interval length in a small message environment.

The transmission scheduler of a CPE plans (also called to select) an AIoha slot for transmission of an IRM. Each CPE performs the selection of the AIoha slot in which to transmit an IRM without knowledge of whether one or more CPEs have selected the same AIoha slot to transmit. Therefore, the IRM transmissions of different CPE units may collide (also called competing) and be lost by the receiver to which they are directed - the HCC.

The selection of an AIoha slot is by means of an extended interval request function (1RSF). The IRSF, which operates in cooperation with the SACF, maintains within a range of values, the probability of collision of IR transmissions in any AIo slot given, such a range of probabilities set by the designers of the embodiment to meet operational requirements. specified BSDP methods in the embodiment; the method used to maintain such probability being by known methods, which are integrated with the system 10.

The IRSF makes its slot selection with different and random results from one attempt to the next in the same circumstances, if such selection is made by IRSF realizations in different CPEs, or the selection is made by the same IRSF performance in a single CPE acting at different times, namely the random selection process of the IRSF for an AIoha slot has a fundamental element of its method for planning an AIoha slot, sampling a probability of distribution, with a known art algorithm, such sampling reaching independent results and without correlation (to a practically significant degree) between any two samples.

The AIoha slot selected for an IRM transmission is chosen randomly (with uniform distribution) within the nearest available ASBl. The AIoha slot is selected from a contiguous set away from the AIoha slots that span some numbers of the ASBIs (such a set possibly comprising part of an ABI or a part of various ASBIs) in a random manner according to a given distribution probability. The contiguous set of AIoha slots starts with the next available slot. The amplitude of the AIh slot that are candidates for a re-transmission IRM is a function of the number of previous re-transmissions of that IRM. To clarify, this extension includes the exponential back-off algorithm used for Ethernet.

Each transmission of an IRM, as executed by the transmission scheduler, includes the first transmission of an IRM. To clarify, it is noted that it is possible for one or more CPEs to transmit an MRI in an AIoha slot, resulting in a signal collision, also called containment. Containment is explicitly allowed in the system's algorithm and is resolved by the means of re-transmission of the system.

A transmission scheduler determines that an MRI that has caused it to be transmitted has suffered containment or other deterioration effect that has prevented it from being successfully received by the HCC; such determination by means of the downlink RQUMs, or equivalent function data, and determining that the associated IR has not been included in a RQUM in a given and limited period of time, hereinafter referred to as the delay of re-transmission of IRM The delay value of IRM re-transmission is a fixed parameter for an embodiment of the disclosed method, such value is determined by an embodiment designed to allow header processing and propagation delays. If an IR transmitted by the CPE does not appear in an RQUM within the IRM re-transmission delay period, then the CPE designates the associated IRM transmission as a failed IRM transmission.

In the case of a failed IRM transmission of a CPE, the transmission scheduler performs either re-transmitting the IRM or removing it from the enclosure that maintains the IRM.

The HCC that processes errors or delays, or RQUM errors, may cause more than one copy of an IR to be offered for placement in RQ. The circumstance may be caused because a CPE was successful in transmitting a given IRM more than once, such circumstance arises because said CPE was not successful in searching for the associated IR in the downlink within the delay period of -transmission of MRI; said multiple versions that arrive at the HCC are denominated in the present duplicate IRs. The duplicate IRs are sent in RQUMs and entered in the RQ. To clarify, the duplicate IRs in RQ do not cause misleading or misdirected messages. These can cause, in the worst case, a lost interval.

The detection of duplicate IRs is by means of the IR counter of claim 28 (f); This detection provides the means for the administrator of RQ administrator to remove duplicate IRs from the distribution. The detection of duplicate IRs is by means of the IR counter. The RQ insertion algorithm does not introduce duplicate IRs to RQ.

The unique use of the control application of the Aioha slot delivery algorithm (ASSA) may be located in the HCC and may generate interval request for ASBIs. The requests are distinguished by a single type and field of priority or equivalent. The ASSA generates ASBIs of a fixed size (i.e. fixed number of AIoha slots of fixed size) and at a fixed interval speed, such size and speed as determined to ensure that the network associated with the disclosed method operates at the point of operation for the realization.

The number of slots in an ASBl is also selected taking into consideration the amplitude of the slot required in an ASBl for the successful operation of the IRSF algorithm. He ASSA creates different types of ASBIs for different types of requests, examples are repeated requests, requests for different types of messages, and requests of different priority.

The ASSA sets different lengths of AIoha slots for different types of requests. ASSA varies the request rate for ASBIs, and varies the number of slots in ASBIs.

ASSA creates and adapts ASBIs in real time using appropriate methods in order to react to changing traffic patterns and service needs when adjusting the point of operation.

Mathematical model of AIoha in slots In the mathematical model of AIoha in slots N Sources send messages in a probability base. All transmit on the same channel. The channel is organized in "slots", that is to say periods of time of fixed size, and a message is exactly the same size as the slot. The messages are transmitted in a synchronized manner to enter exactly one slot. The decision made in a source to transmit a message is independent of the decision made in another source. Therefore, different sources can choose to transmit in the same slot, thus competing for the slot and destroying the signals of each. In the mathematical model each source chooses to transmit in each and all the slots with probability p.

This approach corresponds to the sequence of AIoha slots that flows in the uplink in ASBIs. In the present AIoha slots are sized to carry request messages called IRMs. In the use of this method in the present, once a terminal transmits a message, it waits to know if the message has been received. If the message has not been received, the terminal assumes that the message was lost in contention, and re-transmits the message. This changes the probability that it will transmit it in a slot. An IRSF algorithm can be used in the patent to randomize the choice of an AIoha slot for the CPE both on its first attempt and on subsequent attempts, thereby bringing the message transmission pattern of the terminal back to the theoretical model .

In this system and method, the sources are CPEs that transmit IRMs in the uplink. The revealed method anticipates that N is typically a large number. In the preferred embodiment, N will be thousands of CPEs. The method can be used for any N, but for the performance analysis to correspond, N should be 10 or greater.

The performance of the AIoha model in slots is evaluated as follows: Each source has the same probability, p, of trying to send a message in a particular slot. The probability that a single source sends a message successfully in a slot is p (1-p) N-1, and the probability that any of the N sources sends a successful message is: E (p, N) = pN (1 - p) N-1 (Equation 1) 5 E (p, N) is called the efficiency of the slot method. It is easily demonstrated that the value of p, p *, which gives the highest probability of success is: p * = 1 / N E (p *, N) = (1-1 / N) N-1 FIG. 11 shows the efficiency value with Np as the independent variant, and N as a parameter. For a large number of sources, type BSPD, we see that: E (p *) = lim E (p *. N) = lim (1-1 / N) N-1 = 1 / e (Equation 2) N- > 8 N- > °° This value is reached very quickly with N increasing as seen in FIG. eleven.

This important result shows that the efficiency does not tend to zero, as the number of users becomes greater. Rather it stabilizes at an operating speed determined by Np, but may be a little better than 1/3.

The number of attempts expected from a single source is calculated. Note that the probability that a message transmission is successful, given that it is transmitted, such as Ps, Ps = (1-p) N'1 (Equation 3) With maximum efficiency and large N, Ps * = lim (1-p) *) N-1 = E (p *) = 1 / e Allowing í to be the number of attempts it takes to achieve success (including the successful attempt) E ()) = Ps + 2 Ps (1- Ps) + 3 Ps (1- Ps) 2 + • • • = 1 / Ps 5 Efl) = 1 / (1 -p) N-1 (Equation 4) For Ps = Ps *, we have the result, Efl *) = e The variance of the number of attempts is calculated sv2 = (1 - Efl)) 2Ps + (2 - Efl)) 2 Ps (1- Ps) + (3 - Efl)) 2 Ps (1 - Ps) 2 sv2 = Ps + 4 Ps ( 1- Ps) + 9 Ps (1- Ps) 2 + • • • - 2E (í) Ps- 4 Efl) Ps (1- Ps) - 6 Efl) Ps (1- Ps) 2 - • • • + E (í) 2 Ps + E (í) 2 Ps (1- Ps) + Efl) 2 Ps (1- Ps) 2 Note that Efl) = 1 / Ps, sv2 = Ps / (1 - Ps) * [(1 - Ps) + 4 (1 - Ps) 2+ 9 (1 - Ps) 3 + • • •] - 2 * [1 + 2 (1- Ps) + 3 (1- Ps) 2 - • • •] +1 / Ps * [1 + (1- Ps) + (1- Ps) 2 + '««] sv2 = Ps / (1- Ps) * (1- Ps) (1 + 1 Ps) / Ps3 -2 * 1 / Ps2 + 1 / Ps * 1 / Ps sv2 = (2 - P s) / P s2-2 / Ps2 + 1 / Ps2 sv2 = (1- Ps) / Ps2 For the case of optimal efficiency, sv2 = e (e-1) Given the deviation or í * = Ve (e-1) Applicability of AIoha technique in slots In the revealed method, the average time between AIoha slots in a long period is denoted by?. Therefore, the slot speed of 1 / ?. Note that these slots come in bursts in ASBIs. So, we averaged over many ASBIs when contemplating the average speed.

The parameter? indicates the average time between the start of intervals in the uplink. The uplink is presumed complete in the analysis. This is the worst case.

The rate of intervals in the uplink is 1 /?. Upflows carry the following types of intervals: (1) intervals requested by CPEs; e (2) intervals requested by the HCC, including ASBIs. There is an MRI that successfully reaches the HCC from the CPE for each requested interval of type (1). There is no MRI associated with intervals of type (2). The intervals of type (2) are rare in the uplink. Therefore, in the present we approximate for the analysis: The speed of ascending flow intervals requested by CPEs = 1 /? (Equation 1) The BSDP method quickly reaches a constant state condition (ie the average depth of RQ is constant - see attachment 3). In this constant state condition the average time between successful IRM transmissions in AIoha slots is equal to the average time between uplink message transmissions,?, With the approximation of the Equation 1.

[The heading associated with class intervals (2) can be simply inferred from the available capacity information in the channel to make this approximation accurate. However, the load due to the HCC request control messages is specific to the embodiment. So, the focus of the approach is taken in this analysis.] 1 /? it is then the speed at which the IRMs successfully transmitted in the channel. This will be referred to below as message speed, and we will refer to "messages" for convenience.

As indicated above, we have the efficiency of IRM transmission: In a period of time T, large with respect to the transmission speed of MRI, there will be T /?, IRMs transmitted successfully. In the same amplitude of time, there are T /? periods.

V? = E (p, N) T /? (Equation 2) Where p is the probability that any terminal (CPE) will transmit in a period and N is the number of terminals. E is the portion of periods that are successfully used to transmit requests. To reformulate: E (p, N) =? /? (Equation 3 - AIoha Efficiency) This equation is immutable. Note the attachment 1,? /? = N The efficiency curve is introduced in attachment 1 and is shown in FIG. 12, for large N. This curve provides the performance of the system request method. As can be seen from the curve, more than half of the periods do not carry successful transmissions. These surplus periods are either empty or carry comparative transmissions. It should be noted that when p = 0, all slots are empty, and when p = 1, all slots are complete with comparative transmissions. The efficiency and speed of message in 0 in any case. (The function E (p, N) has finite amplitude.) For maximum efficiency, - do we have pN = 1, or? =? E. (1) =? le = 0.36 *? In this operative point there are 2,718 times more periods of request as messages.

The Np Parameter in Terms of BSDP Parameters It can be shown that Np can be considered a unique parameter and how this parameter relates to the message and slot speed of the revealed method.

In equations 1 and 4 of the mathematical model, the efficiency and expected number of requests is given in terms of p: E (p, N) = Np (1-p) N-1 Efl) = 1 / (1-p) N "1 For large N, the geometric term is approximated by an exponential It is observed that Np is a parameter in the key expressions, E (p, N) = Np e" N p, large N (Equation 4) E (v ) = e N p, large N (Equation 4) Expressions refer collectively to Equation 4.

The notation for E (p, N) is simplified to E (Np), for large N (greater than 10). This is the corresponding expression for the revealed method. FIG. 13 presents the expected IRM transmissions / messages in terms of Np.

Np is the probability that a terminal will transmit in a given period. With the method BSDP of repeated attempts, we have: Np = E (v)? /? (Equation 5) This is a statement of first principles, but it can also be confirmed by combining Attachment 1, Equations 1 and 4, and Equation 3 of the above. From the first principle: E (v) /? is the rate of transmission of MRI (when measured over a long period of time). The transmission ratio at slot speed provides the probability that a slot will receive a transmission (assuming a total random selection of slots). Ergo, Equation 5.

No lost message A preferred embodiment of the system 10 repeats IRM transmissions until it is successful (FIG 10). The analysis here assumes the re-transmission of the petition until it is successful. Other variants leave MRI transmissions after a number of attempts. These other variants only lighten the load (ie decrease p) in the request sub-system of the revealed method, making the analysis made in the present conservative. Here we turn to the question: Will an MRI always arrive if the repetition is continued forever? ("Always" means with probability equal to 1.) The maximum expected delay for the AIoha method in periods is e N. Of course, N has been considered to be "very large" in the previous discussion, and therefore, the delay is effectively infinite when p = 1. (All terminals transmit in all AIoha slots.) In a more benign case with p < 1, it is shown here that the message speed, 1 /?, Is equal to the speed that the system offers to the messages, which will be indicated as 1 /?, That is, the messages are not lost because they do not Requests are received. (There is a mathematical tendency in this statement.) Previously the messages would be lost with probability 0 - which means that very occasionally the messages do not arrive.) The probability of the successful transmission of a request in a transmission is Ps, where Ps = (1-p) N "1. The check is immediate: The probability of success in repeated transmissions is: Ps + Ps (1 - Ps) + Ps (1 - Ps f + • • • = 1, p < 1. Therefore, 1 /? O = 1 /? Operational Point For any IRSF method used to plan repeated MRI transmissions, the delay in transmitting an MRI successfully is a direct function of the number of repetitions; said number being indicated in FIG. 13 The operational point of an embodiment of the BSDP method is the value of Np selected for its operation. Np refers to the efficiency E (Np) of Equation 4, and E (Np) refers to the tangible controllable factors (ie, operational parameters) 1 /? and 1 /? of Equations 3 and 4. Np e "Np =? /?, (Equation 6) Thus, to control the speed of the message and the speed of the slot, we determine the operating point of a MAC embodiment using the disclosed method. This is the key to the successful and efficient operation of the system request method. With the purpose of clarity, 1 /? and 1 /? they can not be selected arbitrarily. Obviously, the choice of available channel capacity influences, but the speed can be maintained with any capacity of the channel. The effective functioning of the RQ structure requires a careful selection of the message speed and message length (this is the length of the interval in the revealed method), which also limits and influences the relationship. From the point of view of the request part of the disclosed method the factor that is controllable in one embodiment is the transmission speed of the AIoha slots (1 /?). This can be done by a function of time or traffic patterns in the network.

It should be noted that the behavior of the request methodology depends only on the average or statistical behavior of the key parameters. The speed of the message and the speed of the slot can and will be above and below the average value for these parameters over any period measured. However, as the measurement period obtained is arbitrarily large, these values must approach the values of the operative point so that the revealed method is practically applied. The degree of variation tolerated by a particular embodiment explicitly depends on the size limit in the IR concentrations in the HCC and the CPEs and on the limit size of RQ specified for that embodiment.

The speed regulation of the message in the uplink is achieved mainly by the SACF in the SIMs. In the disclosed method the transmission schedulers provide a barrier within the revealed method to ensure that the SIMs meet the operating point parameter of the average message speed. In the preferred embodiment, the operating parameter of the message speed is constant, above the average, ie the system does not adapt the operating point to vary the parameter of the message speed in the regulation mechanisms designated here.

The regulation of the speed of the slot is an internal function of the system. The ASSA controls the speed of the slot of the revealed method. In the preferred embodiment, the ASSA provides a constant slot speed to the network.

Equation 4 indicates that the efficiency decreases and the delay increases when Np is greater than 1 (Figs 12 and 13). Thus, the region of choice for the operational point, in a practical system is between 0 and 1 - the Operating Region. (There is always a better point to the left of 1 for any point considered to the right of 1.) The most favorable exact operating point depends on the relative importance of delay and efficiency of the use of the slot. Fig. 14 presents the information of Figs. 12 and 13 in a single graph that highlights the appropriate range of operation for the revealed method. The efficiency is presented inverse to normal in this figure; This is in terms of the number of slots required for a single successful IRM transmission.

In the revealed method, the Operational Point and other parameters are chosen for a full-capacity operating system. It can not do better. However, the effects of a fall in the load should be examined to ensure the stability of the method. When operating in the Operating Region, the effect of a decrease in message speed 1 / ?, with a constant slot velocity 1 / ?, is to move Np to the left as can be seen in Equation 6 (also Equation 3 of Fig. 12) (p moves because N is fixed). In this case more slots are empty so that the slot uses decreased efficiency, but the IRMs get faster -delay in the delay. The operation of the method improves for those messages that are served. Actually, the ASSA can be designated to increase the speed of the slot, by requesting a larger ASBIs, when the space becomes available under these circumstances, with that it moves p further to the left and still a time of faster response The system request method affects the quality of service (QOS) in two ways: • Message drop • Message transmission delay The disclosed method can be incorporated in a manner such as for dropped IRMs after a certain number of attempted transmissions, thereby causing the associated message to be canceled. In order to clarify such "fall" may be known by the application of the appropriate service, which can re-submit the message for transmission. However, dropped messages are not inherent in the method. As can be seen in the discussion in section 2-3, the preferred embodiment ensures that each message that is obtained on the network is transmitted with probability 1. Only events with extremely small probability such as RQ overflow can cause a request to be lost, once the IR distribution process has begun.

In order to maintain a given QOS, the SACF must regulate the display of messages for the revealed method, and the means that the SACF in an SCPC or SIM takes to do so may include dropped messages. Thus, although there is no message drop inherent in the revealed method, there may be an indirect effect of dropped messages.

The delay and variable delay of the messages transmitted by the network are inherent effects of the BSDP method. This can affect the quality of the service in two ways: 1) The delay through a network is foreseen to have several tens of milliseconds in the typical embodiments of the disclosed method. In most applications, this delay has no impact on the quality of service, the exception may be with interactions in real-time games. The lap time for real-time interactive services, such as telephone conversations, is double the unidirectional delay, which can typically be a few tens of milliseconds. 2) In a stream of referred data messages, variations in the timing of network transit can create inequalities (jerkiness) in the presentation of the service if they are not properly buffered. However, they buffer (buffers) to smooth data streams that add delay. Examples of the impact of instability (jitter) without proper buffing are images frozen in video, or clicks of audio sound.

The delay and instability of the message can have three causes: the physical delay due to propagation and processing; the IR distribution delay; and the planning delay RQ.

The physical delay in the preferred embodiments of the system is a fraction of a millisecond. The delay and total instability are dominated by the r two factors. The methodology for requesting the revealed method refers to the IR distribution delay. This is considered below.

The probability of a successful petition transmission is given widely in N given in connection to 1, equation 3, Ps = e -Np The probability of success in N attempts is, SN = Ps + Pß (1-P.) + Ps (1-Ps) 2 + ... + Ps (1-PS) N "1 SN = 1 - (1-Ps) N Figures 15A and 15B present traces of this equation, giving the probability of successful request transmission as a function of the number of N attempts. The same data is provided in two resolutions in Fig. 15A and Fig. 15B. The delay time associated with the disclosed method depends firstly on the anticipated number of attempts as presented in the figures, and secondly on the time between attempts - ie on how the slots are selected for repeated request transmissions by the IRSF function. Fig. 16 provides important operational points of interest with respect to telephony and r delay-sensitive services.

Example of the embodiment of the system In an example of an embodiment of the system, a re-request is attempted each time an ASBl is offered. A significant fixed number of AIoha slots per ASBl is provided to ensure that there are enough slots per interval so that the "randomization" by the IRSF of the re-request slot is effective. The example network serves an average of approximately 2000 messages per second (messages requested in the uplink). The function of the network of the example is to support a telephone service VolP with 64 kbps. In consideration of the trade-offs evident in Fig. 16, the service is designated for 99% of the packet performance for a dropped packet after 4 failed IR transmission attempts. These two considerations lead to a selection of the operating point of Np ~ 0.4. In Fig. 14, it is seen that there is, on average, about 1.5 IRM transmissions per successful transmission at the operating point.

In Equation 6, the slot speed is 3.7296 times the message speed, giving 7459 AIoha slots per second. In the network of the example, the maximum time specified for the request portion of a message delay cycle is 40 milliseconds. Providing an ASBl every 10 milliseconds exceeds this requirement. Thus, there are approximately 75 slots per interval. (There are approximately 20 new requests and 10 requests repeated by ASBl, and approximately 20 of these 30 transmissions are successfully transmitted).

The capacity required for the ASBIs is below 5% of the total uplink capacity available for messages. A slot could be 1% of the average message size (a very important parameter), and the header is then approximately 3.6% for the request structure.

Consider the QOS of a VolP circuit with a packet speed of 10 packets per second. In the example network, a packet would be lost once every ten seconds on average. This packet loss rate represents approximately 1/10 of a word. The speech circuits (speech) easily cover such losses.

The average delay during the request cycle in this example is 15 milliseconds. When added to a typical RQ delay of 20 milliseconds (see attachment 3), this gives a predicted total unidirectional delay of approximately 35 milliseconds, and a turnaround time in average of 70 milliseconds. This is a very satisfying turnaround time for a voice system. The greater delay speed caused by the grouping of initial requests in an interval is handled by the cut-off of repetitions. Such grouping will have the effect of a lost packet, once in several conversations. The impact of grouping does not lead to more than 3 repetitions - 30 milliseconds.

Queue State Model Fig. 17 gives a model of the state diagram of RQ. The state of the queue is defined as the number of tokens in the queue. In the BSDP method, the request queue "signals" are IRs.

If the queue does not grow outside the limit while the time continues, it must reach a constant state where the number of signals goes up and down around an average value or fixed value, depending on the arrival and departure pattern of requests. The system 10 is designed so that RQ is stable, ie it does not grow in size outside the limit.

The behavior pattern of a stable tail can obviously be quite complex. A requirement or assumption is imposed on RQ - which has the ergodic property during the peak traffic period. This means that the arrival of requests, when it exceeds the average of the CPEs is absolutely random. (More formally, ergodicity is defined as follows: If an experiment is conducted: The first part of this experiment is to run a very large number of networks in parallel with the same embodiment and under the same traffic load statistics, and stop them all at the same time, resulting in the RQ states that are distributed in a certain way - so many networks will have queues of depth 0, thus many with queues of depth 1, etc. The second part of the experiment is to execute a single system for a long time under the same traffic load statistics, then the relative amount of time consumed in each state for the second part of the experiment is compared with the distribution of states of the first part, if the proportions are "equal", the behavior of the networks, or that of the underlying process affects traffic patterns, is said to be ergodic).

The stable queue with the random entries has a certain probability of being in each of the states: P ^ P2, P, •••, Pn. Pn + ?. "* • It is important to note when considering the practical importance of this set of probabilities that does not depend on the characteristics of the arrival and departure processes.With the ergodic assumption, any system will, in the average is with the occupied states a fraction of the fime represented by the same distribution: Pi, P2, P3, • ", Pn. Pn + 1 > • "- The period of time required for this average or random behavior occurs depending on the characteristics of the entry and exit. The behavior of the "very" random arrival with the "very" random item gives very fast convergence to this distribution of occupation.

If the arrivals are from different sources, and these sources allow moderate random behaviors, and the tail tends to be "absolutely" complete (more than 10 in the average), the law of the large number comes in effect: The behavior of the tail arrives to be absolutely independent of the details of the statistical behavior of each source, and it depends above all on the average arrival speeds, and on the deviation of arrivals of this average speed.

Since we can never know the statistics associated with any service in the system 10, it is necessary to execute it with RQ, on average; Quite a few IRs queue up. How large are "quite a few" depends on how well the load statistics of the uplink traffic behave, in a probabilistic sense. The practical situation is that with the large number of CPEs mentioned above for the applications of the revealed method, traffic characteristics behave very well.

There is a good improved effect in the case where the traffic is "less random": If the CPEs are very regular in producing requests, the effect is to shorten the queue, and speed up the average message performance time. This is the pattern that occurs with running traffic such as voice and video.

Depth of RQ This trend is a basic tail theory. This depends on an observation that immediately leads to "the equilibrium equation". Solving the equation of equilibrium under certain assumptions of input and output gives the distribution P ^ P2, P3, •••, Pn, Pn + ?, • * •• This result is used to calculate the average deviation of the depth of the tail.

The observation depends on ergodicity. We observe the behavior of time. In a sufficiently long period of time, T (in seconds), the tail will exist in the state i a fraction of the time equal to Pi.

As little as possible assumptions are made about the statistics of arrivals and departures:? is the average amount of time (in seconds) between arrivals μ is the average amount of time (in seconds) that an arrival serves In terms of BSPD, does that mean? is the average amount of time between the IRs arriving at RQ, and μ is the average length of a rising current interval. We observe that: 1 /? is the average number of requests in a second. 1 / μ is the average number of services in a second.

For the queue to be stable, the average time between requests must be at least as large as the average time of service for a request,? > μ. Expressed differently: 1 / μ - 1 /? < 1.

In period T, state i occupies TP (seconds) On average, the number of arrivals to the queue while i occupies, so the state rises to i + 1, and yields TP / /. , the number of outputs (or services, or transmissions) while it is occupied, so the state goes down to i-1, and throws TP / μ.

The observation that leads to the equation of equilibrium is that for the tail to be stable, over a long period of time, the number of ascending transitions, must equal the number of descending transitions between two adjacent states: T Pn? = T P "+? / Μ (Equation 1 - equilibrium equation) Defining μ /? = p < 1, it is easy to see Pn = P0pn and P0 = (1 - p). The probability of the occupation of states descends geometrically.

The predicted depth of the tail is E (n): E (n) = 0 x P0 + 1 x Pi + 2 x P2 + ••• + n x Pn + ••• = p / (1-p).

The region of E (n) is where the depth of tail is most of the time. The dead surface time or vacuum involved by p < 1, is reached or paused by time.

There is a characteristic of practical communication systems based on the processing queue (MPEG2 is the example) that the speed of the system message is superficially below the capacity of the system's communications. This surface sacrifice of capacity provides resilience for the flexibility and predictability of behavior for the system.

To take advantage of this property of matching the distributed request queue, the revealed method allows: the preparation in the CPE for the transmission of the message without the loss of channel capacity due to the configuration delay, the ability to confirm the synchronization Planned before the transmission of a message, the capacity of the lost channel for the information associated with the scheduled messages, the predictable delay, and the priority planning.

Efficiency of the system In reality that IR arrives randomly and is processed through a queue, means that sometimes the queue will be empty (ie state 0), and the link will remain idle. How often does this happen? In the equilibrium equation P0 = (1 - p) is the answer. Observing the percentage of time the system remains empty as the header O, this result can be derived more intuitively: Let e be the average time unused by the arrival in the link: t (μ + e) = t ?. The fraction of time in which the queue is emptied, and there is no transmission is. O = e /? = (? - μ) /? = 1 - p Ratio of tail depth to efficiency In system 10, RQ is preferably "fairly deep" in the average so that the exact probabilistic characteristics of incoming traffic are not too sensitive, in which traffic may be somewhat fragile, " quite deep "means that the depth of the tail can be greater than about 10.

Noting that p = E (n) / [1 + E (n)]: 0 = 1 - E (n) / [1 + E (n)] = 1 / [1 + E (n)] As the depth of the tail gets small, the header goes to 1 (the channel is empty most of the time). Note that the depth of the tail is small when p is small. Actually, the expected depth limits of the tail is p for p «1.

It is more interesting, and applicable to system 10, when the depth of the tail is large, O - > 1 / E (n), E (n) is large (Equation 2) For E (n) > 10, this equation is correct for less than 1% Thus, practically the speaker in an embodiment that is 99% efficient has a tail depth of 100.

Deviation RQ How good is the depth RQ in the approximation E (n)? This is measured by the expected depth deviation of the tail around E (n). This means if at any moment the tail is sampled, how close is the depth of the sample is probably for E (n).

It is assumed that E (n) is "large". Because of this, "big" can mean greater than 10.

The arrival time of requests can allow a very complex probability model. However, it is assumed that it is working quite well (or "real world") to have a deviation s, as well as the mean m. (s is the square root of the variance s2).

As the statistical behavior of more arrivals immediately - for example what is the behavior of 15 arrivals at a time - is considered, the underlying behavior of probability becomes more and more flared, or Gaussian. Actually, the mean and the variance completely define the behavior of a random Gaussian variable. Thus, a very tight grip on things can be achieved as soon as the behavior of groups of arrivals is considered (as is the case with the RQUM delivery of IRs).

For n arrivals, the trend is for: mn = n m sn = Vn s Since the Gaussian behavior is known, we can predict that the behavior of the tail can be predicted when it typically has a large number of tail IRs. This is, in fact, the effect that smoothes it from buffering.

At this point, one must reach a more accurate model of the underlying process to model a deviation. A reasonable model of RQ is M / M / 1. This is Poisson arrivals, the exponential service time (which is equivalent to the length of the message), and a single server. With a Poisson process, the mean and the deviation of the request process, with E (n) large, is. s £ (n) = «jE (n)? (Equation 3) For example, the nature of the Gaussian distribution tells us that 66% of the time, the tail will remain within 10% of the mean for E (n) = 100.

System operation The operation of the revealed method depends on a set of uplink parameters, which are called the operating parameters:? ^ Is the average length, in bits, of the AIoha slots in the interval AM is the average length, in bits, of messages in the interval \ l? = average speed of the slot specified for the system 1/ ? * = approximate average speed of requesting the new message specified for the network [* This is an estimate because they do not include any of the uplink messages that are requested by the HCC (ergo not requested by CPE). These are messages such as those associated with the initialization control and time of a network. These messages are assumed to be relatively rare.] These parameters refer to the operative point of attachment 2, section 2-4 of this. We have attached 2 Equation 3, the efficiency: E (Np) = # /? Where Np is the operative point of the disclosed in the embodiment as defined in the referred attachment. In one embodiment of the disclosed method, the operational point will be selected depending on the exact objective of the embodiment. This value will be between 0 and 1.

In most of the forecasted embodiments the uplink will be kept full during critical traffic operation times or "peak traffic". Obviously, when there is a shortage of demand for service and control messages, the operation of one embodiment is improved by filling the excess capacity with ASBIs. This hastens the sensitivity of the method. , It is conceivable that the embodiments will operate with an operating point closer to 0 then in order to increase the robustness of the typical system to reach the spikes in message demand, and / or due to the desire for very small performance delay. Let R be the information speed of the uplink channel. An estimate of R is, R = AM /? + AA? The issue of system tolerance is addressed to increases and decreases in parameters in length and speed over a certain period of time.

The operational parameters are fixed. The actual values of these factors vary from moment to moment. These values are denoted as follows: For any period of time (t, t + T), where T is the stretch of the period: AA (t, t) is the average length, in bits, of the AIoha slots in the period AM (t, t) is the average length, in bits, of messages in the period \ l? (T, t) is the average message speed in the period 1 /? (T, t) is the average speed of the slot in the period Low-Load of the revealed method What happens when the demand yields in a network that is using the BSDP method? If the speeds remain at the operational point, but either or both of the following are true, AM (t, t) < AM AA (t, t) < TO? the system simply has additional capacity. It is intended to be a constant in most embodiments. This does not cause degradation of the operation. The additional capacity can be used as desired (probably with the additional slots of AIoha, so Np moves to the left and the sensitivity of the method is increased (Fig. 13).

If the average lengths remain constant, but, l /? (T, r) < l /? the capacity is also released ascendingly.

The speed of the slot is controlled in the revealed method. The speeds of the slots can be decreased to keep the efficiency of the slot usage constant, but there is no point in this. It just leaves a more empty capacity. Thus, the slot speeds can be increased, the sensitivity is increased, or left the same and the excess capacity used for other control or message purposes as the desired designator. There is no loss of system operation.

In summary, the operation of the disclosed method is not degraded by any decrease in the slot or message length or speeds below the values of the operating point over a period of time.

Overloading a system It is assumed that the operating parameters of the developed method implemented in a particular system are selected to fill the capacity of that system. Because capacity is entrusted, an implementation can not sustain, for any sustained length of time, increases in slot or message lengths or speeds. However, the method is robust in driving trips to longer messages or to more frequent messages as long as such excursions do not last too long.

The question is examined if it is assumed that the ascending operation of the steady state for the moment an excursion begins - meaning the steady state that RQ is near its expected depth and, on the average, IRMs are requiring near the expected number of repetitions for achieve a successful transmission The excursion that occurs is of duration T, with increasing average message length and / or the increasing average message. Then, after the excursion, an installation time which allows the method to return to the stable state operation. The designator of the embodiment may choose any stretch of time T and evaluate the tolerance of the method for the slot and message rates and the message lengths over the values of the operational parameter during the time period T. This operation is a factor to be considered in selecting the operational point.

Speed of the slot on the value of the operating parameter In principle one considers the inferences of increasing the speed of the slot. The speed of the AIoha slot is under full control of the HCC. An increase could be used to decrease the delay by resetting requests for a given period: \ l? lt, t) > \ l? Many slots are taken from the full means of a system whose lower message capacity is available. Many slots ensure that message requests arrive with less delay, but still at operating speed, 1 / ?. And, decreases in the efficiency of the slot used (Np moves to the left). For this to happen, a certain capacity must be released or the requests accumulated.

The reduction in message capacity ensures that: 1 /? (T, t) < \ l? The formula is: Let AMR denote the percentage increase in message speed.

Let? ^ J denote the percentage increase in the speed of the slot.

Am = SR * A I E (Np) AM (Equation 1) The accumulation of IRs in RQ at the above mentioned speed is due to the loss in message capacity. A reasonable choice of values leads to 3% of the accumulation of the message speed in RQ (3% of the speed, not of the RQ depth) for each increase in the speed of the slot of 100%. Other reasonable numbers propose doubling or one RQ every second.

This leads to the guidelines for the method's realization: This practice makes the RQ capacity 10 times its expected depth E (n). Thus, something like 10 seconds of 100% excess of the speeds of the slot can be tolerated by an embodiment with these values of the example. Message speed over the value of the operational parameter The speed of the augmented message is expressed: \ l? (T, t) < \ l? The HCC can increase the speed of the slot to match the message speed increased, thereby maintaining the efficiency of the slot used. However, this reduces the available capacity for message transmission, and, still, there are more messages that are applied in the operational parameter.

The importance of the previous observation is that there is no solid limit inherent in the speed of the message due to the approach of the AIoha request collection. HCC can always increase the slots to keep the AIoha system stable. The limit is only when all the capacity is used by ASBIs, which would not be a realistic danger in practical implementations. The price paid is, of course, that few real messages are obtained by transmitting in such a way that the greater capacity is assigned to ASBIs. In that way, RQ grows.

If HCC chooses to keep M? , Np moves to the right (see Figure A2-3 of Attachment 2) with increasing message speed (more requests mean that p has increased).

The message speed refers to the efficiency of the slot used. The maximum possible increase in the efficiency of the slot rate is determined by how far the message speed can increase (on a sustained or permanent basis), and still maintains the successful response for requests with the method. This maximum deviation is determined by moving from the operative point Np assigned to an Np of 1. E (\) =? L? (T, t) l /? (t, t) -l /? = [E (Np), t, t) - E (Np)] l? (Equation 2) Fig. 18 presents the maximum sustainable increase in message speed for a system with the operating point Np. (Sustainable speeds mean speeds that can be maintained at this level forever).

For the increase that holds a message speed greater than the limit of the Figure A4-1, more and more AIoha slots are blocked with requests, until in the prolonged execution each slot has containment and the system stops successfully upon direct requests.

It should be noted that if the speed of the message falls below overspeed, the method is corrected. There is no permanent failure caused by speeding of the message, as long as the average speed of the message eventually falls into good shape.

In the event that message speeds have increased, but have not exceeded the sustainable limit, the limit of S is set by the depth limit RQ. RQ has more IRs coming in than going out during this period, and the time this can be tolerated is determined simply by the depth.

Reasonable numbers are: Given an increase in speed of 50% and a depth RQ x10, a bit over 1 second of such an overload can be tolerated. For deviations from message speed beyond the sustainable limit, two effects come into play. As Np increases, efficiency decreases, and the number of messages that can be served with a fixed slot rate decreases. Thus, requests are essentially lost during the duration of the deviation. In this case, the requests that actually get into the system decreases, and RQ goes backwards. Damage changes are delayed at the entrance.

Message speeds always vary; and there are always deviations at higher speeds - on the sustainable speed according to the modeling of the system. The impact of this is to increase the number of repeated requests procured by a message. The impact of this natural variation on traffic on the behavior of the method is best shown in Fig. 16. Here, it has a high probability of obtaining a request successfully, for which more requests than the average have to be planned.

Message length over the value of the operational parameter The message length has no effect on the operation of the request collection method in system 10. The only impact is on the behavior or the RQ.

The rest of the parameters are kept constant, the impact of an increase in the average length of the message is to increase the number or IRs in RQ. This is simply because longer messages can not be transmitted in a given period of time.

The formula is: Let? ^ J denote the percentage increase in message speed. Let ? denote the percentage increase in message length. ?? ffl = -? i / (l + ?? ffl) The IRs accumulation in RQ at the aforementioned speed. An increase in message length by 50% leads to a decrease in message speed by 33%. The accumulation IRs in RQ at a speed of 33% of the message speed per second (not depth RQ). For a reasonable set of parameters and a RQ depth of x10 the expected operating level will give approximately 1 second of operation with longer message lengths held before RQ overflows.

Of course, when RQ approaches the overflow, the IR insertion algorithm will be naturally designated to select the RQ IRs. Such thinning is observed in the CPE sites of the messages that are culled, and can react in a controlled manner. Thus, the revealed method remains effective under such circumstance.

Synthesis of deviations from the re-operational parameter The operation of the revealed method, as patented herein, depends on controlling the offered message speed, and the average length of the message in the CPEs.

However, the revealed method is robust for "reasonable" deviations of these parameters in the reasonable size ranges, making the method convenient to the standard of practical applicability.

Sensitivities of IRSF The use of ASBIs is inherent in the revealed method. IRMs are transmitted in groups in the ASBl in order to have the relatively large interval size, so that what is required harmonize in the embodiment, and the requests are relatively small to the average message size, as required for the efficient use of the channel. This architecture also supports the effective retransmission process.

A very general method of IRSF is addressed hereafter in order to provide a context to explore the issues in charge of designating the IRSF method for an embodiment. In the progression of this discussion, the existence of an IRSF method that works in a matter required by the revealed method is confirmed.

In order to examine the behavior of the IRSF, certain variables are considered: p = probability of a transmission of a new IRM (first time) by a terminal in an AIoha slot. p = probability of a transmission of an MRI by a terminal in an AIoha slot. S is a stretch of the AIoha slots that are in or through ASBIs. Si is section i in a sequence of sections. tt¡ = is the expected probability that an MRI will be transmitted by a terminal inside S¡. k¡ is the size of the section i.

In general p > p due to retransmissions. If the retransmissions scatter smoothly over the slits of AIoha, equation 4, gives Np = Np eNp Fig. 19 shows the sequence of sections in a channel, each section consisting of a number of slots. For the sake of simplicity, one may think that the basic channel operates as a sequence of S0 sections of size k0. An S0 section allows follows immediately after another. In the S0 section there is a set of new transmissions.

In order to achieve simplicity, one can think of a S0 segment as a range of the revealed method, although this need is not the case.

In the IRSF method of the example, each sequence of the sections S0, S ... are defined as the sequence of sections used by a set of terminals that have transmitted a message (for example IRM) for the first time in the section S0. Note that this set of transmitters does not include terminals that retransmitted in S0. The probability of a new transmission in a terminal of the slot is defined as p. For a section S0, the variable tr0 is introduced, the subscript refers to the section, tr0 = p Note that in system 10, the second equality is Equation 3, which results from: Np =? /? = E (Np) (Equation 3) The channel is assumed to run in a constant state with the probability of transmission in a slot - the repeated and the original ones, from p.

In the IRSF method of the example, YES is a second size interval |. S ^ immediately follows S0. If it contains the first retransmission of the terminals that transmitted in the So what comes and the containment found. Each transmission with its retransmissions is part of a unique sequence as indicated in Fig. 19. The activity of each of these aggregated sequences gives the total activity in a slot.

If the probability of a transmission in any slot of a stretch is equal to the expected probability Np, the expected number of retransmissions from S0 in Si is Expected retransmissions = k0t1- (1-p) N "1] tr0 (Equation 4) In general, the expected number of i retransmissions is denoted by ppi.

There are k0 slots in all S0, each of which contributes a containment with independent probability [1- (1-p) N "1] tr0.Thus, the expected number of contentions of original transmissions in S0 is k0 [1- ( 1-p) N "1] tt0.

The index m, m = ... -1, 0, 1, 2 ..., is entered to distinguish the contiguous sequence of the S0.

The sequence of the S0 is denoted: - •• i So? M, SO.? MY-" We also observe a particular sequence of retransmissions, as shown in Figure A2-5, linking it to the particular section S0 that started the sequence, S0, m- ••• i or, m? S ?? m, S2,, ...

Actually, the "p" of equation 4 up here varies from S0 to S0 in a known way, p is the expected value of this variable. The probability p consists of two components, that component due to the random transmissions of the first time and that due to the retransmissions. From the attachment 2, Equation 5, it is known that in the average, p = peNp = p + p (eNp -1) The second term of this expression is the contribution to p due to repeated transmissions. This statistic is a set statistic - in the practical sense determined by an average over a large number of slots. In the embodiment of the retransmission method considered here, the retransmissions are dispersed following the sections of a certain size. Thus, there is a correlation of the probability of retransmission from one section to the next. Thus, there is a correlation in each section S0 in the aggregate probability of the transmission in a given slot of S0. To encapsulate: The probability p varies in a way in a deterministic way from a section S0 to the next section S0.

This correlated variation is explicitly recognized in p from one S0 to the next.

The retransmissions expected in the section S1? M = (Equation 5) Considering Fig. 19, the impact of the retransmission statistic on an arbitrary S0, m can be considered: A specific slot at any interval S0 sees the same pattern of the overlapping sequences (note that ki has the same value for each sequence of stretches in this example of the embodiment). There are integer overlapping segments int [kj / k0], a segment that is a reminder segment smaller than k0, at least kj is a multiple of the integer of k0. For example, if k- | / k0 is 1.5, there is a complete overlap of the previous stretch So, and Vz overlapped from the previous frame.

In the embodiment example, the distribution of retransmissions is chosen in a stretch so that the impact on the aggregate of the underlying sequence of the S0 intervals is more random - a uniform distribution. First it is observed that the condition kj = k0 is required in order that a distribution can be dispersed over the interval S0, otherwise it is always impossible to reach a uniform distribution at S0. k¡ = k0 (Equation 6) With this simple condition, the distribution is determined from the first principle (ie, observation). One observes that the distribution of a retransmission in the next stretch should be uniformly randomized only if each element of the sequence of the stretch size: k0, k ^ .. is a whole number multiple of k0. In general, with relationships without integers, the distribution option is affected by partial overlap. The observation is: That portion of the slots at the end of a section Si? M that appears as a partial value of the section in the overlapped section So, m + k should be assigned to the random retransmission with the Vz probability of the other slots in the next section. (This is true also for the opposite end of the stretch). This probability is chosen so that the net impact in each slot is to receive the assignment of repetitions from that section (in all sequences) with the same probability.

For example, if k? / K0 is 1, 5, the distribution is described: the first 1/3 of the slots has uniform probability for the% retransmission, the next 1/3 has uniform probability for Vn of the retransmissions, and the last 1/3 has a uniform probability for? A of the retransmissions.

As can be seen in Fig. 16, there is a ratio of each sequence S, m that affects the total probability of transmission in a slot of S0, m + - For example, 2/3 of S ^ m-1 and 1 / 3 of S1f m-2 affects the total probability of transmission in So, m in the example where k ^ ko = 1, 5.

For each position of the slot of So, m, a crossing portion is taken from all the sequences of the section, as illustrated in Fig. 16, cross-sectionally a set of S1 [mu] m, each contributing to the probability that a first retransmission is transmitted in said slot. The expression for the contribution is different for different slots in S0, m, but has the form T i = 1j "d? K0] l - (1 - pm _.) N ~ l and r0 lkx. The term d ^ is 0 for m-i that does not contribute to the probability, and contains the factors of distribution and proportion in the case where there is a contribution m-¡.

For the example, in the first half of the section S0, m > ^ is 3/4 and d1? 2 is 3/4. In the second half of the stretch S0, m d- ^ of 1/2 and d1? 2 is 0. (3/4) k0 [1- (1-pm -?) N "1] TTo / -i + (3 4) k0 first half of the slots (3/2) k0 [1- (1-pm -?) N "']" pO / k ?, second half of the slots Note that if pm-2 = pm-? = .P. the probability of a first retransmission in any slot of the section for the example is deduced to (3/2) k0 [Hl-pfVo / ki = [1- (1-P) N "VO.

In general ? i ^, 8 dq, i = kq > K The probability of the first retransmissions in a particular slot of S0, m +? is denoted as a1? m, d? [l - (1 - Pm _? - 1.}. r0 and, continuing with more retransmissions, \ N-1- Note that if pm.¡ = p, a1? M = (k1 / k0) tr1, m = (í l 0) tr ^ = [1- (1-p) "] tt0, and A2. m = [HI-pf 'rTo In general, Y, with pm.¡ = p The complexity of the general expression highlights the correlation of pm to parfir from one m to the next. This can be seen by, Pm (Equation 7) where a0, m = p. Again, the case p ^ = p is considered, the consistency of the model is confirmed: Demonstrating the inherent stability of the method and the existence of a satisfactory IRSF.

The focus here is the stability and sensitivity of the 1RSF function. The above described illustrates both the good underlying behavior of the system request methodology and the areas of sensitivity for designating parameters. The expected deviation of pm from p is what determines the excursions that a method of requesting the system will have from its expected performance. This can be handled by large law numbers in two aspects: (1) the number of contentions in a stretch has an expectation. The probability that the real number is close to the expectation depends on the size of the stretch that is large with respect to the expected number of contenders. Practically speaking, with a reasonable operating point, between 10 and 30 contentions you should expect the initial stretch where the sensitivity is most significant for reasonable stability. (2) The process should de-correlate very quickly over a number of S0, m. This is done more simply by making great section velocities - thereby forming the probability of a relatively rare repetition transmission in any given slot.

The response time of the method is maximized if the stretches are small, and ki is close to k |.?. There may be the coercion that kj = k0). On the other hand, both desirable peculiarities cause the method to deviate in behavior from a section S0, m to the following one. In the revealed method, this deviation manifests itself in a certain characteristic burst in the performance of IRs. This in turn makes the greatest buffering in the BSDP method necessary in a number of places - RQ, message transmission queues, local IR concentrations, and master IR concentration. The performance burst also implies delay on its own side.

There are a number of approaches to the design of the IRSF. The simplest is to balance the buffering and delay so that the system never (that is, with very low probability) invades buffer sizes (buffer). Equation 7 is used in the designation process to evaluate necessary buffer sizes. A second very controllable method is to simply limit the number of retransmissions, thereby ensuring infinite sequences of S, m, and with that, the de-correlation of the Pm in some sections.

Other modifications may be made to various other embodiments of the present invention by those skilled in the art without departing from the scope of the present. While various forms of the invention have been illustrated and described, it will also be apparent that various modifications can be made without departing from the spirit and scope of the embodiments of the invention.

While the particular embodiments of the present invention have been disclosed, it should be understood that various modifications and combinations are possible and contemplated within the true spirit and scope of the disclosed embodiments and the appended claims. There is no intention, therefore, of limitations to the exact disclosure of this.

Claims (65)

1. A scalable multifunctional network communication method between presentation devices and service providers, characterized in that it comprises: using a group of service interface modules to interface with the presentation devices; use a group of CPE units coupled to the service interface modules; use a group of CPE units that communicate coupled to the presentation devices; receiving via the header control computer the upstream messages from the CPE units and sending the downstream messages to the CPE units from the header control computer; interface between the headend control computer and the service providers by means of a group of service provider control subsystems and wherein the headend control computer receives messages from the CPE units and transfers them to the control subsystems of the headend. service providers, and the headend control computer receives messages from the control subsystems of service providers and transports them to the CPE units.

2. A method according to claim 1, characterized in that it also includes sharing at least one channel using time division multiple access.

3. A method according to claim 1, characterized in that it also includes modulating, transmitting, acquiring, tracking and demodulating the signals in the uplink and downlink.

4. A method according to claim 1, characterized in that it further includes tracking the phase of a master clock of the system by means of a local clock.

5. A method according to claim 4, characterized in that for the clock synchronization purposes, the downlink is blocked to the downlink.

6. A method according to claim 1, characterized in that it also includes organizing and transmitting control messages by means of control applications.

7. A method according to claim 1, characterized in that it further includes using the message transmission queues and message receiving queues in both the header control computer and each CPE.

8. A method according to claim 1, characterized in that it further includes using at least one request queue in each of the CPEs and the header control computer.

9. A method according to claim 1, characterized in that it further includes monitoring the downlink in order to selectively enter the messages in each CPE and in order to maintain the synchronization of the downlink.

10. A method according to claim 1, characterized in that it also includes a receiving router in the header computer control to monitor received messages and route them according to their message headers.

11. A method according to claim 1, characterized in that it also includes using transmission planors in each CPE and the header computer control to affect the transmission of messages.

12. A method according to claim 11, characterized in that it also includes regulating the length and frequency of the messages transmitted so that they are within the range of values desired by the transmission scheduler.

13. A method according to claim 1, characterized in that each CPE uses a control application of the request synchronization algorithm to determine that the local CPE request is identical to the master request for the purpose of synchronization.

14. A method according to claim 1, characterized in that it further includes synchronizing the local pefiction with the master request by a request synchronization algorithm.

15. A method according to claim 1, characterized in that a request insertion algorithm of a CPE is synchronized request and establishes and maintains an IR transmission time for a substantial number of IRs in the local request queue.

16. A method according to claim 1, characterized in that it also includes recording each CPE, the record includes the determination of the CPE offset, the offset is the propagation time in the downlink between each CPE and the header control computer.

17. A method according to claim 1, characterized in that it further includes selecting an IR message to transmit by means of a transmission scheduler and determining the IR selection order for transmission based on characteristics of the IR message.

18. A method according to claim 1, characterized in that each CPE includes a transmission scheduler for selecting the AIoha slots for the transmission of a request message.

19. A method according to claim 1, characterized in that it includes generating the interval requests for the AIoha variables by means of an algorithm that holds the AIoha slot in the header control computer.

20. A scalable multifunctional network communication system between the presentation devices and service providers, characterized in that it comprises: a group of service interface modules for communicating with the coupling of the presentation devices; a group of CPE units coupled to the service interface modules, means for receiving the upstream messages from the CPE units by means of the header control computer and sending the messages by means of the header control computer downstream to the CPE units; means for interfacing between the header control computer and the service providers by means of a group of control subsystems of the service provider and wherein the header control computer receives messages from the CPE units and transfers them to the subsystem The control of the service provider and the headend control computer receives messages from the control subsystems of the service provider and transports them to the CPE units.

21. A method or system according to claim 1 or 20, characterized in that it also includes connecting each CPE and presentation devices by means of service interface modules.

22. A method or system according to claim 1 or 20, characterized in that it further includes interconnecting service providers and the header control computer by means of control function units of the service message administration.

23. A system according to claim 20, characterized in that it also includes means for sharing at least one channel using time division multiple access.

24. A system according to claim 20, characterized in that it also includes means for modulating, transmitting, acquiring, tracking and demodulating signals in the uplink and downlink.

25. A system according to claim 20, characterized in that it also includes a master clock in the header control computer and a local clock in each CPE unit, where the local clock tracks the phase of the master clock of the system.

26. A system according to claim 25, characterized in that it also includes means for blocking the uplink to the downlink for the purpose of clock synchronization.

27. A system according to claim 21, characterized in that it also includes means for acquiring and tracking the limits of the interval in the downlink.

28. A method or system according to claim 1 or 20, characterized in that the messages are transported by slots, and each has a message header.

29. A system according to claim 20, characterized in that it also includes control applications for organizing and transmitting control messages.

30. A system according to claim 20, characterized in that it also includes means that define queues for message transmission and queues for receiving messages both in the header computer control and in each CPE.

31. A system according to claim 20, characterized in that it also includes means defining at least one request queue in each of the CPEs and the header computer control.

32. A system according to claim 20, characterized in that it also includes means for monitoring the downlink in order to selectively enter messages at each CPE, and in order to maintain the synchronization of the downlink.

33. A method or system according to claim 1 or 20, characterized in that it further includes demodulating and decoding the uplink messages by means of the header computer control.

34. A system according to claim 20, characterized in that it also includes a receiving router (router) in the header computer control to monitor the received messages and route them according to their message headers.

35. A system according to claim 20, characterized in that it also includes transmission planifiers in each CPE and the header computer control to affect the transmission of messages.

36. A system according to claim 35, characterized in that it also includes means for regulating the length and frequency of messages transmitted so that they are within the values of the range desired by the transmission scheduler.

37. A system according to claim 20, characterized in that it also includes means for each CPE to use a request synchronization algorithm control application to determine that the local CPE request is identical to the master request for the purpose of synchronization.

38. A system according to claim 20, characterized in that it further includes means for synchronizing the local gain with the master request by means of a request synchronization algorithm.

39. A system according to claim 20, characterized in that it also includes means that define a request insertion algorithm of a CPE is synchronized request, and establishes and maintains an IR transmission time for a substantial number of IRs in the local request queue .

40. A system according to claim 20, characterized in that it also includes means for recording each CPE, the record includes determining a CPE offset, the offset is the propagation time in the downlink between each CPE and the header control computer .

41. A method or system according to claim 1 or 20, characterized in that each CPE contains a set of messages that will be transmitted in a message transmission queue.

42. A system according to claim 20, characterized in that it further includes means for selecting an IR message for transmission by means of a transmission scheduler, and determining the order of the IR selection for transmission based on characteristics of the IR message.

43. A system according to claim 20, characterized in that each CPE includes a transmission scheduler for selecting the AIoha slots for the transmission of a request message.

44. A method or system according to claim 18 or 43, characterized in that the transmission scheduler determines that a request message made to be transmitted has been contended, and thus reception by the header computer control is successfully prevented.

45. A system according to claim 20, characterized in that it further includes means for generating the interval requests for ASBIs by means of an algorithm that provides AIoha slot in the header control computer.

46. A header unit for scalable multifunctional network communication between the CPE units coupled between the presentation devices and the service providers, characterized in that it comprises: a header control computer for receiving upstream messages from the CPE units and for send downstream messages to the CPE units; a group of control subsystems of service providers to interface between the header control computer and the service providers; wherein the header control computer receives messages from the CPE units and transports them to the service provider control subsystems, and the header control computer receives messages from the service provider control systems and transports them to the units of CPE.

47. A method, system or a header unit according to claim 1, 20 or 46, characterized in that the messages include the service messages carrying data and control messages in the form of request messages.

48. A header unit according to claim 46, characterized in that it also includes a group of service interface modules.

49. A header unit according to claim 48, characterized in that it also includes means for receiving requests from the CPE units and arranging them in a refresh message of the request queue and sending them in downstream to the CPE units.

50. A customer proprietary equipment unit (CPE) for scalable multifunctional network communication between the display devices and the service providers by means of a header control computer coupled to the service providers through the control subsystems of service providers, characterized in that it comprises: means for coupling the presentation devices; means for sending upstream messages to the header control computer and receiving the downstream messages from the header control computer. wherein the header control computer receives messages from the CPE and other similar CPE units and transfers them to the service provider control subsystems, and the header control computer receives messages from the service provider control subsystems and transports them to the CPE units.

51. A method according to claim 47, characterized in that the request message includes a plurality of message requests from the CPE units.

52. A method according to claim 51, characterized in that it also includes means for receiving the message requests in the CPE units and selecting at least one of them as a time interval of AIoha to send at least one request message of upstream, to the computer header control.

53. A method according to claim 52, characterized in that it further includes receiving the request signals from the CPE units in the header control computer and arranging them in an update message of the request queue and sending downstream to the requesting units. CPE.

54. A method according to claim 53, characterized in that it further includes receiving in the CPE units the update message of the training queue and adding it to its local request queues, and means for sending service messages from the CPE units to the control computer header in response to the time intervals assigned in the request queue.

55. A method according to claim 54, characterized in that it further includes receiving the service messages from the CPE units in the header control computer and in turn distributing them to the CPE units and service provider control subsystems.

56. A method according to claim 21, characterized in that it includes acquiring and tracking interval limits in the downlink.

57. A method according to claim 54, characterized in that it also includes collecting the request messages and forming the update message of the request queue.

58. A method according to claim 57, characterized in that it also includes receiving requests for update messages and placing the messages contained therein in a request queue under the control of an insertion algorithm.

59. A system according to claim 47, characterized in that the request message includes a plurality of request messages from the CPE units.

60. A system according to claim 59, characterized in that it further includes receiving the message requests in the CPE units and selecting at least one of them as an AIoha time interval for sending at least one upstream request message to the header control computer.

61. A system according to claim 60, characterized in that it further includes means for receiving the request signals from the CPE units in the header control computer and ordering them in an updated message from the request queue and sending the downstream to the CPE units.

62. A system according to claim 61, characterized in that they also include means for receiving in the CPE units the updated message from the request queue and adding it to their local request queues, and sending service messages from the CPE units to the Header control computer in response to the assigned time-lines of the request queue.

63. A system according to claim 62, characterized in that it also includes means for receiving in the header control computer of the service messages from the CPE units and in turn distributing them to the CPE units and service provider control subsystems.

64. A system according to claim 63, characterized in that it also includes means for collecting request messages and forming the update message of the request queue.

65. A system according to claim 64, characterized in that it also includes means for receiving requests for update messages and placing the messages contained therein in a request queue under the control of an insertion algorithm.