메뉴 건너뛰기




Volumn 5, Issue 5, 2006, Pages 320-339

Selective randomized load balancing and mesh networks with changing demands

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER NETWORKS; COST EFFECTIVENESS; NETWORK PROTOCOLS; OPTICAL COMMUNICATION; SWITCHING; TREES (MATHEMATICS); VIRTUAL REALITY;

EID: 33745249903     PISSN: 15365379     EISSN: 15365379     Source Type: Journal    
DOI: 10.1364/JON.5.000320     Document Type: Article
Times cited : (28)

References (29)
  • 3
    • 3042540857 scopus 로고    scopus 로고
    • New economical virtual private networks
    • W. Ben-Ameur and H. Kerivin, "New economical virtual private networks," Commun. ACM 44(6), 69-73 (2003).
    • (2003) Commun. ACM , vol.44 , Issue.6 , pp. 69-73
    • Ben-Ameur, W.1    Kerivin, H.2
  • 4
    • 25144469855 scopus 로고    scopus 로고
    • Routing of uncertain demands
    • W. Ben-Ameur and H. Kerivin, "Routing of uncertain demands," Optimization Eng. 6, 283-313 (2005).
    • (2005) Optimization Eng. , vol.6 , pp. 283-313
    • Ben-Ameur, W.1    Kerivin, H.2
  • 9
    • 8344284236 scopus 로고    scopus 로고
    • Optimal bandwidth reservation in hose-model VPNs with multi-path routing
    • IEEE Computer Society
    • T. Erlebach and M. Ruegg, "Optimal bandwidth reservation in hose-model VPNs with multi-path routing," in IEEE INFOCOM 2004 (IEEE Computer Society, 2004), Vol. 4, pp. 2275-2282.
    • (2004) IEEE INFOCOM 2004 , vol.4 , pp. 2275-2282
    • Erlebach, T.1    Ruegg, M.2
  • 10
    • 0038045810 scopus 로고    scopus 로고
    • Designing least-cost nonblocking broadband networks
    • J. A. Fingerhut, S. Suri, and J. Turner, "Designing least-cost nonblocking broadband networks," J. Algorithms 22, 287-309 (1997).
    • (1997) J. Algorithms , vol.22 , pp. 287-309
    • Fingerhut, J.A.1    Suri, S.2    Turner, J.3
  • 11
    • 0034832757 scopus 로고    scopus 로고
    • Provisioning a virtual private network: A network design problem for multicommodity flow
    • Hersonissos, Crete, Greece, July
    • A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener, "Provisioning a virtual private network: a network design problem for multicommodity flow," presented at the 33rd Annual ACM Symposium on Theory of Computing, Hersonissos, Crete, Greece, July 2001.
    • (2001) 33rd Annual ACM Symposium on Theory of Computing
    • Gupta, A.1    Kleinberg, J.2    Kumar, A.3    Rastogi, R.4    Yener, B.5
  • 12
    • 0038107641 scopus 로고    scopus 로고
    • Simpler and better approximation algorithms for network design
    • San Diego, California, 9-11 June
    • A. Gupta, A. Kumar, and T. Roughgarden, "Simpler and better approximation algorithms for network design," presented at the 35th Annual ACM Symposium on Theory of Computing, San Diego, California, 9-11 June 2003.
    • (2003) 35th Annual ACM Symposium on Theory of Computing
    • Gupta, A.1    Kumar, A.2    Roughgarden, T.3
  • 16
    • 25844478116 scopus 로고    scopus 로고
    • Efficient and robust routing of highly variable traffic
    • San Diego, California, November
    • M. Kodialam, T. V. Lakshman, and S. Sengupta, "Efficient and robust routing of highly variable traffic," presented at HotNets III, San Diego, California, November 2004.
    • (2004) HotNets III
    • Kodialam, M.1    Lakshman, T.V.2    Sengupta, S.3
  • 17
    • 0024135198 scopus 로고
    • An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
    • IEEE
    • T. Leighton and S. Rao, "An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms," in Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (IEEE, 1988), pp. 422-431.
    • (1988) Proceedings of the 29th IEEE Symposium on Foundations of Computer Science , pp. 422-431
    • Leighton, T.1    Rao, S.2
  • 18
    • 23944506132 scopus 로고    scopus 로고
    • Capacity planning of survivable mesh-based transport networks under demand uncertainty
    • D. Leung and W. D. Grover, "Capacity planning of survivable mesh-based transport networks under demand uncertainty," Photon. Netw. Commun. 10, 123-140 (2005).
    • (2005) Photon. Netw. Commun. , vol.10 , pp. 123-140
    • Leung, D.1    Grover, W.D.2
  • 19
    • 0023438594 scopus 로고
    • Randomized parallel communications on an extension of the omega network
    • D. Mitra and R. A. Cieslak, "Randomized parallel communications on an extension of the omega network," J. Assoc. Comput. Mach. 32, 802-824 (1987).
    • (1987) J. Assoc. Comput. Mach. , vol.32 , pp. 802-824
    • Mitra, D.1    Cieslak, R.A.2
  • 21
    • 33745238151 scopus 로고    scopus 로고
    • NetSwitch: Load-balanced data-over-optical architecture for mesh networks
    • Lucent Technologies
    • H. Nagesh, V. Poosala, S. Sengupta, M. Alicherry, and V. Kumar, "NetSwitch: load-balanced data-over-optical architecture for mesh networks," Lucent Technical Memorandum ITD-04-45867F (Lucent Technologies, 2004).
    • (2004) Lucent Technical Memorandum , vol.ITD-04-45867F
    • Nagesh, H.1    Poosala, V.2    Sengupta, S.3    Alicherry, M.4    Kumar, V.5
  • 22
    • 0036671117 scopus 로고    scopus 로고
    • Algorithms for provisioning virtual pri vate networks in the hose model
    • A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener, "Algorithms for provisioning virtual pri vate networks in the hose model," IEEE/ACM Trans. Netw. 10, 565-578 (2002).
    • (2002) IEEE/ACM Trans. Netw. , vol.10 , pp. 565-578
    • Kumar, A.1    Rastogi, R.2    Silberschatz, A.3    Yener, B.4
  • 24
    • 0038614650 scopus 로고    scopus 로고
    • Switched optical backbone for cost-effective scalable core IP networks
    • S. Sengupta, V. Kumar, and D. Saha, "Switched optical backbone for cost-effective scalable core IP networks," IEEE Commun. Mag. 41(6) 60-70 (2003).
    • (2003) IEEE Commun. Mag. , vol.41 , Issue.6 , pp. 60-70
    • Sengupta, S.1    Kumar, V.2    Saha, D.3
  • 25
    • 0000415121 scopus 로고
    • A scheme for fast parallel communication
    • L. G. Valiant, "A scheme for fast parallel communication," SIAM J. Comput. 11(2), 350-361 (1982).
    • (1982) SIAM J. Comput. , vol.11 , Issue.2 , pp. 350-361
    • Valiant, L.G.1
  • 26
    • 33745280669 scopus 로고    scopus 로고
    • Exploiting parallelism to boost data-path rate in high-speed IP/MPLS networking
    • New York, New York, 23 June
    • I. Widjaja and A. I. Elwalid, "Exploiting parallelism to boost data-path rate in high-speed IP/MPLS networking," presented at the IEEE Workshop on High-Speed Networking, New York, New York, 23 June 2002.
    • (2002) IEEE Workshop on High-speed Networking
    • Widjaja, I.1    Elwalid, A.I.2
  • 28
    • 25844505208 scopus 로고    scopus 로고
    • Designing a predictable Internet backbone network
    • San Diego, California, November
    • R. Zhang-Shen and N. McKeown, "Designing a predictable Internet backbone network," presented at HotNets III, San Diego, California, November 2004.
    • (2004) HotNets III
    • Zhang-Shen, R.1    McKeown, N.2
  • 29
    • 33745275648 scopus 로고    scopus 로고
    • Definitions and terminology for automatically switched optical networks (ASON)
    • International Telecommunication Union
    • "Definitions and terminology for automatically switched optical networks (ASON)," ITU-T Recommendation G.8081 (International Telecommunication Union, 2004).
    • (2004) ITU-T Recommendation G.8081


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