Distributed packet switching in arbitrary networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 366-375

  Rabani, Yuval ^a   Tardos, Éva ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PACKET NETWORKS; ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBABILITY; QUEUEING THEORY; SCHEDULING; TELECOMMUNICATION NETWORKS;

ARBITRARY NETWORKS; CENTRALIZED ALGORITHMS; HIGH PROBABILITY; MAXIMUM DISTANCE; PACKET REACHES; PACKET SCHEDULING; RANDOMIZED ALGORITHMS; SCHEDULED PACKETS;

PACKET SWITCHING;

BURSTY COMMUNICATION; PACKET ROUTING; PACKET TRAFFIC;

EID: 0029712047     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237983     Document Type: Conference Paper

References (14)

1. A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan. Priority encoding transmission. In Proc. 35th Ann. IEEE Symp. on Foundations of Computer Science, November 1994, pages 604-612.
2. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, 1992.
3. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. On-line load balancing with applications to machine scheduling and virtual circuit routing. In Proc. of the 23rd Ann. ACM Symp. on Theory of Computing, San Diego, May 1993.
4. B. Awerbuch, Y. Azar, and S. Plotkin. Throughput competitive on-line routing. In Proc. of the 34th Ann. Symp. on Foundations of Computer Science, Palo Alto, November 1993.
5. J. Beck. An algorithmic approach to the Lovász Local Lemma. Random Structures and Algorithms, 2(4):367-378, 1991.
6. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queueing theory. In these proceedings.
7. R. L. Brooks. On colouring the nodes of a network. Proc. Cambridge Philos. Soc., 37:194-197, 1941.
8. P. Erdos and L. Lovász. Problems and results on 3-chromatic hypergraphs and some related questions. In A. Hajnal et al., eds., Infinite and Finite Sets. North Holland, 1975, pages 609-628.
9. R. Gawlick, A. Kamath, S. Plotkin, and K. Ramakrishnan. Routing and admission control in general topology networks. Technical report no. STAN-CS-TR-95-1548, Stanford University, 1995.
10. F. T. Leighton. Methods for message routing in parallel machines. In Proc. of the 24th Ann. ACM Symp. on the Theory of Computing, May 1992, pages 77-96.
11. F. T. Leighton and B. M. Maggs. Fast algorithms for finding O (congestion + dilation) packet routing schedules. In Proc. of the 28th Hawaii International Conference on System Sciences, January 1995, vol 2, pages 555-563.
12. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-shop scheduling in O (congestion + dilation) steps. Combinatorica, 14(2):167-186, 1994.
13. F. T. Leighton, B. M. Maggs, A. G. Ranade, and S. B. Rao. Randomized routing and sorting on fixedconnection networks. J. Alg., 17(1):157-205, 1994.
14. J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, 1987.