메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 948-958

On the stability of adaptive routing in the presence of congestion control

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); FEEDBACK; ROUTERS; NETWORK ROUTING; OPTIMIZATION; ROUTING ALGORITHMS;

EID: 0041939771     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/infcom.2003.1208932     Document Type: Conference Paper
Times cited : (37)

References (24)
  • 3
    • 0032613987 scopus 로고    scopus 로고
    • Approximating fractional multicommodity flow independent of the number of commodities
    • L. Fleischer, "Approximating fractional multicommodity flow independent of the number of commodities," in IEEE Symposium on Foundations of Computer Science, 1999, pp. 24-31.
    • (1999) IEEE Symposium on Foundations of Computer Science , pp. 24-31
    • Fleischer, L.1
  • 4
    • 0032317818 scopus 로고    scopus 로고
    • Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    • N. Garg and J. Konemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," in IEEE Symposium on Foundations of Computer Science, 1998, pp. 300-309.
    • (1998) IEEE Symposium on Foundations of Computer Science , pp. 300-309
    • Garg, N.1    Konemann, J.2
  • 5
    • 0024915854 scopus 로고
    • The revised ARPANET routing metric
    • A. Khanna and J. Zinky, "The revised ARPANET routing metric," in ACM SIGCOMM, 1989, pp. 45-56.
    • (1989) ACM SIGCOMM , pp. 45-56
    • Khanna, A.1    Zinky, J.2
  • 6
    • 0033204352 scopus 로고    scopus 로고
    • Load-sensitive routing of long-lived IP flows
    • A. Shaikh, J. Rexford, and K. Shin, "Load-sensitive routing of long-lived IP flows," in ACM SIGCOMM, 1999, pp. 215-226.
    • (1999) ACM SIGCOMM , pp. 215-226
    • Shaikh, A.1    Rexford, J.2    Shin, K.3
  • 7
    • 0033204543 scopus 로고    scopus 로고
    • A simple approximation to minimum-delay routing
    • S. Vutukury and J. J. Garcia-Luna-Aceves, "A simple approximation to minimum-delay routing," in ACM SIGCOMM, 1999, pp. 227-238.
    • (1999) ACM SIGCOMM , pp. 227-238
    • Vutukury, S.1    Garcia-Luna-Aceves, J.J.2
  • 8
    • 0033873349 scopus 로고    scopus 로고
    • Internet traffic engineering by optimizing OSPF weights
    • B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in IEEE INFOCOM, 2000, pp. 519-528.
    • (2000) IEEE INFOCOM , pp. 519-528
    • Fortz, B.1    Thorup, M.2
  • 9
    • 0002416734 scopus 로고
    • Analysis of shortest-path routing algorithms in a dynamic network environment
    • Z. Wang and J. Crowcroft, "Analysis of shortest-path routing algorithms in a dynamic network environment," ACM Computer Communication Review, vol. 22, 2, pp. 63-71, 1992.
    • (1992) ACM Computer Communication Review , vol.22 , Issue.2 , pp. 63-71
    • Wang, Z.1    Crowcroft, J.2
  • 11
    • 0042375935 scopus 로고    scopus 로고
    • Personal communication
    • U. Manber, Personal communication, 2002.
    • (2002)
    • Manber, U.1
  • 12
    • 0017450139 scopus 로고
    • A minimum delay routing algorithm using distributed computation
    • R. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Transactions on Communications, vol. COM-25, pp. 73-85, 1977.
    • (1977) IEEE Transactions on Communications , vol.COM-25 , pp. 73-85
    • Gallager, R.1
  • 15
    • 0033645905 scopus 로고    scopus 로고
    • Deriving traffic demands for operational (IP) networks: Methodology and experience
    • A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, "Deriving traffic demands for operational (IP) networks: methodology and experience," in ACM SIGCOMM, 2000, pp. 257-270.
    • (2000) ACM SIGCOMM , pp. 257-270
    • Feldmann, A.1    Greenberg, A.2    Lund, C.3    Reingold, N.4    Rexford, J.5    True, F.6
  • 16
    • 56449096542 scopus 로고    scopus 로고
    • [Online]
    • Cisco Systems, "Cisco IOS netflow." [Online]. Available: http://www.cisco.com/warp/public/732/Tech/netflow/
    • Cisco IOS Netflow
  • 20
    • 0033907680 scopus 로고    scopus 로고
    • Minimum interference routing with applications to MPLS traffic engineering
    • M. Kodialam and T. Lakshman, "Minimum interference routing with applications to MPLS traffic engineering," in IEEE INFOCOM, 2000, pp. 884-893.
    • (2000) IEEE INFOCOM , pp. 884-893
    • Kodialam, M.1    Lakshman, T.2
  • 21
    • 0035012755 scopus 로고    scopus 로고
    • MATE: MPLS adaptive traffic engineering
    • A. Elwalid, C. Jin, S. Low, and I. Widjaja, "MATE: MPLS adaptive traffic engineering," in IEEE INFOCOM, 2001, pp. 1300-1309.
    • (2001) IEEE INFOCOM , pp. 1300-1309
    • Elwalid, A.1    Jin, C.2    Low, S.3    Widjaja, I.4
  • 23
    • 0034776787 scopus 로고    scopus 로고
    • Statistical bandwidth sharing: A study of congestion at flow level
    • S. B. Fredj, T. Bonald, A. Proutiere, G. Regnie, and J. Roberts, "Statistical bandwidth sharing: A study of congestion at flow level," in ACM SIGCOMM, 2001, pp. 111-122.
    • (2001) ACM SIGCOMM , pp. 111-122
    • Fredj, S.B.1    Bonald, T.2    Proutiere, A.3    Regnie, G.4    Roberts, J.5


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