Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul Spirakis  Home/Search
Context
Related
| rpi.edu/~buschc/papers/direct.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu/~buschc/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Direct routing is the special case of bu#erless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three facets of direct routing: (i) Algorithms. We present a polynomial time greedy algorithm for arbitrary direct routing problems whch is worst-case optimal, i.e., there exist instances for which no direct routing algorithm is better than the greedy. We apply variants of this... (Update)
Active bibliography (related documents): More All
1.0: Direct Routing: Algorithms and Complexity - Busch, Magdon-Ismail.. (2004) (Correct)
0.5: Universal Bufferless Routing - Busch, Magdon-Ismail, Mavronicolas (2004) (Correct)
0.5: Discovering Hidden Groups in Communication Networks - Baumes, Goldberg.. (2004) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ busch-direct,
author = "Costas Busch and Malik Magdon-Ismail and Marios Mavronicolas and Paul Spirakis",
title = "Direct Routing: Algorithms and Complexity",
url = "citeseer.ist.psu.edu/751147.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
318 Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1997
145 Universal schemes for parallel communication (context) - Valiant, Brebner - 1981
134 A scheme for fast parallel communication (context) - Valiant - 1982
98 Zero knowledge and the chromatic number - Feige, Kilian - 1996
58 local control packet switching algorithms (context) - Ostrovsky, Rabani et al. - 1997
53 Fast algorithms for finding O (context) - Leighton, Maggs et al. - 1999
25 Exploiting locality for data management in systems of limite.. - Maggs, Meyer et al. - 1997
21 Shortest-path routing in arbitrary networks - der Heide, Vocking - 1999
19 Hard-potato routing - Busch, Herlihy et al. - 2000
18 Direct routing on trees (context) - Alstrup, Holm et al. - 1998
16 Scheduling time-constrained communication in linear networks - Adler, Rosenberg et al. - 1998
14 Routing with bounded bu#ers and hot-potato routing in vertex.. (context) - der Heide, Scheideler - 1995
12 Information Processing Letters (context) - Symvonis - 1996
8 Time-constrained scheduling of weighted packets on trees and.. - Adler, Khanna et al. - 1999
2 New york edn (context) - Bollobas - 2001
2 A lower bound for nearly minimal adaptive and hot potato alg.. (context) - Ben-Aroya, Chinn et al. - 1998
1 Graham: Routing permutations on graphs via matching (context) - Alon, Chung - 1994
1 Direct Routing: Algorithms and Complexity i A Algorithms for.. (context) - Motwani, Raghavan - 2000
Documents on the same site (http://www.cs.rpi.edu/~buschc/papers.html): More
Analysis of Link Reversal Routing Algorithms for.. - Busch, Surapaneni.. (2003) (Correct)
The Cost of Concurrent, Low-Contention Read-Modify-Write - Busch, Mavronicolas, Spirakis (Correct)
Atomic Routing Games on Maximum Congestion - Busch, Magdon-Ismail (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC