Abstract: A communication device includes a transmitter portion, a receiver portion and a management portion. The transmitter portion transmits information into a channel. The receiver portion receives information from the channel. The management portion includes a request-to-send packet generating portion, a clear-to-send packet receiving portion, a threshold database, a comparator and a resolution packet generating portion. The threshold database stores a threshold value for the parameter of the channel and provides the threshold value to the comparator. The comparator compares the threshold value and the channel parameter information and generates an instruction signal based on the comparison. The resolution packet generating portion generates a resolution packet based on the instruction signal and provides the resolution packet to the transmitter portion.

Abstract: A method of operating a decentralized ad-hoc wireless network including wireless stations, comprises establishing a common time reference which is used by the wireless stations to share access to a common wireless channel, the common time reference having a periodic superframe structure including a Scheduled Beacon Period, a Contended Beacon Period, Contention Periods (CPs) and Contention Free Periods (CFPs). The method further comprises time-scheduling, using wireless communication between the wireless stations, the CFPs in the SBTT interval to at least some of the wireless stations requesting access to the CFPs, and granting access to the CPs to at least some of the wireless stations requesting access to the CPs.

Abstract: A communication device and method are provided for communicating with a receiving device over a channel within a mobile ad-hoc network. The receiving device includes a clear-to-send (CTS) packet generating portion that can generate and a CTS packet based on a parameter of the channel and that can transmit the CTS packet over the channel. The communication device includes a transmitter portion, a receiver portion and a management portion. The transmitter portion can transmit information into the channel. The receiver portion can receive information from the channel. The management portion includes a request-to-send (RTS) packet generating portion, a CTS packet receiving portion, a threshold database, a comparator and an RES packet generating portion. The management portion is in communication with the transmitter portion and the receiver portion. The RTS packet generating portion can generate a RTS packet and can provide the RTS packet to the transmitter portion.

Abstract: A method of operating a decentralized ad-hoc wireless network including wireless stations, comprises establishing a common time reference which is used by the wireless stations to share access to a common wireless channel, the common time reference having a periodic superframe structure including a Scheduled Beacon Period, a Contended Beacon Period, Contention Periods (CPs) and Contention Free Periods (CFPs). The method further comprises time-scheduling, using wireless communication between the wireless stations, the CFPs in the SBTT interval to at least some of the wireless stations requesting access to the CFPs, and granting access to the CPs to at least some of the wireless stations requesting access to the CPs.

Abstract: Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.

Abstract: Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.

Abstract: A method and apparatus for providing ABR and UBR services with one FIFO queue. The queue accepts UBR data until a threshold queue capacity (EPD) is reached, at which point data is dropped. This threshold is dynamically adjusted by adding a value proportional to the difference between the actual UBR bandwidth and the target UBR bandwidth. Applications sending data for ABR service are provided with a feedback which allows those applications to regulate the speed at which data is transmitted to the queue, this feedback is a function of some threshold value (AQT) which is also dynamically adjusted as described above. If the queue is being underutilized, an adjustment is made to both EPD and AQT.

Abstract: A flow control method for available bit rate service in an asynchronous transfer mode network for detecting congestion in a switch and conveying congestion status information using resource management cells to the source which adjusts its flow rate accordingly. During detection of congestion in the switch the explicit rate field of the resource management cell is updated using a dynamic major reduction factor to improve transient queue-length performance.

Abstract: Methods and apparatus are provided for designing IP networks with substantially improved performance as compared to existing IP networks such as, for example, those networks designed under best-effort criteria. Particularly, the invention includes methods and apparatus for: computing worst-case and optimistic link capacity requirements; optimizing network topology; and determining router placement within a network.