Universal Bufferless Packet Switching
暂无分享,去创建一个
Marios Mavronicolas | Costas Busch | Malik Magdon-Ismail | M. Magdon-Ismail | M. Mavronicolas | C. Busch
[1] Friedhelm Meyer auf der Heide,et al. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks , 1995, ESA.
[2] Uriel Feige. Nonmonotonic phenomena in packet routing , 1999, STOC '99.
[3] Aravind Srinivasan,et al. A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria , 1997, STOC '97.
[4] Antonios Symvonis,et al. Lower bounds for hot-potato permutation routing on trees , 2000, SIROCCO.
[5] Shai Halevi,et al. Potential Function Analysis of Greedy Hot-Potato Routing , 1994, PODC '94.
[6] Antonios Symvonis,et al. Many-to-Many Routings on Trees via Matchings , 1997, Theor. Comput. Sci..
[7] Costas Busch,et al. Efficient Bufferless Routing on Leveled Networks , 2005, Euro-Par.
[8] Kumar N. Sivarajan,et al. Optical Networks: A Practical Perspective , 1998 .
[9] Ronald I. Greenberg,et al. Universal wormhole routing , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.
[10] Mikkel Thorup,et al. Direct routing on trees , 1998, SODA '98.
[11] Marios Mavronicolas,et al. Near-Optimal Hot-Potato Routing on Trees , 2004, Euro-Par.
[12] Paul G. Spirakis,et al. Pure Greedy Hot-Potato Routing in the 2-D Mesh with Random Destinations , 1997, Parallel Process. Lett..
[13] Pierre Fraigniaud,et al. Routing in Trees , 2001, ICALP.
[14] Christian Scheideler,et al. Universal Routing Strategies for Interconnection Networks , 1998, Lecture Notes in Computer Science.
[15] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[16] Arnold L. Rosenberg,et al. Scheduling Time-Constrained Communication in Linear Networks , 2002, SPAA '98.
[17] Rafail Ostrovsky,et al. Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.
[18] Yuval Rabani,et al. Distributed packet switching in arbitrary networks , 1996, STOC '96.
[19] Assaf Schuster,et al. Hot-Potato Algorithms for Permutation Routing , 1995, IEEE Trans. Parallel Distributed Syst..
[20] Baruch Schieber,et al. Fast deflection routing for packets and worms , 1993, PODC '93.
[21] Uriel Feige,et al. Exact analysis of hot-potato routing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[22] Allan Borodin,et al. Deterministic Many-to-Many Hot Potato Routing , 1997, IEEE Trans. Parallel Distributed Syst..
[23] Manfred Kunde,et al. A New Bound for Pure Greedy Hot Potato Routing , 2007, STACS.
[24] Christian Scheideler,et al. Locally efficient on-line strategies for routing packets along fixed paths , 1999, SODA '99.
[25] Noga Alon,et al. Routing Permutations on Graphs Via Matchings , 1994, SIAM J. Discret. Math..
[26] Aravind Srinivasan,et al. A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria , 2000, SIAM J. Comput..
[27] Paul G. Spirakis,et al. Direct routing: Algorithms and complexity , 2004, Algorithmica.
[28] Satish Rao,et al. Hot-potato routing on processor arrays , 1993, ACM Symposium on Parallelism in Algorithms and Architectures.
[29] Allan Borodin,et al. Routing, merging and sorting on parallel models of computation , 1982, STOC '82.
[30] Assaf Schuster,et al. Greedy hot-potato routing on the two-dimensional mesh , 1995, Distributed Computing.
[31] Maurice Herlihy,et al. Randomized greedy hot-potato routing , 2000, SODA '00.
[32] Friedhelm Meyer auf der Heide,et al. Universal algorithms for store-and-forward and wormhole routing , 1996, STOC '96.
[33] Arnold L. Rosenberg,et al. On Bufferless Routing of Variable Length Messages in Leveled Networks , 1996, IEEE Trans. Computers.
[34] Bruce E. Hajek,et al. Bounds on evacuation time for deflection routing , 1991, Distributed Computing.
[35] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[36] Bruce M. Maggs,et al. Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..
[37] P. Baran,et al. On Distributed Communications Networks , 1964 .
[38] Manya Ghobadi,et al. Optical Networks , 2000 .
[39] Rene L. Cruz,et al. Bounds on Maximum Delay in Networks with Deflection Routing , 1995, IEEE Trans. Parallel Distributed Syst..
[40] Louxin Zhang,et al. Optimal bounds for matching routing on trees , 1997, SODA '97.
[41] Rajmohan Rajaraman,et al. Time-Constrained Scheduling of Weighted Packets on Trees and Meshes , 2003, Algorithmica.
[42] Costas Busch,et al. Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks , 2002, SPAA '02.
[43] Maurice Herlihy,et al. Hard-Potato routing , 2000, STOC '00.
[44] Noga Alon,et al. Routing permutations on graphs via matchings , 1993, SIAM J. Discret. Math..
[45] Bruce M. Maggs,et al. Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..
[46] Bruce M. Maggs,et al. Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.
[47] Yossi Azar,et al. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[48] Friedhelm Meyer auf der Heide,et al. Shortest-Path Routing in Arbitrary Networks , 1999, J. Algorithms.
[49] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[50] Maurice Herlihy,et al. Routing without flow control , 2001, SPAA '01.
[51] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.