On queuing lengths in on-line switching

Theoretical Computer Science

Volumn 339, Issue 2-3, 2005, Pages 333-343

  Damaschke, Peter ^a   Zhou, Zhen ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Online switching; Parameterized competitive ratio; Queuing

Indexed keywords

ONLINE SYSTEMS; PACKET NETWORKS; PARAMETER ESTIMATION; PROBLEM SOLVING; QUEUEING NETWORKS; SET THEORY;

ONLINE SWITCHING; OPEN PROBLEMS; PARAMETERIZED COMPETITIVE RATIO; QUEUING LENGTH;

SWITCHING SYSTEMS;

EID: 18544371975     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.03.025     Document Type: Article

References (12)

1. T. Anderson, S. Owicki, J. Saxe, and C. Thacker High-speed switch scheduling for local area networks ACM Trans. on Comput. Systems 11 4 1993 319 352
2. A. Bar-Noy, A. Freund, S. Landa, and J. Naor Competitive on-line switching policies Algorithmica 36 2003 225 247
3. A. Borodin, and R. El-Yaniv Online Computation and Competitive Analysis 1998 Cambridge University Press Cambridge
4. P.F. Dietz, D.D. Sleator, Two algorithms for maintaining order in a list, 19th ACM Symp. on Theory of Computing STOC'87, pp. 365-372.
5. R. Fleischer, and H. Koga Balanced scheduling toward loss-free packet queuing and delay fairness Algorithmica 38 2004 363 376
6. M.G. Hluchyj, and M.J. Karol Queueing in high-performance packet switching IEEE Selected Areas Commun. 6 9 1988 1587 1597
7. M.J. Karol, M.G. Hluchyj, and S.P. Morgan Input versus output queueing on a space-division packet switch IEEE Trans. Commun. 35 12 1987 1347 1356
8. E. Leonardi, M. Mellia, F. Neri, and M.A. Marsan Bounds on delays and queue lengths in input-queued cell switches J. ACM 50 4 2003 520 550
9. N. McKeown, V. Anantharam, J. Walrand, Achieving 100% throughput in an input-queued switch, in: INFOCOM'96, pp. 296-302.
10. A. Mekkittikul, N. McKeown, Scheduling VOQ switches under non-uniform traffic, Technical Rep. CSL-TR-97-747, Stanford University, 1997.
11. J. von Neumann, and O. Morgenstern Theory of Games and Economic Behavior first ed. 1944 Princeton University Press Princeton, NJ
12. A.C. Yao, Probabilistic computations: toward a unified measure of complexity, in: 18th IEEE Symp. on Foundations of Computer Science, FOCS'77, pp. 222-227.