Characterizing Traffic Behavior and Providing End-to-End Service Guarantees within ATM Networks

Authors:
C-S. Wu;J-C. Jiau;K-J. Chen
Affiliations:
-;-;-
Venue:
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Year:
1997

Citing 8
Cited 2

VirtualClock: a new traffic control algorithm for packet-switched networks

ACM Transactions on Computer Systems (TOCS)
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirements

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Open issues and challenges in providing quality of service guarantees in high-speed networks

ACM SIGCOMM Computer Communication Review
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
An upper bound on delay for the VirtualClock service discipline

IEEE/ACM Transactions on Networking (TON)
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Network delay analysis of a class of fair queueing algorithms

IEEE Journal on Selected Areas in Communications

Jitter control in QoS networks

IEEE/ACM Transactions on Networking (TON)
Overall Blocking Behavior Analysis of General Banyan-Based Optical Switching Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a rate-controlled service discipline for supporting B-ISDN services. According to our approach, traffic streams from different connections can be well regulated at the output of each node based on their rate requirements. Moreover, the traffic envelope of a connection inside the network can be effectively characterized. By assuming a leaky-bucket constrained input source, we further prove that the proposed scheme can provide end-to-end delay and jitter bounds for each connection passing through a multi-hop network. Finally, we make a comparison of related works and show the effectiveness of our algorithm.