메뉴 건너뛰기




Volumn 35, Issue 4, 2000, Pages 279-286

Load-balanced routing in counter rotated SONET rings

Author keywords

Approximation algorithms; Counter rotated rings; Load balancing; Routing; SONET

Indexed keywords

POLYNOMIAL APPROXIMATION; RESOURCE ALLOCATION; ROTATION;

EID: 0034216178     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200007)35:4<279::AID-NET7>3.0.CO;2-P     Document Type: Article
Times cited : (3)

References (10)
  • 1
    • 0032294173 scopus 로고    scopus 로고
    • Heavy traffic drives networks to IP over SONET
    • [1] D. Clark, Heavy traffic drives networks to IP over SONET, IEEE Comput Dec (1998), 17-20.
    • (1998) IEEE Comput Dec , pp. 17-20
    • Clark, D.1
  • 2
    • 0001259317 scopus 로고
    • An optimization problem related to balancing loads on SONET rings
    • [2] S. Cosares and I. Saniee, An optimization problem related to balancing loads on SONET rings, Telecommun Syst 3 (1994), 165-181.
    • (1994) Telecommun Syst , vol.3 , pp. 165-181
    • Cosares, S.1    Saniee, I.2
  • 4
    • 0002291223 scopus 로고    scopus 로고
    • Self-healing rings in a synchronous environment
    • C.A. Siller and M. Shafi, (Editors), IEEE Press, New York
    • [4] I. Haque, W. Kremer, and K. Raychauduri, "Self-healing rings in a synchronous environment," SONET/SDH: A sourcebook of synchronous networking, C.A. Siller and M. Shafi, (Editors), IEEE Press, New York, 1996, pp. 131-139.
    • (1996) SONET/SDH: A Sourcebook of Synchronous Networking , pp. 131-139
    • Haque, I.1    Kremer, W.2    Raychauduri, K.3
  • 5
    • 0031084627 scopus 로고    scopus 로고
    • A polynomial-time approximation scheme for the SONET ring loading problem
    • [5] S. Khanna, A polynomial-time approximation scheme for the SONET ring loading problem, Bell Lab Tech J 2(2) (1997).
    • Bell Lab Tech J , vol.2 , Issue.2 , pp. 1997
    • Khanna, S.1
  • 6
    • 0000800781 scopus 로고
    • Multicommodity flows in planar graphs
    • [6] H. Okamura and P. Seymour, Multicommodity flows in planar graphs, J Combin Theory Ser B 31 (1981), 75-81.
    • (1981) J Combin Theory Ser B , vol.31 , pp. 75-81
    • Okamura, H.1    Seymour, P.2
  • 7
    • 0000138054 scopus 로고    scopus 로고
    • Optimal routing in self-healing communications networks
    • [7] I. Saniee, Optimal routing in self-healing communications networks, Int Trans Oper Res 3 (1996), 187-195.
    • (1996) Int Trans Oper Res , vol.3 , pp. 187-195
    • Saniee, I.1


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