Abstract: One of a number, n, of slave devices is selected for express or implicit polling by a master device in a communication system that transmits during individual ones of a number of sequentially occurring time slots. This is done by assigning a corresponding priority level to each slave device, wherein at least two slave devices are assigned different corresponding priority levels. A corresponding count parameter and a corresponding initial count value are assigned to each of the slave devices. For each of the slave devices, the corresponding count parameter is initialized to the corresponding initial count value. For each successive time slot, each of the count parameters is adjusted (e.g., by decrementing). A highest priority slave device whose corresponding count parameter has reached or passed a predetermined value is selected for polling.

Abstract: A method for contention resolution in a transmission system (1) is described, the system (1) having a primary station (2) and a plurality of secondary stations (3) coupled to the primary station (2). Sign-On request messages are being sent by the primary station (2) marking starts of contention periods, numbered i=0, 1, 2 . . . , and having period length Pi; whereby a number Mi of the secondary stations (3) sends a Sign-On response message to the primary station (2) in contention period i, and, after sending, waits a feedback period of length Tfb for a response from the primary station (2). If Ni denotes the number of secondary stations (3) participating at the start of contention period i; an approximation for Mi save for a possible constant factor reads: Ni. Pi?1/(Pi?1+Tfb) for i=1, 2,??(1) such that the respective period lengths Pi are determined based on said approximation for Mi.

Abstract: A method is described for communication among equal-access stations of a ring-shaped, serial fiber-optic bus and to a device for carrying out this communications method. One station, during a bus cycle, generates container messages in a strictly time-cyclical manner, addresses them, and provides them to the serial bus, and it transmits a synchronization message at the end of the bus cycle time, each station writing its data into container messages that are addressed to it, and each station, depending on its read authorization, reading the container messages of the serial bus, all the data that have been read in the stations being imported with the assistance of the synchronization message. Thus, equal-access stations of a ring-shaped, serial fiber-optic bus can exchange data, in direct-access, extremely quickly and in a strictly time-cyclical manner.

Abstract: A system for managing data communication between physical layer devices and ATM layer devices in a cell based ATM network is disclosed. A plurality of low speed physical layer devices a high speed physical layer device are connected to a bus. A bus interface device is coupled to the bus, the low speed physical layer devices, and the high speed physical layer device. The bus interface device is operable to provide equal opportunities to access the bus to any connected physical layer device. An arbiter is coupled to the low speed physical layer devices, the high speed physical layer devices, and the bus interface device. The arbiter is operable to provide the high speed physical layer device with disproportionately frequent access to the bus.

Abstract: A digital signal processing system includes multiple processor subsystems, an external input/output port (XPORT), and an XPORT arbiter. The processor subsystems each include a processor core and a DMA controller. The XPORT arbiter arbitrates between the processor cores and between the DMA controllers, and further arbitrates between processor control or DMA control of the XPORT. Upon a request signal from a DMA controller, the XPORT arbiter asserts a hold signal to the processor cores. The processor cores respond by asserting a hold acknowledge signal. A processor core will delay the hold acknowledge signal until through with the XPORT. The arbiter, then asserts a grant signal to the DMA controller requesting access. The arbiter may assert a grant signal to a processor core requesting access. However, the processor core's access will be stalled as long as the hold signal is asserted.

Abstract: In a data switching system, the ingress and egress ports of a memoryless cross-bar switch are controlled by an arbitration method. The arbitration method uses a three phase process involving (i) a request phase in which each ingress port sends its connection requests to egress ports to which a connection is required, (ii) a grant phase in which each egress port uses a grant pointer to select one of the requests directed to it using a grant pointer, and generates a grant signal, and (iii) an accept phase in which each ingress port selects one of the received grant signals to accept, so defining an ingress to egress port connection across the cross-bar switch. The transition sequences for each of the grant pointers are mutually exclusive, so that any synchronisation of the grant pointers is eliminated on the next arbitration cycle. This is arranged by a setting of the paths taken by request and grant signals.

Abstract: Point-to-multipoint communication on a communications network includes receiving a first downlink packet stream addressed to a first mobile recipient, checking whether the first stream is associated with group communication, which has already reserved downlink radio resources for a second downlink packet stream of a second mobile recipient located in the same radio cell as the first mobile recipient. If there are no existing radio resources, new radio resources are allocated for the first stream. If there are existing radio resources, no new radio resources are allocated but the first mobile recipient is instructed to receive the second stream over existing radio resources.

Abstract: This patent concerns a system and method for detecting a mass calling event in a telephone system and to regulate telephone calls to a call destination for which a mass calling event has been detected where a packet transport network and Call Server is integrated into the Public Switched Telephone Network (PSTN). A packet transport network and a central Call Server implement switching functionality traditionally provided by numerous Time Division Multiplexing (TDM) switches within the PSTN. A credit bucket mechanism is used for call regulation in a mass calling event. The packet network may be based on (but is not limited to) ATM, Frame Relay, or IP packet protocols.

Abstract: In a router with redundant central arbiters, a set of control processors (CPs) determines which arbiter is active, which is standby, and when to switch between them. In normal operation ingress ASICs issue requests to the active central arbiter ASIC and keep-alive requests cyclically once per chunk period to the passive arbiter ASIC, which then returns keep-alive grants through the same links to the ingress ASICs and sends standby configuration information to the optical switch ASICs. The arbiter ASICs pass a switch-over decision simultaneously to the optical switch ASICs and ingress ASICs, which empty all queues of outstanding requests, and then resend all of those requests to the new active central arbiter after all queues are empty, such that no router traffic is lost. Mechanisms ensure that during the transition the ASICs properly recognize which data links are healthy and which arbiter is active.

Abstract: A hub connects groups of nodes to form a separate communication loop permitting access to the full bandwidth of the separate communication loop. The switching hub may operate from a subset of the messages defined in the Fiber Channel arbitrated loop protocol while allowing the nodes to use the full protocol.

Abstract: Two types of contention channels are used to accommodate broadband packet data in a satellite communication network. A first contention channel is used by unsynchronized user terminals to access the system and request a traffic channel. The first contention channel is of a sufficient duration to accommodate a RACH message, as well as the timing uncertainty between user terminals within a given spot beam. A second contention channel is shorter in duration than the first contention channel, and is narrowband, so that more than one second contention channel may be transmitted within the bandwidth of the broadband traffic channels. The second contention channels are used by synchronized user terminals for transmitting packet RACH, or PRACH, messages. The more efficient nature of the PRACH channels accommodates the increased overhead associated with bursty packet data, without the capacity cost of the longer duration RACH channel.

Abstract: A system, device, and method for initial ranging that dynamically adjusts the backoff window size to maximize the probability of success during contention access. The invention takes a first system performance measurement using a first backoff window size, a second system performance measurement using a second backoff window size different than the first backoff window size, and determines a third backoff window size based on the first and second system performance measurements.

Abstract: A technique to allow enhanced stations and legacy stations to work with each other without the inefficiencies of signaling overhead in the prior art is disclosed. An enhanced station transmits an initial, short frame using a modulation compatible with legacy stations. The frame sets the duration for a frame exchange—consisting of a data frame, followed by acknowledgement frame—in which the data frame is transmitted using an enhanced modulation format. The duration specified in the transmitted initial frame covers the time interval of the subsequent frame exchange. All stations, including legacy stations, listen in on the frame exchange and refrain subsequently from transmitting spontaneously for the time interval covered by the duration. Alternatively, the frame exchange can comprise multiple data frames with corresponding acknowledgement frames. The enhanced station can also transmit, during the remaining frame exchange, one or more intermediate frames that indicate duration.

Abstract: A bandwidth efficient subscriber unit initialization and synchronization method and apparatus is described. The inventive subscriber unit initialization and synchronization method and apparatus uses a combination of an access burst format and a data transportation technique to efficiently use bandwidth when initializing and synchronizing subscriber units in a time-synchronized communication system. Advantageously, the present invention provides a mechanism for a base station to receive multiple access bursts from multiple subscriber units in a single contiguous time period. In the preferred embodiment of the present invention, bandwidth is efficiently utilized by searching for multiple initial access bursts from multiple mobile stations during a single time period known as a new access opportunity. The preferred embodiment of the present invention initializes and synchronizes subscriber units in a “contention-based” manner.

Abstract: A system and method of data communication for multiple stations using shared communication media within a network. A data communication message structure uses a preamble that includes both source and destination data. The message structure allows use of collision resolve logic to prioritize stations within the network such that the winner is the one with the highest priority. The destination preamble data allows each station to sample and store destination data to a buffer for decoding in the background where the station does not have to support the network data rate.

