Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2006-11-14
2006-11-14
Kizou, Hassan (Department: 2616)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S395200
Reexamination Certificate
active
07136352
ABSTRACT:
Techniques are disclosed for controlling the transmission of packets over a communication link in a network. The invention in accordance with one aspect thereof determines a number of packet transmission connections supportable for a given buffer size in a node of the network while maintaining one or more specified quality of service requirements for packet transmission. This determination in the case of homogeneous input sources utilizes a combined approximation of a maximum number of supportable connections for a range of buffer sizes, the combined approximation being generated as a combination of a first approximation for small buffer sizes and a second approximation for large buffer sizes. The invention can also be used to determine an optimal operating point on a buffer-capacity tradeoff curve for each of a number of different types of heterogenous input sources. Data packets from multiple input sources may be admitted to the node of the network, or otherwise processed within the node, based at least in part on the determined number of supportable connections.
REFERENCES:
patent: 5838663 (1998-11-01), Elwalid et al.
patent: 6046981 (2000-04-01), Ramamurthy et al.
patent: 6222824 (2001-04-01), Marin et al.
patent: 6314085 (2001-11-01), Saranka
patent: 6856946 (2005-02-01), Dathe et al.
patent: 6907467 (2005-06-01), Venemans
patent: 2002/0163887 (2002-11-01), Suni
Francesco Lo Presti et al, “Source time Scale and Optimal Buffer/Bandwidth Tradeoff for Heterogeneous Regulated Traffic in a Network Node”, Aug. 1999, IEEE, pp. 490-501.
Suk-Gwon Chang, “Fair Integration of Routing and Flow Control in Communication Networks”, Apr. 1992, IEEE, pp. 821-834.
U.S. Appl. No. 09/393,949, filed Sep. 10, 1999, K. Ramanan et al., “Method and Apparatus for Scheduling Traffic to Meet Quality of Service Requirements in a Communication Network.”
L. Georgiadis et al., “Optimal Multiplexing on a Single Link: Delay and Buffer Requirements,” IEEE Transactions on Information Theory, 43(5):1518-1535, 1997.
J. Liebeherr et al., “Exact Admission Control for Networks with a Bounded Delay Service,” IEEE/ACM Transactions on Networking, 4(6):885-901, 1996.
M. Andrews et al.,“Minimizing End-to-End Delay in High-Speed Networks with a Simple Coordinated Schedule,” IEEE INFOCOM'99, pp. 380-388, 1999.
A. Birman et al., “An Optimal Service Policy for Buffer Systems,” Journal of the Association Computing Machinery (JACM), vol. 42, No. 3, pp. 1-26, 1995.
H.R. Gail et al., “Buffer Size Requirements Under Longest Queue First,” Performance Evaluation, vol. 18, pp. 1-13, 1993.
A. Elwalid et al., “Design of Generalized Processor Sharing Schedulers which Statistically Multiplex Heterogeneous QoS Classes,” Proc. of IEEE INFOCOM'99, pp. 1-35, Mar. 1999.
A. Elwalid et al., “A New Approach for Allocating Buffers and Bandwidth to Heterogenous, Regulated Traffic in an ATM Node,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 6, pp. 1115-1127, Aug. 1995.
Kumaran Krishnan
Mandjes Michel
Kizou Hassan
Lucent Technologies - Inc.
Mered Habte
LandOfFree
Method and apparatus for processing of regulated connections... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for processing of regulated connections..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for processing of regulated connections... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3701742