메뉴 건너뛰기




Volumn 1, Issue 5, 1993, Pages 510-521

Competitive Routing in Multiuser Communication Networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; CONTROL SYSTEMS; GATEWAYS (COMPUTER NETWORKS); LOCAL AREA NETWORKS; NETWORK PROTOCOLS;

EID: 0027684575     PISSN: 10636692     EISSN: 15582566     Source Type: Journal    
DOI: 10.1109/90.251910     Document Type: Article
Times cited : (443)

References (24)
  • 2
    • 0025246457 scopus 로고
    • Network interconnection and gateways
    • C. Sunshine, “Network interconnection and gateways,” IEEE J. Select. Areas Commun., Vol. 8, pp. 4—11, 1990.
    • (1990) IEEE J. Select. Areas Commun , vol.8 , pp. 4-11
    • Sunshine, C.1
  • 5
    • 0019585253 scopus 로고
    • The ARPA Internet protocol
    • J. Postel, C. Sunshine, and D. Cohen, “The ARPA Internet protocol,” Comput. Netw., vol. 5, pp. 261–271, 1981.
    • (1981) Comput. Netw , vol.5 , pp. 261-271
    • Postel, J.1    Sunshine, C.2    Cohen, D.3
  • 6
    • 84939747301 scopus 로고
    • The DARPA Internet: Interconnecting heterogeneous computer networks with gateways
    • Sept.
    • R. Hinden, J. Haverty, and A. Sheltzer, “The DARPA Internet: Interconnecting heterogeneous computer networks with gateways,” Comput., Vol. 16, pp. 38–48, Sept. 1983.
    • (1983) Comput , vol.16 , pp. 38-48
    • Hinden, R.1    Haverty, J.2    Sheltzer, A.3
  • 7
    • 0003639291 scopus 로고
    • Policy routing in internet protocols
    • DDN Netw. Inform. Cent., Menlo Park, CA, May
    • D. Clark, “Policy routing in internet protocols,” Tech. Rep. RFC 1102, DDN Netw. Inform. Cent., Menlo Park, CA, May 1989.
    • (1989) Tech. Rep. RFC 1102
    • Clark, D.1
  • 8
    • 11344284273 scopus 로고
    • A microeconomic approach to optimization of channel access policies in multiaccess networks
    • Denver, CO, May
    • 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.
    • (1985) Proc. Fifth Int. Conf. Distrib. Comput. Syst , pp. 70-80
    • Kurose, M.S.J.1    Yemini, Y.2
  • 9
    • 0024646581 scopus 로고
    • An economy for flow control in computer networks
    • D. Ferguson, C. Nikolaou, and Y. Yemini, “An economy for flow control in computer networks,” in Proc. INFOCOM'89, 1989, pp. 110-118.
    • (1989) Proc. INFOCOM'89 , pp. 110-118
    • Ferguson, D.1    Nikolaou, C.2    Yemini, Y.3
  • 10
    • 0006702333 scopus 로고
    • Synchronous and asynchronous iterative algorithms for optimal load balancing
    • Princeton, NJ, Mar.
    • 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.
    • (1988) Proc. 22nd Conf. Inform. Sci. and Syst , pp. 1051-1057
    • Bovopoulos, A.1    Lazar, A.2
  • 11
    • 0026260718 scopus 로고
    • Optimal decentralized flow control of Markov-ian queueing networks with multiple controllers
    • M. Hsiao and A. Lazar, “Optimal decentralized flow control of Markov-ian queueing networks with multiple controllers,” Perform. Eval, vol. 13, pp. 181–204, 1991.
    • (1991) Perform. Eval , vol.13 , pp. 181-204
    • Hsiao, M.1    Lazar, A.2
  • 12
    • 0026908078 scopus 로고
    • Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment
    • Aug.
    • 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.
    • (1992) IEEE Trans. Commun , vol.40 , pp. 1277-1281
    • Zhang, Z.1    Douligeris, C.2
  • 13
    • 0026152522 scopus 로고
    • Fairness in network optimal flow control: Optimality of product forms
    • May
    • 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.
    • (1991) IEEE Trans. Commun , vol.39 , pp. 775-782
    • Mazumdar, R.1    Mason, L.2    Douligeris, C.3
  • 14
    • 0002638317 scopus 로고
    • Efficient network allocations with selfish users
    • Edinburgh, Scotland, North Holland, Sept.
    • S. Shenker, “Efficient network allocations with selfish users,” in Proc. Perform. '90, Edinburgh, Scotland, North Holland, Sept. 1990, pp. 279-285.
    • (1990) Proc. Perform. '90 , pp. 279-285
    • Shenker, S.1
  • 15
    • 0025546303 scopus 로고
    • Making greed work on networks: A game-theoretic analysis of gateway service disciplines
    • May
    • 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.
    • (1990) Proc. ACM Sigmetrics Conf. Measure. and Model. of Comput. Syst , pp. 241-242
    • Shenker, S.1
  • 16
    • 0022077343 scopus 로고
    • Multi-agent customer allocation in a stochastic service system
    • June
    • H. Lee and M. Cohen, “Multi-agent customer allocation in a stochastic service system,” Manage. Sci., Vol. 31, pp. 752-763, June 1985.
    • (1985) Manage. Sci , vol.31 , pp. 752-763
    • Lee, H.1    Cohen, M.2
  • 17
    • 0025858057 scopus 로고    scopus 로고
    • Multi-objective routing in integrated Ervices networks: A game theory approach
    • 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.
    • Proc. IN-FOCOM'91 , pp. 1220-1225
    • Economides, A.A.1    Silvester, J.A.2
  • 18
    • 0014491807 scopus 로고
    • The traffic assignment problem for a general network
    • Apr./June
    • 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.
    • (1969) J. Res. NBS (B) , vol.73B , pp. 91-118
    • Dafermos, S.C.1    Sparrow, F.T.2
  • 19
    • 0000579136 scopus 로고
    • Existence and uniqueness of equilibrium points for concave n-person games
    • July
    • J. Rosen, “Existence and uniqueness of equilibrium points for concave n-person games,” Econometrica, Vol. 33, pp. 520-534, July 1965.
    • (1965) Econometrica , vol.33 , pp. 520-534
    • Rosen, J.1
  • 20
    • 0023382715 scopus 로고
    • Distributed algorithms for the computation of noncooperative equilibria
    • S. Li and T. Basar, “Distributed algorithms for the computation of noncooperative equilibria,” Automatica, vol. 23, no. 4, pp. 523-533, 1987.
    • (1987) Automatica , vol.23 , Issue.4 , pp. 523-533
    • Li, S.1    Basar, T.2
  • 21
    • 0015747007 scopus 로고
    • The flow deviation method: An approach to store and forward communication network design
    • 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.
    • (1973) Networks , vol.3 , pp. 97-133
    • Fratta, M.G.L.1    Kleinrock, L.2
  • 22
    • 0017450139 scopus 로고
    • A minimum delay routing algorithm using distributed computation
    • R. G. Gallager, “A minimum delay routing algorithm using distributed computation,” IEEE Trans. Commun., vol. COM-25, pp. 73–85, 1977.
    • (1977) IEEE Trans. Commun , vol.COM-25 , pp. 73-85
    • Gallager, R.G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.