Abstract: A communication network comprises a head-end and a plurality of network terminations coupled thereto through a shared communication channel, which is accessed by a protocol having one or more dedicated slots wherein upstream data cells are contained, which may collide in a transmission wherein two or more network terminations try to access the shared communication channel practically simultaneously. Herein the protocol is arranged such that the one or more dedicated slots precede the moment whereon the first next downstream transmission is started to be prepared by the head-end. In that case actual information in the dedicated slots can be fed back without substantial delay to the network terminations in order to provide them by return with actual contention information.

Abstract: A method and system for increasing the overall network throughput over a wireless local area network (WLAN). Specifically, in one embodiment of the present invention, the dynamic selection of an initial value for a contention window in the Distributed Coordinated Function (DCF) mode is determined according to the load conditions over the WLAN in a method and system. Stations and access points within a WLAN monitor conditions within the network to establish an initial value for the contention window, also called a minimum contention window value, which is lower than that set by the IEEE 802.11 communication standard. Some factors to consider in determining the load conditions include but are not limited to the following: number of transmissions; number of receptions; and number of collisions.

Abstract: Apparatus and method for controlling transmissions on a network from a source to a destination. A transmission is received from the destination. A signal characteristic of the transmission is determined. A statistical measure is updated using the signal characteristic. The statistical measure is compared to a threshold value. A data transmission from the source to the destination is deferred for a first time period if the comparison of the statistical measure fails. The data is transmitted from the source to the destination after the deferral, if any.

Abstract: A group of wireless APs, including an active primary AP and one or more inactive backup APs, responds to the failure of the active AP. Backup APs passively detect the absence of the primary AP from a coverage area and become active. If more than one Backup AP attempts to assume the role of the primary AP, contention is resolved by applying a conflict resolution algorithm.

Abstract: A method of initializing a multi-zone peer-to-peer entertainment and communications network. During normal network operation, data is streamed from one or more entertainment media source nodes to multiple independent other nodes and, then, passed to connected receivers and/or transceivers. The receivers and transceivers may be located in different zones from each other. The zones may be different rooms in a building or house. The initialization sequence is an autonomous process. During initialization, at least one backplane address is assigned to each network hub port and to each local node. One hub port is designated as backplane master. Upon power-up or a reset, a remote scan is initiated, automatically, from the hub ports to the remote nodes. Any remote node requiring an address responds to the remote scan indicating that one or more addresses are needed. Then, nodes requesting addresses enter a contention arbitration phase to select the next requesting node which is assigned addresses next.

Abstract: A system and method for sending control information between a control unit and at least one of a plurality of cascaded units (CU) connected via a time-multiplexed communications link comprises generating an information message of a predetermined length at a message generator including a CU identifier value and control information, where the CU identifier value corresponds to a designated CU. The information message is sent to a current CU using the time multiplexed communications link. The information message is processed at the current CU, including determining whether the CU identifier value matches the identity of the current CU where the information message is a downlink message.

Abstract: A method of incorporating allocations of network access in a DOCSIS 1.0 compliant cable network, wherein users compete for bandwidth, includes limiting bandwidth consumed by a cable modem of a user to a value representative of that user's bandwidth allocation for a time interval. Preferably, the method includes the steps of: (a) generating cable modem configuration files, each of which limits bandwidth consumption by a cable modem of a user to a bandwidth allowance of that user equaling to the respective bandwidth allocation; (b) sending the configuration files to a Trivial File Transfer Protocol (TFTP) Server of the DOC Network; and (c) sending a command either to each user's cable modem, or to a cable modem termination system to which each user's cable modem is connected, to cause the cable modem to implement the respective new configuration file.

Abstract: A CANOpen network including a bus master and an I/O module are disclosed. Each are communicatively coupled to a common bus. The I/O module is subject to a state change. The bus master collects state information from the I/O module by sending a state signal from the I/O module to the bus master in response to a state change of the I/O module, sending a trigger signal from the bus master to the I/O module, and sending a state signal from the I/O module to the bus master in response to the trigger signal.

Abstract: A radio communication system has a random access channel for the transmission of data (214) from a secondary station to a primary station. Such a channel is intended for use by secondary stations having data (214) to transmit to a primary station while not actually engaged in a call. A problem with known systems of this type is that a secondary station requesting access also specifies which of a plurality of resources it wishes to access. If that resource is busy access is denied, even if other suitable channels are available. In the present system allocation of a channel is performed by the primary station when acknowledging (206,210) a secondary station's access attempt (202,208), thereby eliminating wasted attempts. In one embodiment the primary station also periodically broadcasts a short message indicating the availability of channels for access attempts.

