Direct Routing: Algorithms and Complexity

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis

Abstract

Direct routing is the special case of bufferless 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:
BibTeX
@inproceedings{busch2004direct,
  author = {Costas Busch and Malik Magdon-Ismail and Marios Mavronicolas and Paul G. Spirakis},
  title = {{Direct Routing: Algorithms and Complexity}},
  booktitle = {ESA},
  year = {2004},
  doi = {10.1007/978-3-540-30140-0\_14},
}

Loading related content...

Figure