메뉴 건너뛰기




Volumn 3982 LNCS, Issue , 2006, Pages 1100-1109

The gateways location and topology assignment problem in hierarchical wide area networks: Algorithms and computational results

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; PROBLEM SOLVING; TOPOLOGY; WIDE AREA NETWORKS;

EID: 33745874667     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11751595_115     Document Type: Conference Paper
Times cited : (4)

References (10)
  • 1
    • 84986946222 scopus 로고
    • Optimal clustering structures for hierarchical topological network design of large computer networks
    • Kleinrock L., Kamoun F.: Optimal Clustering Structures for Hierarchical Topological Network Design of Large Computer Networks. Networks 10 (1980) 221-248
    • (1980) Networks , vol.10 , pp. 221-248
    • Kleinrock, L.1    Kamoun, F.2
  • 2
    • 0015747007 scopus 로고
    • The flow deviation method: An approach to storeand-forward communication network design
    • Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: an Approach to Storeand-Forward Communication Network Design. Networks 3 (1973) 97-133
    • (1973) Networks , vol.3 , pp. 97-133
    • Fratta, L.1    Gerla, M.2    Kleinrock, L.3
  • 4
    • 24944465788 scopus 로고    scopus 로고
    • The web replica allocation and topology assignment problem in wide area networks: Algorithms and computational results
    • Markowski M., Kasprzak A.: The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results. Lecture Notes in Computer Science 3483 (2005) 772-781
    • (2005) Lecture Notes in Computer Science , vol.3483 , pp. 772-781
    • Markowski, M.1    Kasprzak, A.2
  • 5
    • 0028494736 scopus 로고
    • Locating internet gateways to minimize nonlinear congestion costs
    • Liang S.C., Yee J.R.: Locating Internet Gateways to Minimize Nonlinear Congestion Costs. IEEE Transactions On Communications 42, (1994) 2740-50
    • (1994) IEEE Transactions on Communications , vol.42 , pp. 2740-2750
    • Liang, S.C.1    Yee, J.R.2
  • 6
    • 0004276598 scopus 로고    scopus 로고
    • On optimal location of switches/routers and interconnection
    • University of Missouri-Kansas City
    • Liu Z., Gu Y., Medhi D.: On Optimal Location of Switches/Routers and Interconnection. Technical Report, University of Missouri-Kansas City (1998)
    • (1998) Technical Report
    • Liu, Z.1    Gu, Y.2    Medhi, D.3
  • 7
    • 0031208165 scopus 로고    scopus 로고
    • On the multidensity gateway location problem for multilevel high speed network
    • Saha D. and Mukherjee A.: On the multidensity gateway location problem for multilevel high speed network. Computer Communications 20 (1997) 576-585
    • (1997) Computer Communications , vol.20 , pp. 576-585
    • Saha, D.1    Mukherjee, A.2
  • 9
    • 0942266540 scopus 로고    scopus 로고
    • A branch and bound algorithm for primary routes assignment in survivable connection oriented networks
    • Kluwer Academic Publishers
    • Walkowiak K.: A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. Computational Optimization and Applications 27, Kluwer Academic Publishers (2004) 149-171
    • (2004) Computational Optimization and Applications , vol.27 , pp. 149-171
    • Walkowiak, K.1
  • 10
    • 24944524246 scopus 로고    scopus 로고
    • An exact algorithm for host allocation, capacity and flow assignment problem in WAN
    • Kluwer Academic Publishers, Boston
    • Markowski M., Kasprzak A.: An exact algorithm for host allocation, capacity and flow assignment problem in WAN. Internet Technologies. Applications and Societal Impact, Kluwer Academic Publishers, Boston (2002) 73-82
    • (2002) Internet Technologies. Applications and Societal Impact , pp. 73-82
    • Markowski, M.1    Kasprzak, A.2


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