Abstract: At a first device (102 or 104), a message is received and processed. If the message is processed during a first time period, the first device transmits an acknowledgement message during a second time period; otherwise the first device transmits the acknowledgment message during a third time period. The second time period and the third time period are exclusive of each other.

Abstract: A technique for selecting the offset between data bursts and their respective control packets in an optical burst switching arrangement includes: randomly generating a plurality of tokens; receiving a plurality of sequentially generated data bursts; and receiving a plurality of control packets, each control packet corresponding to a respective one of the plurality of data bursts. One of the plurality of control packets is first outputted and its corresponding respective data burst is then outputted at a time corresponding to the generation of the first of the plurality of tokens which occurs at a time in which no data burst is being outputted, the outputting of the data burst being offset from the output of its corresponding respective control packet by a time period. The average rate at which the plurality of data bursts are outputted may be equal to the reciprocal of the mean of the probability distribution used to generate the plurality of tokens.

Abstract: A system (100) to enable the transfer of Internet protocol (IP) format data (12, 14) over a point-to-multipoint passive optical network (PON, 16) is illustrated in FIG. 2. An exchange (102) is connected to a plurality of outstations (104-108) via an optical communication resource (24, 26-38) including a passive optical splitter (22) providing isolation to individual outstations. Media access control of the plurality of outstations is administered by the exchange (102), with collision detection logic (112) in the exchange determining collision (158) of Internet protocol (IP) encoded data communicated thereto through the PON (16). The IP encoded data realises a transport mechanism through the PON. Each of the plurality of outstations (104-108) and the exchange (102) is adapted to pass data in an IP format to and from the optical communication resource such that IP encoded data is transported, in use, directly between the outstation and the exchange.

Abstract: A technique for controlling outliers in offered load estimation in a shared medium communication network is achieved by partitioning the set of all possible sample value combinations, according to some predetermined partitioning scheme, based on a measure of proximity to a locus of expected sample values into a set of “trusted” sample value combinations and “untrusted” sample value combinations.

Abstract: According to some embodiments, a resource is allocated in accordance with a masked request vector.

Abstract: A method of providing secure multicast over a local access network by means of a network access unit having a channel request vetting function and a permitted channel list. Channel requests from a subscriber are vetted with respect to the permitted channel list and forwarded only if permitted. The permitted list may be dynamically updated under headend control to allow users to subscribe to, and unsubscribe from, services upon request.

Abstract: A signal communication device for use within a computer includes a set of optical fibers configured to form an optical computer bus between a set of computer sub-system elements of a computer. A set of input optical connector cards are connected to the set of optical fibers. Each of the input optical connector cards includes a transmitting dynamic bandwidth allocator responsive to an optical bus clock signal operating at a multiple of a computer system clock signal such that a set of bus time slots are available for each computer system clock signal cycle. The transmitting dynamic bandwidth allocator allows a light signal to be applied to the optical computer bus during a dynamically assigned bus time slot. In this way, the optical computer bus bandwidth can be dynamically allocated to different computer sub-system elements during a single computer system clock signal cycle.

Abstract: Normal 802.3 Ethernet requires a tree topology. If a ring or a loop exists, then packets will be forwarded around the ring indefinitely. If the ring is broken, then there is no possibility of packets being propagated forever. This invention shows how to quickly impose a virtual break in the ring such that all nodes can communicate with each other, and how to remove the virtual break when a real failure occurs. This is accomplished by placing intelligent nodes on the ring that work together to virtually break and restore the ring. An embodiment is disclosed that handles a unidirectional break in a communication link. This abstract is provided as an aid to those performing prior art searches and not a limitation on the scope of the claims.

Abstract: A single-wire serial communications bus has a master device and one or more slave devices. The slave devices are addressed according to a predetermined addressing scheme in an address space. The master device starts a transmission with a number of line state changes which define a clock period to be used by the slave devices in clocking and framing the serial data. This permits omitting a clock line, thus saving a pin and saving printed circuit board space. This also permits the slave devices to shut down their own clocks during periods of inactivity on the bus, thus saving power. Likewise the master device is able to shut down its clock during periods of bus inactivity.

Abstract: Apparatus and method for implementing virtual path aggregation (VPA) of underlying virtual connections at a switching node of a connection based communications network. A multi-service traffic shaping module (MTSM) at the switch implements algorithms to aggregate the VC and VP connections onto the aggregate VP by representing an aggregate VP as a plurality of circular linked lists or loops and assigning each VC connection to a link or element in the circular linked lists according to traffic descriptors. Weighting factors are used as between loops to dynamically select the next loop to service. Once this loop is chosen, the next VC to be serviced is identified by examining the circular linked list structure.

