Statistical performance guarantees in large-scale cross-path packet switch

Authors:
Man Chi Chan;Tony T. Lee
Affiliations:
REnex Technology, Pak Shek Kok, Hong Kong;Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2003

Citing 9
Cited 0

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)
Performance and stability of communication networks via robust exponential bounds

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms

IEEE/ACM Transactions on Networking (TON)
Providing per-session deterministic quality of service guarantees in cross-path packet switch

Computer Networks: The International Journal of Computer and Telecommunications Networking - 01/14/2002
Performance and Complexity of Multicast Cross-Path ATM Switches

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Path switching-a quasi-static routing scheme for large-scale ATM packet switches

IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we develop a general framework for a novel switch architecture, the cross-path switch, to provide persession statistical quality of service (QoS) guarantees. With characterizing the service each session receives by service curves, we derive a set of statistical bounds on the delay, backlog, and departure processes at the switch on a per-session manner using exponential bounded burstiness processes as source session traffic models. These bounds show that the service guarantees offered by the cross-path switch depend on the way of token assignment in the central stage of the switch. To provide better performance guarantees,we determine the criteria for designing a token assignment algorithm for the cross-path switch. Also, we quantify the service guaranteed by the cross-path switch with the central stage implemented in optical domain, which is important for the provision of QoS guarantees to each session in semioptical networks.