R. Hinden, J. Haverty, and A. Sheltzer, "The DARPA Internet: Interconnecting heterogeneous computer networks with gateways," Comput., vol. 16, pp. 38-48, Sept. 1983.]]

Google Scholar

[7]

D. Clark, "Policy routing in intemet protocols," Tech. Rep. RFC 1102, DDN Netw. Inform. Cent., Menlo Park, CA, May 1989.]]

Crossref

Google Scholar

[8]

M. S. J. Kurose and Y. Yemini, "A microeconomic approach to optimization of channel access policies in multiaccess networks," in Proc. Fifth Int. Conf. Distrib. Comput. Syst., Denver, CO, May 1985, pp. 70-80.]]

Google Scholar

[9]

D. Ferguson, C. Nikolaou, and Y. Yemini, "An economy for flow control in computer networks," in Proc. INFOCOM'89, 1989, pp. ! 10-118.]]

Google Scholar

[10]

A. Bovopoulos and A. Lazar, "Synchronous and asynchronous iterative algorithms for optimal load balancing," in Proc. 22nd Conf. Inform. Sci. and Syst., Princeton, NJ, Mar. 1988, pp. 1051-1057.]]

Google Scholar

[11]

M. Hsiao and A. Lazar, "Optimal decentralized flow control of Markovian queueing networks with multiple controllers," Perform. Eval., vol. 13, pp. 181-204, 1991.]]

Crossref

Google Scholar

[12]

Z. Zhang and C. Douligeris, "Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment,'' IEEE Trans. Commun., vol. 40, pp. 1277-1281, Aug. 1992.]]

Google Scholar

[13]

R. Mazumdar, L. Mason, and C. Douligeris, "Fairness in network optimal flow control: Optimality of product forms," IEEE Trans. Commun., vol. 39, pp. 775-782, May 1991.]]

Google Scholar

[14]

S. Shenker, "Efficient network allocations with selfish users," in Proc. Perform. '90, Edinburgh, Scotland, North Holland, Sept. 1990, pp. 279-285.]]

Crossref

Google Scholar

[15]

S. Shenker, "Making greed work on networks: A game-theoretic analysis of gateway service disciplines," in Proc. ACM Sigmetrics Conf. Measure. and Model. of Comput. Syst., May 1990, pp. 241-242.]]

Crossref

Google Scholar

[16]

H. Lee and M. Cohen, "Multi-agent customer allocation in a stochastic service system," Manage. Sci., vol. 31, pp. 752-763, June 1985.]]

Google Scholar

[17]

A. A. Economides and J. A. Silvester, "Multi-objective routing in integrated Ervices networks: A game theory approach," in Proc. IN- FOCOM'91, pp. 1220-1225.]]

Google Scholar

[18]

S. C. Dafermos and F. T. Sparrow. "The traffic assignment problem for a general network," J Res. NBS (B), vol. 73B, pp. 91-118, Apr./June 1969.]]

Google Scholar

[19]

I. Rosen, "Existence and uniqueness of equilibrium points for concave n-person games," Econometrica, vol. 33, pp. 520-534, July 1965.]]

Google Scholar

[20]

S. Li and T. Basar, "Distributed algorithms for the computation of noncooperative equilibria," Automatica, vol. 23, no. 4, pp. 523-533, 1987.]]

Crossref

Google Scholar

[21]

M.G.L. Fratta and L. Kleinrock, "The flow deviation method: An approach to store and forward communication network design," Networks, vol. 3, pp. 97-133, 1973.]]

Google Scholar

[22]

R. G. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Trans. Commun., vol. COM-25, pp. 73-85, 1977.]]

Google Scholar

[23]

D. Bertsekas and R. Gallager, Data Nem'orks. Englewood Cliffs, NJ: Prentice Hall, 1987.]]

Crossref

Google Scholar

[24]

L. Kleinrock, Queueing Systems. New York: Wiley, 1975.]]

Crossref

Google Scholar

Cited By

View all