Abstract: Techniques for rescheduling one or more timing intervals associated with a channel of a communication system. Responsive to a detected change in a property of the channel, a rescheduling algorithm identifies a given one of the timing intervals, within a schedule for the channel, that violates a system requirement in view of the detected change. The algorithm determines if the interval can be rescheduled to accommodate the detected change and if so reschedules the interval. If the interval cannot be rescheduled to accommodate the detected change, the interval is removed from the schedule. The rescheduling process may be repeated for each of the intervals in the channel schedule. The intervals in an illustrative embodiment may include, for example, grants, polls, free intervals or initial-maintenance intervals (IMIs) of an upstream channel in a DOCSIS-compliant CATV system.

Abstract: A network, such as a radio network, uses dynamic transmission scheduling and soft clustering. When nodes contend for data slots, each node that is successful continues to have its data slot reserved for it until it sets an end-of-stream bit in an information summarization packet, indicating that it will stop broadcasting. From the information summarization packets, each node determines the other nodes to which it will listen, based on proximity and information content.

Abstract: Disclosed is a channel allocation method on performing a data communication in a wide band wireless multi-media communication system, which allocates selectively reserved time slots or contention time slots, according to the quantity of data to be sent. In the method, contention time slots are used for sending data if the quantity of data to be sent is smaller than a critical value, or reserved time slots are used if the data quantity is greater than the critical value.

Abstract: A Fast Notification Access Channel is used in a system for multiplexing users on a shared cellular packet data traffic channel in a cellular packet data network system. The system includes a mobile station having a mobile station control system. The mobile station control system transmits packet data on the shared packet data traffic channel to a base station until it reaches an inactive period and upon having additional data to transmit transmits a notification signal to the base station, the notification signal uniquely identifying the mobile station on the shared cellular packet data traffic channel. A network control system is operatively associated with the base station. The network control system allocates uplink on the shared packet data channel to the mobile station after receiving the notification signal until the mobile station reaches the inactive period.

Abstract: The cell switching architecture of the present invention uses at least one earliest deadline first (EDF) queue for each of the output ports in a cell switch so that no two output ports have a common earliest-deadline-first queue. Cells are arranged in each EDF queue according to deadline, but each EDF queue only contains cells for a single destination output port. Each input port also has an input queue with an EDF queue for each of the output ports, and each EDF queue arranges the cells for a single output port. Many equivalent cells may be represented by a single EDF queue entry, enabling large buffer capacity to be supported by small EDF queues. The architecture provides a method for switching cells between a plurality of input ports and a plurality of output ports. Cells are accepted from input ports into a plurality of corresponding input queues. Cells are sorted into groups according to the destination output port such that each group includes cells destined for a single output port.

Abstract: A network communication system is provided whereby communication stations can obtain priority for data transmission to communicate directly with each other in a contention-free mode communication period independently of a polling operation of the control station. The control station emits a series of beacons at equal intervals to initiate contention-free mode communication at the completion of a predetermined number of beacons. During the maximum contention-free mode communication period a contention-free communication operation is initiated, for allowing contention-free mode transmission, by a polling operation by the control station. A series of time-slots is imaginarily provided at equal intervals from the start of the contention-free period throughout the maximum contention-free period. A communication station conducts a call-connection procedure in order to obtain a priority for data transmission in a given set of time-slots.

Abstract: The present invention provides a medium access control (MAC) protocol for the collision-free transmission of packets into a channel, such that nodes are assigned time slots for collision-free transmission based on the knowledge that they acquire regarding the constituency of their local neighborhoods and the advertisements of the time slots when nodes in local neighborhoods will attempt to transmit again. The scheduling procedure may utilize an age of the network together with the unique identifiers of nodes. The candidate transmission times for each node are determined using a list of the subsequent transmission times advertised by other nodes. The node discards the advertised transmission times from the list of potential transmission times, and computes its candidate transmission times using a function that provides a varying (pseudorandom) distribution of outputs for a varying sample of inputs. This function ay be a hash function, an encryption function, or a table lookup function.

Abstract: A pipelined arbitration mechanism allows a routing control decision to be effected for a later packet while a current packet is being transferred. The later packet can be issued a fixed number of cycles after the current request. The mechanism has particular advantages when used with a plurality of functional modules connected to a packet router, whereby a single functional module can generate a current request relating to a current packet and a deferred arbitration request relating to a later packet to be issued a fixed number of cycles after the current request.

