MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  RCSP and stop-and-go: A comparison of two non-work-conserving disciplines for supporting multimedia communication (1996) [3 citations — 1 self]

Download:
Download as a PDF | Download as a PS
by Hui Zhang, Edward W. Knightly
ACM Multimedia Systems Journal
http://www.ece.rice.edu/networks/papers/rcsp-sg.ps.gz
Add To MetaCart

Abstract:

To support emerging real-time applications, high speed integrated services networks need to provide end-to-end performance guarantees on a per-connection basis in a networking environment. In addition to the issue of how to allocate resources to meet diverse QOS requirements in a single switch, resource management algorithms also need to account for the fact that traffic may get burstier and burstier as it traverses the network due to complex interaction among packet streams at each switch. To address this problem, several non-work-conserving packet service disciplines have been proposed. A non-work-conserving server is one that may be idle even when there are packets available to be sent. By holding packets under certain conditions, non-work-conserving servers fully or partially reconstruct the traffic pattern of the original source inside the network, and prevents the traffic from becoming burstier. In this paper, we compare two non-work-conserving service disciplines: Stop-and-Go and Rate-Controlled Static Priority or RCSP. Stop-and-Go uses a multi-level framing strategy to allocate resources in a single switch and to ensure traffic smoothness throughout the network. RCSP decouples the server functions by having two components: a regulator to control traffic distortion introduced by multiplexing effects and load fluctuations in previous servers, and a static priority scheduler to multiplex the regulated traffic. We compare the two service disciplines in terms of traffic specification, scheduling mechanism, buffer space requirement, end-to-end delay characteristics, connection admission control algorithms, and achievable network utilization. The comparison is first done analytically, and then empirically by using two 10-minute traces of MPEG compressed video. 1

Citations

1409 A generalized processor sharing approach to flow control in integrated services network – Parekh - 1992
630 A scheme for real-time channel establishment in wide-area networks – Ferrari, Verma - 1990
546 MPEG: a video compression standard for multimedia applications – Gall - 1991
510 A Calculus for Network Delay, Part I: Network Elements in Isolation – Cruz - 1991
499 Virtual clock: A new traffic control algorithm for packet switching networks – Zhang - 1990
371 Queueing systems – Kleinrock - 1975
229 Client Requirements for Real-Time Communication Services – Ferrari - 1990
182 Comparison of rate-based service disciplines – Zhang, Keshav - 1991
174 Rate Controlled Servers for Very High-Speed Networks – Kalmanek, Kanakia, et al. - 1990
148 On computing per-session performance bounds in high-speed multi-hop computer networks – Kurose - 1992
143 Real-Time Communication in Multi-Hop Networks – Kandlur, Shin, et al. - 1994
138 Calendar Queues: A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem – Brown - 1988
138 Rate-controlled service disciplines – Zhang, Ferrari - 1994
117 Open Issues and Challenges in Providing Quality of Service Guarantees in High-Speed Networks – Kurose - 1993
101 Traffic characterization and switch utilization using a deterministic bounding interval dependent traffic model – Knightly, Zhang - 1995
99 A Stop-and-Go Queueing Framework for Congestion Management – Golestani - 1990
91 Guaranteeing Delay Jitter Bounds in Packet Switching Networks – Verma, Zhang, et al. - 1991
73 Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic – Knightly, Wrege, et al. - 1995
71 Rate-controlled static priority queueing – Zhang, Ferrari - 1993
62 Service burstiness and dynamic burstiness measures: A framework – Cruz - 1992
62 Congestion-free transmission of real-time traffic in packet networks – Golestani - 1990
59 Improving utilization for deterministic service in multimedia communication – Zhang, Ferrari - 1994
59 Providing end-to-end statistical performance guarantee with bounding interval dependent stochastic models – Zhang, Knightly - 1994
46 Advances in Real-time systems – Stankovic, Ramamritham - 1993
44 Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks – Golestani - 1991
40 Local allocation of end-to-end quality-of-service in high-speed networks – Nagarajan, Kurose, et al. - 1993
38 Xunet 2: A Nationwide Testbed in High-Speed Networking – Fraser, Kalmanek, et al. - 1992
32 Guaranteed Performance Communication in High Speed Networks – Verma - 1991
25 Designing a practical ATM – Biagioni, Cooper, et al. - 1993
24 Isochronous applications do not require jitter-controlled networks – Partridge - 1991
21 Service Disciplines for Integrated Services Packet-Switching Networks – Zhang - 1993
15 Queueing delays in rate controlled networks – Banerjea, Keshav - 1993
8 New directions in communications(or which way to the information age – Turner - 1986
7 A high performance queueing engine for ATM networks – Kalmanek, Morgan, et al. - 1992
7 Traffic Control in ATM Networks – Low - 1992