Hao BMichini C(2024)Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structureACM Transactions on Economics and Computation10.1145/366559012:3(1-30)Online publication date: 6-Sep-2024
https://dl.acm.org/doi/10.1145/3665590
Mancuso VBadia LCastagno PSereno MAjmone Marsan M(2024)Effectiveness of distributed stateless network server selection under strict latency constraintsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110558251:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.comnet.2024.110558
Hao BMichini C(2024)The price of Anarchy in series-parallel network congestion gamesMathematical Programming: Series A and B10.1007/s10107-022-01803-w203:1-2(499-529)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s10107-022-01803-w
Show More Cited By

Index Terms

Competitive routing in multiuser communication networks

Recommendations

Routing and capacity assignment in backbone communication networks
ROUTING NETWORKS FOR PACKET COMMUNICATION SYSTEMS
Dynamics of hot-potato routing in IP networks

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 1, Issue 5

Oct. 1993

106 pages

ISSN:1063-6692

Editor:
Jim Kurose
Univ. of Massechusetts, Amherst

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 October 1993

Published in TON Volume 1, Issue 5

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

155
Total Citations
View Citations
1,252
Total Downloads

Downloads (Last 12 months)38
Downloads (Last 6 weeks)6

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hao BMichini C(2024)Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structureACM Transactions on Economics and Computation10.1145/366559012:3(1-30)Online publication date: 6-Sep-2024
https://dl.acm.org/doi/10.1145/3665590
Mancuso VBadia LCastagno PSereno MAjmone Marsan M(2024)Effectiveness of distributed stateless network server selection under strict latency constraintsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110558251:COnline publication date: 1-Sep-2024
https://dl.acm.org/doi/10.1016/j.comnet.2024.110558
Hao BMichini C(2024)The price of Anarchy in series-parallel network congestion gamesMathematical Programming: Series A and B10.1007/s10107-022-01803-w203:1-2(499-529)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1007/s10107-022-01803-w
Mancuso VCastagno PBadia LSereno MAjmone Marsan M(2024)Optimal Allocation of Tasks to Networked Computing FacilitiesAnalytical and Stochastic Modelling Techniques and Applications10.1007/978-3-031-70753-7_3(33-50)Online publication date: 14-Jun-2024
https://dl.acm.org/doi/10.1007/978-3-031-70753-7_3
Sakos IVlatakis-Gkaragkounis EMertikopoulos PPiliouras GOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Exploiting hidden structures in non-convex games for convergence to nash equilibriumProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3669048(66979-67006)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3669048
Liu KOudjane NWan C(2023)Approximate Nash Equilibria in Large Nonconvex Aggregative GamesMathematics of Operations Research10.1287/moor.2022.132148:3(1791-1809)Online publication date: 1-Aug-2023
https://dl.acm.org/doi/10.1287/moor.2022.1321
Datar MAltman ECadre H(2023)Strategic Resource Pricing and Allocation in a 5G Network Slicing Stackelberg GameIEEE Transactions on Network and Service Management10.1109/TNSM.2022.321658820:1(502-520)Online publication date: 1-Mar-2023
https://dl.acm.org/doi/10.1109/TNSM.2022.3216588
Fabiani FFranci B(2023)On Distributionally Robust Generalized Nash Games Defined over the Wasserstein BallJournal of Optimization Theory and Applications10.1007/s10957-023-02284-3199:1(298-309)Online publication date: 25-Aug-2023
https://dl.acm.org/doi/10.1007/s10957-023-02284-3
Allen SGabriel SDickerson J(2022)Using inverse optimization to learn cost functions in generalized Nash gamesComputers and Operations Research10.1016/j.cor.2022.105721142:COnline publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1016/j.cor.2022.105721
Harks TTimmermans V(2022)Equilibrium computation in resource allocation gamesMathematical Programming: Series A and B10.1007/s10107-020-01604-z194:1-2(1-34)Online publication date: 1-Jul-2022
https://dl.acm.org/doi/10.1007/s10107-020-01604-z
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Routing and capacity assignment in backbone communication networks

ROUTING NETWORKS FOR PACKET COMMUNICATION SYSTEMS

Dynamics of hot-potato routing in IP networks

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations