A note on models for non-probabilistic analysis of packet switching networks

Information Processing Letters

Volumn 84, Issue 5, 2002, Pages 237-240

  Rosén, Adi ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Packet switching network; Scheduling

Indexed keywords

DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; PACKET SWITCHING; SCHEDULING; SET THEORY;

PACKET SWITCHING NETWORKS;

PACKET NETWORKS;

EID: 0037121494     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00312-5     Document Type: Article

References (8)

1. Aiello W., Kushilevitz E., Ostrovsky R., Rosén A. Adaptive packet routing for bursty adversarial traffic. J. Comput. System Sci. 60:(3):2000;482-509.
2. Andrews M., Awerbuch B., Fernández A., Kleinberg J., Leighton T., Liu Z. Universal stability results for greedy contention-resolution protocols. J. ACM. 48:(1):2001;39-69.
3. Andrews M., Zhang L. The effect of temporary sessions on network performance. Proc. of the 11th SODA. 2000;448-457.
4. Awerbuch B., Berenbrink P., Brinkmann A., Scheideler C. Simple routing strategies for adversarial systems. Proc. of the 42nd IEEE Symposium on Foundations of Computer Science. 2001;158-167.
5. Borodin A., Kleinberg J., Raghavan P., Sudan M., Wiliamson D. Adversarial queuing theory. J. ACM. 48:(1):2001;13-38.
6. Gamarnik D. Stability of adversarial queues via fluid model. Proc. of the 39th FOCS. 1998;60-70.
7. Gamarnik D. Stability of adaptive and non-adaptive packet routing policies in adversarial queuing networks. Proc. of the 31st STOC. 1999;206-214.
8. Gamarnik D. Stability of adaptive and non-adaptive packet routing policies in adversarial queuing networks, Manuscript. 2000.