메뉴 건너뛰기




Volumn 3042, Issue , 2004, Pages 502-513

Multi-hour design of dynamically reconfigurable MPLS networks

Author keywords

MPLS; Multi hour design; Network planning; Traffic engineering

Indexed keywords

ALGORITHMS; COSTS; ELECTRIC NETWORK TOPOLOGY; TOPOLOGY; TRAFFIC CONTROL;

EID: 34250175446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24693-0_42     Document Type: Article
Times cited : (7)

References (11)
  • 2
    • 35048882227 scopus 로고    scopus 로고
    • Multihour design of multi-hop virtual path based widearea ATM networks
    • Washington DC, USA
    • Bauschert, T.: Multihour design of multi-hop virtual path based widearea ATM networks. Proc of the 15th International Teletraffic Congress (ITC-15), Washington DC, USA (1997) 1019-1029
    • (1997) Proc of the 15th International Teletraffic Congress (ITC-15) , pp. 1019-1029
    • Bauschert, T.1
  • 4
    • 35048888259 scopus 로고    scopus 로고
    • QoS Routing and Related Traffic Engineering Methods - Capacity Management Methods
    • CA
    • ITU-T: QoS Routing and Related Traffic Engineering Methods - Capacity Management Methods. Recommendation E.360.6, CA. (2002)
    • (2002) Recommendation E.360.6
  • 5
    • 0037832981 scopus 로고    scopus 로고
    • An Efficient Algorithm for Global Path Optimization in MPLS Networks
    • Kluwer Academic Publishers
    • Józsa, B.C., Király, Z., Magyar, G., Szentesi, Á.: An Efficient Algorithm for Global Path Optimization in MPLS Networks. Optimization and Engineering, Vol. 2., No. 3. Kluwer Academic Publishers (2001) 321-347
    • (2001) Optimization and Engineering , vol.2 , Issue.3 , pp. 321-347
    • Józsa, B.C.1    Király, Z.2    Magyar, G.3    Szentesi, Á.4
  • 6
    • 0037544302 scopus 로고    scopus 로고
    • On the Solution of Reroute Sequence Planning Problem in MPLS Networks
    • Eisevier Science
    • Józsa, B.G., Makai, M.: On the Solution of Reroute Sequence Planning Problem in MPLS Networks. Computer Networks, Vol. 42., No. 2. Eisevier Science (2003) 199-210
    • (2003) Computer Networks , vol.42 , Issue.2 , pp. 199-210
    • Józsa, B.G.1    Makai, M.2
  • 8
    • 0028375488 scopus 로고
    • A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis
    • Medhi, D.: A Unified Approach to Network Survivability for Teletraffic Networks: Models, Algorithms and Analysis. IEEE Transactions on Communications, Vol. 42. (1994) 534-548
    • (1994) IEEE Transactions on Communications , vol.42 , pp. 534-548
    • Medhi, D.1
  • 9
    • 3843068090 scopus 로고
    • Multi-Hour, Multi-Traffic Class Network Design for VP-based Wide-Area Dynamically Reconfigurable ATM Networks
    • Boston, MA
    • Medhi, D.: Multi-Hour, Multi-Traffic Class Network Design for VP-based Wide-Area Dynamically Reconfigurable ATM Networks. In Proc of IEEE INFOCOM'95, Boston, MA. (1995) 900-907
    • (1995) Proc of IEEE INFOCOM'95 , pp. 900-907
    • Medhi, D.1
  • 10
    • 23044519733 scopus 로고    scopus 로고
    • Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing
    • Medhi, D.: Some Approaches to Solving a Multi-Hour Broadband Network Capacity Design Problem with Single-Path Routing. Telecommunication Systems, Vol. 13. (2000) 269-291
    • (2000) Telecommunication Systems , vol.13 , pp. 269-291
    • Medhi, D.1


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