Method and system for connection admission control

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S395200, C370S397000

Reexamination Certificate

active

06917590

ABSTRACT:
A relationship between the mean number of “empty ” cells per scheduled cycle of the connection server and the cell rate bandwidth in cells-per-second that may be allowed to enter a virtual path that is already considered to be “full”, based on the sum of the sustainable cell rates of its existing component connections, is used as the basis of CAC. Virtual connections may be admitted to a “full” virtual path if the cell rate of the requested connection is less than the allowable cell rate statistically determined from the mean number of “empty” cell timeslots in the path available for use by high-priority cells.

REFERENCES:
Erol Gelenbe, Xiaowen Mang and Raif Onvural, “Bandwidth Allocation and Call Admission Control in High-Speed Networks,” IEEE Communications Magazine, pp. 122-129, 1997.
Harry G. Perros and Khaled M. Elsayed, “Call Admission Control Schemes: A Review,” IEEE Communications Magazine, vol. 34, pp. 82-91, 1996.
Xiaowen Mang and Erol Gelenbe, “Call Admission Control in ATM Using the Diffusion Model,” IEEE Globecom, vol. 3, pp. 1700-1704, 1996.
Hiroshi Saito and Kohei Shiomoto, “Dynamic Call Admission Control in ATM Networks,” IEEE Journal on Selected Areas in Communications, vol. 9, (No. 7), pp. 982-989, 1991.
Raffaele Bolla, Franco Davoli and Mario Marchese, “Bandwidth Allocation and Admission Control in ATM Networks with Service Separation,” IEEE Communications Magazine, vol. 35, pp. 130-137, 1997.
M. Zukerman and P. W. Tse, “An Adaptive Connection Admission Control Scheme for ATM Networks,” IEEE vol. 3, pp. 1153, 1997.
James W. Roberts, “Variable-Bit-Rate Traffic Control in B-ISDN,” IEEE Communications Magazine, vol. 29, pp. 50-56, 1991.
Kunyan Liu, David W. Petr, Victor S. Frost, Hongbo Zhu, Cameron Braun and William L. Edwards, “Design and Analysis of a Bandwidth Management Framework for ATM-Based Broadband ISDN,” IEEE Communications Magazine, vol. 3, pp. 1712-1716, 1996.
Jonathan S. Turner, “Managing Bandwidth in ATM Networks with Bursty Traffic,” IEEE Network, pp. 50-58, 1992.
Hiroshi Saito, “Dynamic Resource Allocation in ATM Networks,” IEEE Communications Magazine, vol. 35, pp. 146-153, 1997.
S. Jamaloddin Golestani, “Congestion-Free Communication in High-Speed Packet Networks,” IEEE Transactions on Communications, vol. 39 (No. 12), pp. 1802-1812, 1991.
Zhensheng Zhang and Anthony S. Acampora, “Equivalent Bandwidth for Heterogeneous Sources in ATM Networks,” IEEE, vol. 2, pp. 1025-1031, 1994.
Cameron Braun, David W. Petr and Timothy G. Kelley, “Performance Evaluation of Equivalent Capacity for Admission Control,” IEEE Wichita Conference on Communications, pp. 155-158, 1994.
Kunyan Liu, David W. Petr and Cameron Braun, “A Measurement-Based CAC Strategy for ATM Networks,” IEEE, pp. 1-18, 1997.
N. G. Dufield, J. T. Lewis, Neil O'Connell, Raymond Russell and Fergal Toomey, “Entropy of ATM Traffic Streams: A Tool for Estimating QoS Parameters,” IEEE Journal on Selected Areas in Communications, vol. 13 (No. 6), pp. 981-990, 1995.
Thomas M. Chen and Steve S. Liu, “Management and Control Functions in ATM Switching Systems,” IEEE Network, pp. 27-40, 1994.
Cheng-Shang Chang and Joy A. Thomas, “Effective Bandwidth in High-Speed Digital Networks,” IEEE Journal on Selected Areas in Communications, vol. 13 (No. 6), pp. 1091-1100, 1995.
Anwar Elwalid and Debasis Mitra, “Analysis, Approximations and Admission Control of a Multi-Service Multiplexing System with Priorities,” IEEE, vol. 2, pp. 463-472, 1995.
Anwar Elwalid, Debasis Mitra and Robert H. Wentworth, “A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node,” IEEE Journal on Selected Areas in Communications, vol. 13 (No. 6), pp. 1115-1127, 1995.
Gagan L. Choudhury, David M. Lucantoni and Ward Whitt, “Squeezing the Most Out of ATM,” IEEE Transactions on Communications, vol. 44 (No. 2), pp. 203-217, 1996.
Roch Guerin, Hamid Ahmadi and Mahmoud Naghshineh, “Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks,” IEEE Journal, vol. 9 (No. 7), pp. 968-981, 1991.
Ram Krishnan and John A. Silvester, “Resource Allocation in Broadband Networks—Cell, Burst or Connection Level?” IEEE vol. 1 pp. 86-90, 1994.
G. De Veciana, G. Kesidis and J. Walrand, “Resource Management in Wide-Area ATM Networks Using Effective Bandwidths,” IEEE Journal, vol. 13 (No. 6), pp. 1081-1090, 1995.
Yao-Tzung Wang, Tzung-Pao Lin and Kuo-Chung Gan, “An Improved Scheduling Algorithm for Weighted Round-Robin Cell Multiplexing in an ATM Switch,” IEEE, Vo. 2, pp. 1032-1037, 1994.
Kert Mezger, David W. Petr and Timothy G. Kelley, “Weighted Fair Queuing vs. Weighted Round Robin: A Comparative Analysis,” IEEE Wichita, pp. 3-8, 1994.
Tsern-Huei Lee, Kuen-Chu Lai and Shii-Tyng Duann, “Real Time Call Admission Control for ATM Networks with Heterogeneous Bursty Traffic,” IEEE, vol. 1, pp. 80-85, 1994.
R. L. Cruz, “Quality of Service Guarantees in Virtual Circuit Switched Networks,” IEEE Journal, vol. 13 (No. 6), pp. 1048-1056, 1995.
Michael G. Hluchyj and Mark J. Karol, “Queueing in High-performance Packet Switching,” IEEE Journal, vol. 6, (No. 9), pp. 1587-1597, 1988.
S. Jamaloddin Golestani, “Network Delay Analysis of a Class of Fair Queueing Algorithms,” IEEE Journal, vol. 13 (No. 6), pp. 1057-1070, 1995.
Richard J. Gibbens, Frank P. Kelly and Peter B. Key, “A Decision-Theoretic Approach to Call Admission Control in ATM Networks,” IEEE Journal, vol. 13 (No. 6), pp. 1101-1113, 1995.
V. J. Friesen, J. J. Harms and J. W. Wong, “Resource Management with Virtual Paths in ATM Networks,” IEEE Network, vol. 10 (No. 5), pp. 10-20, 1996.
Victor S. Frost and Michael T. Mullen, “Dynamic Bandwidth Allocation for B-ISDN Based On End-To-End Delay Estimates,” IEEE, pp. 225-230, 1992.
C. Courcoubetis, G. Kesidis, A. Ridder, J. Walrand and R. Weber, “Admission Control and Routing in ATM Networks using Inferences from Measured Buffer Occupancy,” IEEE Transactions on Communications, vol. 43 (N. 2/3/4), pp. 1778-1784, 1995.
R. J. Gibbens and F. P. Kelly, “Measurement-Based Connection Admission Control,” International Teletraffic Congress, vol. 28, pp. 879-888, 1997.
Hiroshi Saito, “Call Admission Control in an ATM Network Using Upper Bound of Cell Loss Probability,” IEEE Transactions on Communications, Sep. 1992, vol. 40 (No. 9), pp. 1512-1521, 1992.
Fabrice Guillemin, Catherine Rosenberg and Josee Mignault, “On Characterizing an ATM Source via the Sustainable Cell Rate Traffic Descriptor,” IEEE, pp. 1129-1136, 1995.
Alan Weiss, “An Introduction to Large Deviations for Communication Networks,” IEEE Journal, vol. 13 (No. 6), pp. 938-952, 1995.
Michael Ritter and Phuoc Tran-Gia, “Multi-Rate Models for Dimensioning and Performance Evaluation of ATM Networks,” Interim Report, University of Wurzberg, Institute of Computer Science, 1994.
Natalie Giroux, “Traffic Management Specification Version 4.0.” The ATM Forum Technical Committee, 1996.
Stephen A. Oliva, “Optimizing Integrated Broadband Network Bandwidth Utilization Through Connection Admission Control Using Weighted Round Robin Queue Server Measurements,” Ph.D. dissertation, University of Kansas.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and system for connection admission control 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 system for connection admission control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for connection admission control will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3420664

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.