Abstract: There is disclosed an interworking function unit for transferring data between a wireless network and an Internet protocol (IP) data network coupled to the wireless network. The interworking function unit comprises a protocol conversion controller that receives incoming data packets from the wireless network, wherein the incoming data packets are generated by a first mobile station and are formatted according to a protocol associated with the wireless network. The interworking function unit converts the incoming data packets to IP data packets formatted according to an Internet protocol of the IP data network. The interworking function unit also comprises a first security controller for preventing unprovisioned mobile stations from accessing the IP data network through the wireless network. The first security controller receives the IP data packets and replaces each original IP packet header with a replacement IP packet header containing the IP address of a provisioning server.

Abstract: The present invention is directed to methods and systems for optimizing UTOPIA CLAV polling arbitration. According to an aspect of the present invention, UTOPIA L2 CLAV status polling of each PHY address may be optimized by polling PHY addresses that have not yet indicated an active CLAV status or have just finished a cell transfer so that a CLAV response is required again. According to another aspect of the present invention, UTOPIA L2 CLAV status polling may be arbitrated so faster connection PHY addresses are polled proportionally more often than slower connection PHY addresses. According to yet another aspect of the present invention, if a connection speed no longer has any PHY addresses which require polling, the arbitration may be altered so only the connection speed with PHY addresses which require polling are actually polled. This ensures that the polling bandwidth is used as efficiently as possible.

Abstract: A host device logs in a printer as a print data transfer destination to acquire type information of the printer and issues SB_CONT.req to determine whether a cycle master necessary for isochronous transfer is present on a serial bus. The print data transfer mode and transfer parameter are set in accordance with the presence/absence of the cycle master and the acquired type information. If the cycle master is present on the serial bus, isochronous transfer is set as the transfer mode; otherwise, asynchronous transfer is set as the transfer mode. Therefore, even when devices without any cycle master function are connected, or no cycle master is present on the bus, print data can be transferred from the host device to the printer.

Abstract: A communication right determination method determines a right to communicate between a host unit and a plurality of terminal equipments coupled to the host unit. The communication right determination method includes the steps of (a) transmitting polling information from the host unit simultaneously to the terminal equipments, (b) transmitting connection response information from the terminal equipments to the host unit at times which are different for each of the terminal equipments depending on the polling data received from the host unit, and (c) establishing a communication between the host unit and a predetermined terminal equipment from among the terminal equipments depending on the connection response information which is received from each of the terminal equipments.

Abstract: A networking method is disclosed. At least one silent slot is included in either a collision detection prefix disposed before a preamble of one or more frames of data to be transmitted across a media or in the one or more frames of data to be transmitted across the media. Transmission collision is detected during the at least one silent slot included. In one embodiment, the method is embodied in a network interface controller having a media access control block to control access to a media, and a physical signal block to physically signal data to be transmitted. The media access controller includes the at least one silent slot in either the collision detection prefix or in the data, and the physical signaling block performs the transmission collision detection during the included at least one silent slot.

Abstract: Connection ports for interconnecting functional modules in an integrated circuit are described. The connection ports provide enhanced functionality based around a common port primitive. This simplifies port design and selection and also allows a common packet protocol to be used for communication of packets across the packet router. In particular, there is improved functionality of target ports which allow out of order requests to be dealt with and out of order responses to be generated.

Abstract: A method of optimal contention region allocation for medium access control in multipoint-to-point networks, and in particular a method of obtaining optimal contention region allocation so that to achieve optimal throughput. The method establishes an optimal table so that the object of optimal allocation to reduce collision for medium access in multipoint-to-point networks can be achieved. Based on the aspects of present invention, optimal throughput can be achieved, thus reducing the wastage of bandwidth.

Abstract: A multiple access communication protocol includes an uplink channel and a downlink channel is disclosed. The uplink channel has a plurality of frames, such that each frame has a first selectable number of minislots and a second selectable number of slots. A reservation request of a first type is sent into a first selected minislot of a selected frame of the uplink channel when information of a first type is to be sent. The reservation request of the first type requests an assignment for at least one slot for transmitting information of the first type in at least one frame that is subsequent to the selected frame. A reservation request of the second type is sent into a second selected minislot of the selected frame when the second selected minislot is available in the selected frame and when information of a second type is to be sent.