CA2229577A1 - Method and apparatus for controlling traffic flows in a packet-switched network in order to guarantee service performance - Google Patents
Method and apparatus for controlling traffic flows in a packet-switched network in order to guarantee service performance Download PDFInfo
- Publication number
- CA2229577A1 CA2229577A1 CA002229577A CA2229577A CA2229577A1 CA 2229577 A1 CA2229577 A1 CA 2229577A1 CA 002229577 A CA002229577 A CA 002229577A CA 2229577 A CA2229577 A CA 2229577A CA 2229577 A1 CA2229577 A1 CA 2229577A1
- Authority
- CA
- Canada
- Prior art keywords
- slots
- slot
- connection
- ideal
- new
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L12/5602—Bandwidth control in ATM Networks, e.g. leaky bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5636—Monitoring or policing, e.g. compliance with allocated rate, corrective actions
- H04L2012/5637—Leaky Buckets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5649—Cell delay or jitter
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5672—Multiplexing, e.g. coding, scrambling
- H04L2012/5675—Timeslot assignment, e.g. TDMA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5679—Arbitration or scheduling
Abstract
A scheduling device for use in a packet-switched network, belonging to the class of non-work conserving or idling weighted round robin (WRR) arbiters, assigns a new connection N new slots in a fixed-length repeating scheduling frame by selecting free slots which are close to idealized slots that would, if assigned, eliminate fitter or cell delay variation. The scheduler is able to simultaneously determine if a new constant bit rate connection requiring a predetermined bandwidth conforms to a leaky bucket or GCRA algorithm characterized by a peak packet or cell emission interval T=1/PCR and a packet or cell delay variation time, CDVT, i.e., whether the new connection is GCRA (T, CDVT) conformant. This determination is made by comparing the quantity ME + ML
against the CDVT, where ME is a time equivalent to the maximum number of slots by which any assigned slot is earlier than a corresponding ideal slot and ML is a time equivalent to the maximum number of slots by which any assigned slot is later than a corresponding ideal slot. The scheduler can thus also carry out connection admission control (CAC) functions in an ATM
network switch.
against the CDVT, where ME is a time equivalent to the maximum number of slots by which any assigned slot is earlier than a corresponding ideal slot and ML is a time equivalent to the maximum number of slots by which any assigned slot is later than a corresponding ideal slot. The scheduler can thus also carry out connection admission control (CAC) functions in an ATM
network switch.
Claims (24)
1. A method for determining whether a constant bit rate connection which has been assigned a set of N slots in an FL, FL ~ N, slot scheduling frame conforms to a leaky bucket algorithm characterized by a peak packet emission interval, T, and a packet delay variation time, CDVT, said method comprising the steps of:
(a) selecting a set of N ideal slot positions for said connection wherein the ideal slots are spaced apart from each other by a time substantially equal to T;
(b) determining a maximum amount ME by which any said assigned slot is earlier than a corresponding said ideal slot;
(c) determining a maximum amount ML by which any said assigned slot is later than a corresponding said ideal slot; and (d) comparing the quantity ME + ML against said CDVT and in response thereto concluding whether said connection conforms to said leaky bucket algorithm.
(a) selecting a set of N ideal slot positions for said connection wherein the ideal slots are spaced apart from each other by a time substantially equal to T;
(b) determining a maximum amount ME by which any said assigned slot is earlier than a corresponding said ideal slot;
(c) determining a maximum amount ML by which any said assigned slot is later than a corresponding said ideal slot; and (d) comparing the quantity ME + ML against said CDVT and in response thereto concluding whether said connection conforms to said leaky bucket algorithm.
2. The method according to claim 1, wherein said slots have identical fixed time durations.
3. The method according to claim 2, wherein said packets have a fixed length.
4. A method for determining whether a constant bit rate connection which has been assigned a set {C1, C2, ... CN-1, CN} of slots in an FL, FL~ N, slot scheduling frame conforms to a leaky bucket algorithm characterized by a peak packet emission interval, T, and a packet delay variation time, CDVT, said method comprising the steps of:
(a) selecting a set {I1, I2, ... I N-1, I N} of ideal slot positions for said connection wherein every slot h is spaced apart from slot I j-1, j ~ {2, 3, .. N}, by a time substantially equal to T;
(b) selecting a maximum-valued element, ME, of the set {I k-C k: k ~ {1, 2, ... N}};
(c) selecting a maximum-valued element, ML, of the set {C k-I k: k ~ {1, 2, ... N}} ; and (d) comparing the quantity ME + ML against said CDVT and in response thereto concluding whether said connection conforms to said leaky bucket algorithm.
(a) selecting a set {I1, I2, ... I N-1, I N} of ideal slot positions for said connection wherein every slot h is spaced apart from slot I j-1, j ~ {2, 3, .. N}, by a time substantially equal to T;
(b) selecting a maximum-valued element, ME, of the set {I k-C k: k ~ {1, 2, ... N}};
(c) selecting a maximum-valued element, ML, of the set {C k-I k: k ~ {1, 2, ... N}} ; and (d) comparing the quantity ME + ML against said CDVT and in response thereto concluding whether said connection conforms to said leaky bucket algorithm.
5. The method according to claim 4, wherein said slots have identical fixed time durations.
6. The method according to claim 5, wherein said packets have a fixed length.
7. Call processing and connection admission control apparatus for use in a packet-switched network node element, said apparatus comprising:
(a) means for assigning a newly requested constant bit rate connection a set of N slots in an FL, FL ~ N, slot scheduling frame;
(b) means for selecting a set of N ideal slot positions for said connection wherein said ideal slots are spaced apart from each other by a time substantially equal to a peak packet emission interval, T;
(c) means for determining a maximum amount ME by which any said assigned slot is earlier than a corresponding said ideal slot;
(d) means for determining a maximum amount ML by which any said assigned slot is later than a corresponding said ideal slot; and (e) comparison means for comparing a quantity ME + ML against said CDVT and in response thereto concluding whether said connection conforms to a leaky bucket algorithm characterized by said peak packet emission interval, T, and said packet delay variation time, CDVT.
(a) means for assigning a newly requested constant bit rate connection a set of N slots in an FL, FL ~ N, slot scheduling frame;
(b) means for selecting a set of N ideal slot positions for said connection wherein said ideal slots are spaced apart from each other by a time substantially equal to a peak packet emission interval, T;
(c) means for determining a maximum amount ME by which any said assigned slot is earlier than a corresponding said ideal slot;
(d) means for determining a maximum amount ML by which any said assigned slot is later than a corresponding said ideal slot; and (e) comparison means for comparing a quantity ME + ML against said CDVT and in response thereto concluding whether said connection conforms to a leaky bucket algorithm characterized by said peak packet emission interval, T, and said packet delay variation time, CDVT.
8. The apparatus according to claim 7, wherein said slots have identical fixed time durations.
9. The apparatus according to claim 8, wherein said packets have a fixed length.
10. Apparatus for communicating data in a packet-switched network, comprising:
a data processor having a memory;
input means for receiving packets from a connection source and for queuing said packets in said memory;
means for defining a repeating scheduling frame having a total of FL slots and for maintaining a list of free slots therein;
means for determining a number, N new, of said slots needed to satisfy the bandwidth requirement of said connection;
means for identifying a set {I[0], I[1], I[2] ... I[N new 1]} of ideal slots for said connection which are spaced apart from each other by a time substantially equal to a peak emission interval between said packets;
a program executing on said processor for selecting a set {VC[0], VC[1], VC[2], ..., VC[N new -1]} of said free slots for said connection such that ME + ML ~ CDVT, wherein ME is a time corresponding to a maximum number of said slots by which any said assigned slot VC[j] is earlier than a corresponding said ideal slot I[j], j ~ {0,1, 2,.. N new -1}, ML is a time corresponding to a maximum number of said slots by which any said assigned slot, VC[k], is later than a corresponding said ideal slot I[k], k ~ {0,1, 2,.. N new-1}, and CDVT is a predetermined upper bound on the packet delay variation time; and output means for retrieving the queued packets of said connection from said memory and transmitting said retrieved packets to an output link only during the time periods represented by said assigned slot positions.
a data processor having a memory;
input means for receiving packets from a connection source and for queuing said packets in said memory;
means for defining a repeating scheduling frame having a total of FL slots and for maintaining a list of free slots therein;
means for determining a number, N new, of said slots needed to satisfy the bandwidth requirement of said connection;
means for identifying a set {I[0], I[1], I[2] ... I[N new 1]} of ideal slots for said connection which are spaced apart from each other by a time substantially equal to a peak emission interval between said packets;
a program executing on said processor for selecting a set {VC[0], VC[1], VC[2], ..., VC[N new -1]} of said free slots for said connection such that ME + ML ~ CDVT, wherein ME is a time corresponding to a maximum number of said slots by which any said assigned slot VC[j] is earlier than a corresponding said ideal slot I[j], j ~ {0,1, 2,.. N new -1}, ML is a time corresponding to a maximum number of said slots by which any said assigned slot, VC[k], is later than a corresponding said ideal slot I[k], k ~ {0,1, 2,.. N new-1}, and CDVT is a predetermined upper bound on the packet delay variation time; and output means for retrieving the queued packets of said connection from said memory and transmitting said retrieved packets to an output link only during the time periods represented by said assigned slot positions.
11. The apparatus according to claim 10, wherein said slots have identical fixed time durations.
12. The apparatus according to claim 11, wherein said packets have a fixed length.
13. Apparatus for communicating data in a packet-switched network, comprising:
a data processor having a memory;
input means for receiving packets from a connection source and for queuing said packets in said memory;
means for defining a repeating scheduling frame having a total of FL slots and for maintaining an ordered list of free slots therein;
means for determining a number, N new, of said slots needed to satisfy the bandwidth requirement of said connection;
means for identifying a set {I[0], I[1], I[2] ... I[N new 1]} of ideal slots for said connection which are spaced apart from each other by a time substantially equal to a peak emission interval between said packets;
means for assigning a set {VC[0], VC[1], VC[2], ..., VC[N new 1]} of said free slots to said connection which approximate or equal said ideal slots, wherein a given VC[i), i ~ {1,2,.. N new-1}, is selected to be one of said free slots which does not increase the overall burstiness of said connection, and in the event such a free slot does not exist, one of said free slots which least increases the overall burstiness of said connection; and output means for retrieving the queued packets of said connection from said memory and transmitting said retrieved packets to an output link only during the relative time periods represented by said assigned slots.
a data processor having a memory;
input means for receiving packets from a connection source and for queuing said packets in said memory;
means for defining a repeating scheduling frame having a total of FL slots and for maintaining an ordered list of free slots therein;
means for determining a number, N new, of said slots needed to satisfy the bandwidth requirement of said connection;
means for identifying a set {I[0], I[1], I[2] ... I[N new 1]} of ideal slots for said connection which are spaced apart from each other by a time substantially equal to a peak emission interval between said packets;
means for assigning a set {VC[0], VC[1], VC[2], ..., VC[N new 1]} of said free slots to said connection which approximate or equal said ideal slots, wherein a given VC[i), i ~ {1,2,.. N new-1}, is selected to be one of said free slots which does not increase the overall burstiness of said connection, and in the event such a free slot does not exist, one of said free slots which least increases the overall burstiness of said connection; and output means for retrieving the queued packets of said connection from said memory and transmitting said retrieved packets to an output link only during the relative time periods represented by said assigned slots.
14. The apparatus according to claim 13 wherein said overall burstiness of said connection is defined by a quantity ME + ML, wherein ME is a time equivalent to the maximum number of said slots by which any said assigned slot VC[j] is earlier than a corresponding said ideal slot I[j], j ~
{0,1, 2,.. N new -1}, and ML is a time equivalent to the maximum number of said slots by which any said assigned slot, VC[k], is later than a corresponding said ideal slot I[k], k ~ {0,1, 2,.. N new -1}.
{0,1, 2,.. N new -1}, and ML is a time equivalent to the maximum number of said slots by which any said assigned slot, VC[k], is later than a corresponding said ideal slot I[k], k ~ {0,1, 2,.. N new -1}.
15. The apparatus according to claim 13 including means for computing a quantity ME +ML, wherein ME is a time equivalent to the maximum number of said slots by which any said assigned slot VC(j] is earlier than a corresponding said ideal slot I[j], j ~ {0,1, 2,.. N new -1}, ML is a time equivalent to the maximum number of said slots by which any said assigned slot, VC[k], is later than a corresponding said ideal slot I[k], k ~ {0,1, 2,.. N new -1}, said quantity ME+ML providing an upper bound of a packet delay variation time for said connection.
16. The apparatus according to claim 14 wherein said VC[i] is one (a) of the closest free slot preceding or equal to I[i] and (b) the closest free slot receding I[i].
17. The apparatus according to claim 13 wherein said first ideal slot I[0] is a first said free slot.
18. The apparatus according to claim 13 wherein VC[i] is iteratively determined.
19. The apparatus according to claim 14 wherein I[i], VC[i], ML and ME are iteratively determined.
20. The apparatus according to claim 15 wherein I[i], VC[i], ML and ME are iteratively determined.
21. The apparatus according to claim 16 wherein I[i], VC[i], ML and ME are iteratively determined.
22. The apparatus according to claim 21 wherein, when one or both of said free slots (a) and (b) are respectively not within envelopes defined by ME and ML, VC[i] is allocated the free slot which, when assigned, will minimize the value of ME+ML.
23. The apparatus according to claim 22, wherein said slots have identical fixed time durations.
24. The apparatus according to claim 23, wherein said packets have a fixed length.
Priority Applications (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA002229577A CA2229577A1 (en) | 1998-02-12 | 1998-02-12 | Method and apparatus for controlling traffic flows in a packet-switched network in order to guarantee service performance |
| CA 2261012 CA2261012A1 (en) | 1998-02-12 | 1999-02-03 | Method and apparatus for controlling traffic flows in a packet-switched network |
| US09/244,165 US6353618B1 (en) | 1998-02-12 | 1999-02-04 | Method and apparatus for controlling traffic flows in a packet-switched network |
| EP99101763A EP0936834B1 (en) | 1998-02-12 | 1999-02-11 | Method and apparatus for controlling traffic flows in a packet-switched network |
| DE69912172T DE69912172T2 (en) | 1998-02-12 | 1999-02-11 | Method and device for controlling the traffic flows in a packet switching network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA002229577A CA2229577A1 (en) | 1998-02-12 | 1998-02-12 | Method and apparatus for controlling traffic flows in a packet-switched network in order to guarantee service performance |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2229577A1 true CA2229577A1 (en) | 1999-08-12 |
Family
ID=4162108
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002229577A Abandoned CA2229577A1 (en) | 1998-02-12 | 1998-02-12 | Method and apparatus for controlling traffic flows in a packet-switched network in order to guarantee service performance |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US6353618B1 (en) |
| EP (1) | EP0936834B1 (en) |
| CA (1) | CA2229577A1 (en) |
| DE (1) | DE69912172T2 (en) |
Families Citing this family (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6748451B2 (en) * | 1998-05-26 | 2004-06-08 | Dow Global Technologies Inc. | Distributed computing environment using real-time scheduling logic and time deterministic architecture |
| IL125273A (en) * | 1998-07-08 | 2006-08-20 | Marvell Israel Misl Ltd | Crossbar network switch |
| NL1010295C2 (en) * | 1998-10-12 | 2000-04-13 | Koninkl Kpn Nv | ATM Connection Admission Control body for DBR connections. |
| US6768717B1 (en) * | 1999-05-28 | 2004-07-27 | Network Equipment Technologies, Inc. | Apparatus and method for traffic shaping in a network switch |
| US6563792B1 (en) * | 1999-07-02 | 2003-05-13 | Accton Technology Corporation | Fuzzy leaky bucket method and apparatus for usage parameter control in ATM networks |
| US6765924B1 (en) * | 1999-08-19 | 2004-07-20 | Intel Corporation | Networking method and apparatus using silent slots to facilitate transmission collision detection |
| US7072817B1 (en) * | 1999-10-01 | 2006-07-04 | Stmicroelectronics Ltd. | Method of designing an initiator in an integrated circuit |
| WO2001035243A1 (en) * | 1999-11-08 | 2001-05-17 | Megaxess, Inc. | QUALITY OF SERVICE (QoS) NEGOTIATION PROCEDURE FOR MULTI-TRANSPORT PROTOCOL ACCESS FOR SUPPORTING MULTI-MEDIA APPLICATIONS WITH QoS ASSURANCE |
| EP1133109A1 (en) | 2000-03-07 | 2001-09-12 | Lucent Technologies Inc. | Radio telecommunications system with use of timeslots |
| US6466541B1 (en) * | 2000-05-31 | 2002-10-15 | Fujitsu Network Communications, Inc. | Cell pacing on a network link employing a rate-based flow control protocol with underlying credit-based flow control mechanisms |
| US20020110094A1 (en) * | 2001-02-13 | 2002-08-15 | Reddy Naveen S. | Spot beam hopping packet scheduler system |
| US7283556B2 (en) * | 2001-07-31 | 2007-10-16 | Nishan Systems, Inc. | Method and system for managing time division multiplexing (TDM) timeslots in a network switch |
| US6987753B2 (en) * | 2001-10-09 | 2006-01-17 | Alcatel Canada Inc | Apparatus and method for dynamic bandwidth allocation with minimum bandwidth guarantee |
| US7123625B2 (en) * | 2001-12-28 | 2006-10-17 | Allan Dennis Dufour | Method and apparatus for in-service dynamic allocation of bandwidth in a TDM network |
| US7073005B1 (en) | 2002-01-17 | 2006-07-04 | Juniper Networks, Inc. | Multiple concurrent dequeue arbiters |
| US20040037558A1 (en) * | 2002-08-20 | 2004-02-26 | Nortel Networks Limited | Modular high-capacity switch |
| US7307961B2 (en) * | 2002-09-25 | 2007-12-11 | At&T Knowledge Ventures, L.P. | Traffic modeling for packet data communications system dimensioning |
| US7260640B1 (en) * | 2003-02-13 | 2007-08-21 | Unisys Corproation | System and method for providing an enhanced enterprise streaming media server capacity and performance |
| US7339923B2 (en) * | 2003-10-31 | 2008-03-04 | Rivulet Communications, Inc. | Endpoint packet scheduling system |
| FR2875667A1 (en) * | 2004-09-22 | 2006-03-24 | France Telecom | PREEMPTION METHOD FOR MANAGING RADIO RESOURCES IN A MOBILE COMMUNICATION NETWORK |
| US7453885B2 (en) * | 2004-10-13 | 2008-11-18 | Rivulet Communications, Inc. | Network connection device |
| KR101737516B1 (en) * | 2010-11-24 | 2017-05-18 | 한국전자통신연구원 | Method and apparatus for packet scheduling based on allocating fair bandwidth |
| US8909462B2 (en) | 2011-07-07 | 2014-12-09 | International Business Machines Corporation | Context-based traffic flow control |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB9613473D0 (en) | 1996-06-27 | 1996-08-28 | Mitel Corp | ATM cell transmit priority allocator |
| US6064650A (en) * | 1996-06-27 | 2000-05-16 | Xerox Corporation | Rate shaping in per-flow output queued routing mechanisms having output links servicing multiple physical layers |
| US5953336A (en) | 1996-08-05 | 1999-09-14 | Virata Limited | Method and apparatus for source rate pacing in an ATM network |
-
1998
- 1998-02-12 CA CA002229577A patent/CA2229577A1/en not_active Abandoned
-
1999
- 1999-02-04 US US09/244,165 patent/US6353618B1/en not_active Expired - Lifetime
- 1999-02-11 EP EP99101763A patent/EP0936834B1/en not_active Expired - Lifetime
- 1999-02-11 DE DE69912172T patent/DE69912172T2/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| DE69912172D1 (en) | 2003-11-27 |
| DE69912172T2 (en) | 2004-07-01 |
| EP0936834B1 (en) | 2003-10-22 |
| US6353618B1 (en) | 2002-03-05 |
| EP0936834A3 (en) | 2000-10-11 |
| EP0936834A2 (en) | 1999-08-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2229577A1 (en) | Method and apparatus for controlling traffic flows in a packet-switched network in order to guarantee service performance | |
| EP0862299B1 (en) | Multi-class connection admission control method for asynchronous transfer mode (ATM) switches | |
| US5850399A (en) | Hierarchical packet scheduling method and apparatus | |
| US7046631B1 (en) | Method and apparatus for provisioning traffic dedicated cores in a connection oriented network | |
| US6459681B1 (en) | Method and system for connection admission control | |
| US6157654A (en) | Adaptive service weight assignments for ATM scheduling | |
| US5946297A (en) | Scheduling method and apparatus for supporting ATM connections having a guaranteed minimun bandwidth | |
| US6163542A (en) | Virtual path shaping | |
| US5862126A (en) | Connection admission control for ATM networks | |
| US6452933B1 (en) | Fair queuing system with adaptive bandwidth redistribution | |
| US6240066B1 (en) | Dynamic bandwidth and buffer management algorithm for multi-service ATM switches | |
| US6134217A (en) | Traffic scheduling system and method for packet-switched networks with fairness and low latency | |
| US6438106B1 (en) | Inter-class schedulers utilizing statistical priority guaranteed queuing and generic cell-rate algorithm priority guaranteed queuing | |
| US6175554B1 (en) | Asynchronous transfer mode (ATM) traffic control apparatus and control method for handling a wide variety of ATM services | |
| US6023453A (en) | System and method employing last occurrence and sliding window technique for determining minimum and maximum values | |
| EP0748086A1 (en) | Method for scheduling message cells leaving an ATM node | |
| US6990115B2 (en) | Queue control method and system | |
| US6917590B1 (en) | Method and system for connection admission control | |
| Matsufuru et al. | Efficient fair queueing for ATM networks using uniform round robin | |
| US6560195B1 (en) | Method and apparatus for leaky bucket based out-bound shaping in an ATM scheduler | |
| EP1171816B1 (en) | System and method employing last occurrence and sliding window technique for determining a minimum and maximum value | |
| Hall et al. | Satisfying QoS with a learning based scheduling algorithm | |
| Lee et al. | Improved dynamic weighted cell scheduling algorithm based on Earliest Deadline First scheme for various traffics of ATM switch | |
| Roginsky et al. | Analysis of ATM cell loss for systems with on/off traffic sources | |
| Lee et al. | Model and performance evaluation for multiservice network link supporting ABR and CBR services |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |