Static and dynamic low-congested interval routing schemes-Reference-Cited by-同舟云学术

Static and dynamic low-congested interval routing schemes

Published:1998 Issue: Volume: Page:592-603
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Cicerone Serafino,Di Stefano Gabriele,Flammini Michele

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0055087

Reference25 articles.

1. E. Bakker, J. van Leeuwen, and R.B. Tan. Linear interval routing. Algorithms Review, 2(2):45–61, 1991.

2. F.R.K. Chung, E.G. Coffman, M.I. Reiman, and D.E. Simon. The forwarding index of communication networks. IEEE Trans. on Inform. Theory, 33:224–232, 1987.

3. S. Cicerone, G. Di Stefano, and M. Flammini. Low-congested interval routing schemes. Technical Report R.97-20, Dipartimento di Ingegneria Elettrica, Università di L'Aquila (L'Aquila, Italy), 1997.

4. R. Cypher, F. Meyer auf der Heide, C. Scheideier, and B. Vöcking. Universal algorithms for store-and-forward and wormhole routing. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 356–305, Philadelphia, Pennsylvania, 22–24 May 1996.

5. T. Eilatn, S. Moran, and S. Zaks. The complexity of characterization of networks supporting shortest-path interval routing. In 4th Colloquium on Structural Information and Communication Complexity (SIROCCO). Carleton University Press, 1997.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Static and dynamic low-congested interval routing schemes;Theoretical Computer Science;2002-04

2. A survey on interval routing;Theoretical Computer Science;2000-08

3. Low-congested interval routing schemes for hypercubelike networks;Networks;2000

4. Efficient Communication Schemes;SOFSEM’ 98: Theory and Practice of Informatics;1998