|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Yossi Azar, Joseph (Seffi) Naor, Raphael Rom, "Routing Strategies for Fast Networks," IEEE Transactions on Computers, vol. 45, no. 2, pp. 165-173, February, 1996. | |||
| BibTex | x | ||
| @article{ 10.1109/12.485380, author = {Yossi Azar and Joseph (Seffi) Naor and Raphael Rom}, title = {Routing Strategies for Fast Networks}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {2}, issn = {0018-9340}, year = {1996}, pages = {165-173}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.485380}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Routing Strategies for Fast Networks IS - 2 SN - 0018-9340 SP165 EP173 EPD - 165-173 A1 - Yossi Azar, A1 - Joseph (Seffi) Naor, A1 - Raphael Rom, PY - 1996 KW - Routing strategies KW - controlled flooding KW - network resources KW - load balancing KW - shortest paths KW - bfs trees KW - conditional probabilities. VL - 45 JA - IEEE Transactions on Computers ER - | |||
Abstract—Modern fast packet switching networks are being forced to rethink the routing schemes that are used in more traditional networks. The reexamination is necessitated because in these fast networks switches on the message's route can afford to make only minimal and simple operations. For example, examining a table of a size proportional to the network size is out of the question. In this paper we examine routing strategies for such networks based on flooding and predefined routes. Our concern is to get both efficient routing and an even (balanced) use of network resources. We present efficient algorithms for assigning weights to edges in a controlled flooding scheme but show that the flooding scheme is not likely to yield a balanced use of the resources. We then present efficient algorithms for choosing routes along: 1) bfs trees and 2) shortest paths. We show that in both cases a balanced use of network resources can be guaranteed.
[1] A. Ephremides, "The routing problem in computer networks," I. Blake and H. Poor, eds., Communications and Networks.New York: Springer Verlag, pp. 299-324, 1986.
[2] M. Schwartz and T. Stern, “Routing Techniques Used in Computer Communications Networks,” IEEE Trans. Comm., vol. 28, no. 4, April 1980.
[3] P. Green, "Computer communications: Milestones and prophecies," IEEE Communications, pp. 49-63, 1984.
[4] I. Cidon and I. Gopal, "Paris: An approach to integrated high-speed private networks," Int'l J. Digital and Analog Cabled Systems, vol. 1, pp. 77-86, Apr.-June 1988.
[5] J. Turner, “Design of a Broadcast Packet Switching Network,” IEEE Trans. Comm., vol. 36, no. 6, pp. 734-743, 1988.
[6] H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing. Lexington Books, 1985.
[7] L. Fratta, M. Gerla, and L. Kleinrock, "The flow deviation method: An approach to store and forward communication network design," Networks, vol. 3, no. 2, pp. 97-133, 1973.
[8] R.G. Gallager, “A Minimum Delay Routing Algorithms Using Distributed Computation,” IEEE Trans. Comm., vol. 25, no. 1, Jan. 1977.
[9] O. Lesser and R. Rom, "Routing by controlled flooding in communication networks," Proc. IEEE Infocom '90,San Francisco, Calif., pp. 910-917, June 1990.
[10] K. Mulmuley, U. Vazirani, and V. Vazirani, "Matching is as easy as matrix inversion," Combinatorica, vol. 7, no. 1, pp. 105-113, 1987.
[11] J. Hopcroft and R. Karp, "An n5/2algorithm for maximum matching in bipartite graphs," Siam J. Computing, vol. 2, pp. 225-231, 1973.
[12] S. Even,Graph Algorithms. Pitman Publishing, 1979.
[13] M. Garey and D. Johnson, Computers and Intractability.San Francisco: W.H. Freeman and Company, 1979.
[14] D. Angluin and L.G. Valiant, "Fast probabilistic algorithms for Hamiltonian circuits and matchings," J. Computer and System Sciences, vol. 18, pp. 155-193, 1979.
[15] J. Spencer, Ten Lectures on the Probabilistic Method.Philadelphia: SIAM, 1987.
[16] P. Raghavan, "Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs," J. Computer and System Sciences, vol. 37, pp. 130-143, 1988.