Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2006-07-04
2006-07-04
Duong, Frank (Department: 2666)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
C370S412000
Reexamination Certificate
active
07072295
ABSTRACT:
In allocating bandwidth to data for transfer through a network device, bandwidth is allocated to committed data traffic based on a guaranteed data transfer rate and a queue size of the network device, and bandwidth is allocated to uncommitted data traffic using a weighted maximum/minimum process. The weighted maximum/minimum process allocates bandwidth to the uncommitted data traffic in proportion to a weight associated with the uncommitted data traffic.
REFERENCES:
patent: 5463620 (1995-10-01), Sriram
patent: 6072772 (2000-06-01), Charny et al.
patent: 6246687 (2001-06-01), Siu
patent: 6324165 (2001-11-01), Fan et al.
patent: 6359861 (2002-03-01), Sui et al.
patent: 6408005 (2002-06-01), Fan et al.
patent: 6452933 (2002-09-01), Duffield et al.
patent: 6469982 (2002-10-01), Henrion et al.
patent: 6515965 (2003-02-01), Hou et al.
patent: 0 680 180 (1995-11-01), None
patent: 0 859 492 (1998-08-01), None
patent: 0 901 301 (1999-03-01), None
patent: 0859 492 (1999-08-01), None
patent: 0 901 301 (2000-07-01), None
patent: WO 97/14240 (1997-04-01), None
Tzeng et al, A Generic Weight-Based Network Bandwidth Sharing Policy for ATM ABR Service, IEEE, pp. 1492-1499, 1998.
Panwar et al, Weighted Max-Min Fair Rate Allocation for Available Bit Rate Service, IEEE, pp. 492-497.
Prabhakar et al, Multicast Scheduling for Input-queued Switches, IEEE, pp. 855-866, 1997.
McKeown et al. “A Quantitative Comparison of Scheduling Algorithms for Input-Queued Switches,” Proceedings IEEE INFOCOM '96, pp. 296-299, San Francisco, 1996.
McKeown, N. “The iSLIP Scheduling Algorithm for Input-Queued Switches,” IEEE/ACM Transactions on Networking, vol. 7, No. 2, pp. 188-201, Apr. 1999.
Charny, A. “Providing QoS Guarantees in Input Buffered Crossbar Switches with Speedup,” Ph.D. dissertation, Massachusetts Institute of Technology, Aug., 1998.
Stephens, D. “Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture,” M.S. Thesis, Carnegie-Melon University, 1998.
Hedge et al. “Real-Time Adaptive Bandwidth Allocation for ATM Switches,” Proceedings IEEE ICC '99, Vancouver, 1999.
Parekh, A. “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks,” Ph.D. dissertation, Massachusetts Institute of Technology, Feb. 1992.
Hou, et al. “A Weighted Max-Min Fair Rate Allocation for Available Bit Rate Service,” IEEE, 1997, pp. 492-497.
Wallmeier, et al. “Traffic Control in ATM Switches with Large Buffers,” ITC Specialists Seminar, NL, Leidschendam, KPN Research, vol. Seminar 9, Nov. 7, 1995, pp. 45-60.
PCT International Search Report, Officer Meurisse, W., Jan. 10, 2001.
Benson Kent D.
Hrabik Terry J.
Kenney John B.
Magill Robert B.
Duong Frank
Tellabs Operations Inc.
LandOfFree
Allocating network bandwidth does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Allocating network bandwidth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Allocating network bandwidth will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3580648