Abstract
Search for optimal routing (in the game-theoretical sense) in a packet data transmission network is considered. The proposed method reduces the general problem to a particular problem of routing in ring networks. A fast parallel (distributed) algorithm is constructed, which may be used in network-level data transmission protocols.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Bertsekas and R. Gallager. Data Transmission Networks [Russian translation], Nauka, Moscow (1989).
N. S. Vasil'ev and V. V. Fedorov, “Equilibrium routing in data transmission networks,” Vestnik MGU, ser. 15, Vychisl. Matem. i Kibern, No. 2, 47–52 (1996).
N. N. Vorob'ev, Noncooperative Games [in Russian], Nauka, Moscow (1984).
N. S. Vasil'ev, “Noncomplementarity of equilibrium routing in ring networks,” Zh. Vychisl. Matem. i Mat. Fiziki,35, No. 5, 794–801 (1995).
N. S. Vasil'ev, “Search for the fixed point of a consistently monotone mapping,” Zh. Vychisl. Matem. i. Mat. Fiziki,36, No. 12, 39–47 (1996).
N. S. Vasil'ev, “Properties of solutions of the routing problem for a network with virtual channels,” Zh. Vychisl. Matem. i Mat. Fiziki,37, No. 7, 785–793 (1997).
N. S. Vasil'ev and V. V. Fedorov, “Constructing a distributted routing algorithm for a non-ring network,” Sbornik Nauchnykh Trudov IVVS RAN, No. 6, 35–42 (1997).
L. A. Skornyakov, Elements of General Algebra [in Russian], Nauka, Moscow (1983).
N. S. Vasil'ev, “Properties of solutions of the dynamic network routing problem,” Zh. Vychist. Matem. i Mat. Fiziki,38, No. 1, 42–53 (1998).
Y. A. Korilis, A. A. Lazar, and A. Orda, “Architecting nonecoperative networks,” IEEE J. Select. Areas Commun.,13, No. 7, 1241–1251 (1995).
Y. A. Korilis, A. A. Lazar, and A. Orda, “Capacity allocation under noncooperative routing,” IEEE Trans. Autom. Contr.,42, No. 3, 309–325 (1997).
V. V. Podinovskii and V. D. Nogin, Pareto-Optimal Solutions of Multi-Crite ion Problems [in Russian], Nauka, Moscow (1987).
N. S. Vasil'ev, “Consistency of Pareto- and Nash-optimality principles in transmission routing control problems for a ring network,” Zh. Vychisi, Matem. i. Mat. Fiziki,38, No. 4, 592–597 (1998).
M. Pike, Internet Sourcebook [Russian translation], BHV, St. Peterburg (1996).
H. Scarf, “The approximation of fixed points of a continuous mapping,” SIAM J. Appl. Math.,15, 1328–1343 (1967).
H. Nikaido and K. Isoda, Notes on Noncooperative Convex Games. Infinite Zero-Sum Games [Russian translation], Moscow (1963), pp. 449–458.
Additional information
Translated from Chislennye Metody i Vychislitel'nyi Eksperiment, Moscow State University, pp. 107–123, 1998.
Rights and permissions
About this article
Cite this article
Vasil'ev, N.S., Fedorov, V.V. Equilibrium routing strategies in data transmission networks. Comput Math Model 10, 413–425 (1999). https://doi.org/10.1007/BF02359091
Issue Date:
DOI: https://doi.org/10.1007/BF02359091