Buffer management policy for shared memory switches

Details Buffer management policy for shared memory switches Buffer management policy for shared memory switches

2006-11-21

2006-11-21

Nguyen, Chau (Department: 2616)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

Reexamination Certificate

active

07139280

ABSTRACT:
A method for allocating space among a plurality of queues in a buffer includes sorting all the queues of the buffer according to size, thereby to establish a sorted order of the queues. At least one group of the queues is selected, consisting of a given number of the queues in accordance with the sorted order. A portion of the space in the buffer is allocated to the group, responsive to the number of the queues in the group. A data packet is accepted into one of the queues in the group responsive to whether the data packet will cause the space occupied in the buffer by the queues in the group to exceed the allocated portion of the space.

REFERENCES:
patent: 5231633 (1993-07-01), Hluchyj et al.
patent: 5541912 (1996-07-01), Choudhury et al.
patent: 2002/0048277 (2002-04-01), Bennett
Noboru Endo, et al., “Shared Buffer Memory Switch for an ATM Exchange”, IEEE Transactions on Communications, vol. 41, No. 1, Jan. 1993, pp. 237-245.
Marek I. Irland, “Buffer Management in a Packet Switch”, IEEE Transactions on Communications, vol. COM-26, No. 3, Mar. 1978, pp. 326-377.
Farouk Kamoun, et al., “Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions”, IEEE Transactions on Communications, vol. COM-28, No. 7, Jul. 1980, pp. 992-1003.
Guy Latouche, “Exponential Sharing a Finite Storage: Comparison of space Allocation Policies”, IEEE Transactions on Communications, vol. COM-28, No. 6, Jun. 1980, pp. 910-915.
G. J. Foschini, et al., “Sharing Memory Optimally”, IEEE Transactions on Communications, vol. COM-28, No. 3, Mar. 1983, pp. 352-360.
A. K. Choudhury, et al., “Dynamic queue length Thresholds for Shared-Memory Packet Switches”, IEEE/ACM Transactions on Communications, vol. 6, No. 2, Apr. 1998, pp. 130-140.
Harry G. Perros, et5 al., “Call Admission Control Schemes: A Review”, IEEE Commun. Maga., Nov. 1996, pp. 82-91.
Ashok Erramili, et al., “Monitoring Packet Traffic Levels”, Proc. IEEE GLOBECOM '94, vol. 1, Dec. 1994, pp. 274-280.
Israel Cidon, et al., “Optimal Buffer Sharing”, IEEE JSAC 13:7, Sep. 1995, pp. 1229-1339.
Andre Baiocchi, et al., “Loss Performance Analysis of an ATM Multiplexer Loaded with High-Speed On-Off Sources”, IEEE JSAC 9:3, Apr. 1991, pp. 388-392.
Xian Cheng, et al., “A Finite Buffer Two Class Queue with Different Scheduling and Push-Out Schemes”, Proc. IEEE INFOCOM '92, May 1992, pp. 231-241.
Hans Kroner, “Comparative Performance Study of Space Priority Mechanisms for ATM Networks”, IEEE INFOCOM '90, Jun. 1990, pp. 1136-1143.
Guo-Liang Wu, et al., “A Buffer Allocation Scheme for ATM Networks: Complete Sharing Based on Virtual Partition”, IEEE/ACM Trans. Networking 3:6, Dec. 1995, pp. 660-670.
Yonghwan Kim, et al., “Timescale of Interest in Traffic Measurement for Link Bandwidth Allocation Design”, IEEE INFOCOM '96, Mar. 1996, pp. 738-748.
Erol Gelenbe, et al., “Bandwidth Allocation and Call Admission Control in High-Speed Networks”, IEEE Commun. Mag., May 1997, pp. 122-129.
H.M. AboElFoton, et al., “An Integrated Call Admission and Buffer Management Scheme for LAN Interconnection Over a Shared-Memory ATM Switch”, Comp. Commun. 21, 1998, pp. 697-714.
Krishnan Kumaran, et al., “Performance and Fluif Simulations of a Novel Shared Buffer Management System”, Proc. IEEE INFOCOM '98, Mar. 1998, pp. 1149-1161.
Santos Krishnan, et al., “Dynamic Partitioning: A Mechanism for Shared Memory Management”, Proc. IEEE INFOCOM '99, Mar. 1999, pp. 144-152.
Ashok Erramilli, et al., “Self-Similarity in High-Speed Network traffic Measurements: Fact or Artifact?”, 12thNordic Teletraffic Seminar NTS 12(VTT Symposium 154), Aug. 1995, pp. 299-310.
Simon Fong, et al., “Performance Evaluation of Shared-Buffer ATM Switches Under Self-Similar Traffic”, 1997 IEEE Int. Performance, Computing and Comm. Conf. Feb. 1997, pp. 252-258.
Hui Zhang, “Service disciplines for guaranteed performance service in packet-switching networks”, Proc. IEEE 83:10, Oct. 1995.
W.A. Aiello, et al., “Competitive queue policies for differentiated services”, Proceedings of INFOCOM 2000, pp. 431-440.
M. Arpachi, et al., “Buffer management for shared-memory ATM switches”, IEEE Commun. Surveys, First Quarter 2000.
James Aspens, et al., “On-line routing of virtual circuits with applications to load balancing and machine scheduling”, Proc. Of the 23rdACM Symp. On Theory of Computing, 1993.
Allan Borodin, et al., “Online computation and competitive analysis”, Cambridge University Press, 1998.
Mark e. Crovella, et al., “Self-similarity in world wide web traffic: evidence and possible causes”, IEEE/ACM trans. Networking 5(6): 835-846, Dec. 1997.
Anja Feldman, et al., “Dynamics of IP traffic: A study of the role of variability and the impact of control”, SIGCOMM '99, Cambridge, Massachusetts, Sep. 1999.
M. G. Hluchyj, et al., “Queueing in high-performance packet switching”, IEEE J. Select. Areas Commun., vol. 6, pp. 1587-1597, Dec. 1988.
Alexander Kesselman, et al., “Buffer overflow management in QoS Switches”, to appear in STOC 2001.
Alexander Kesselman, et al., “Loss-bounded analysis for differentiated services”, to appear in SODA 2001.
Yishay Mansour, et al., “Optimal Smoothing Schedules for Real-Time Streams”, to appear in PODC 2000.
Vern Paxon, et al., “Wide-area traffic: the failure of poisson modeling”, IEEE/ACM Trans. on Networking, Jun. 1995.
Parag Pruthi, et al., “Heavy tailed on/off source behavior and self-similar traffic”, Proceedings of the ICC'95, Jun. 18-22, 1995.
Schwelfel et al., “Analytic model of performance in telecommunication systems, based on On-Off traffic sources with self-similar behavior”, 7thInt. Conf. Telecommunication systems, Nashville, Tennessee, Mar. 18-21, 1999.
Schwelfel, et al., “Buffer size issues in the presence of self-similar traffic”, Third IFIP Workshop on Traffic Management and Design of ATM Networks, London, Apr. 26-27, 1999.
Daniel D. Sleator, et al., “Amortized efficiency of list update and paging rules”, Communications of the ACM, vol. 28, No. 2, Feb. 1995, pp. 202-208.
Andras Veres, et al., “The chaotic nature of TCP congestion control”, Proc. INFOCOM 2000, pp. 1715-1723, Mar. 2000.
Walter Willinger, et al., “Self-similarity through high-variability: statistical analysis of ethernet LAN traffic at the source level”, ACM SIGCOMM'97.

Affiliated with

Also associated with

Rating

Buffer management policy for shared memory switches does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Buffer management policy for shared memory switches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Buffer management policy for shared memory switches will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3698521