메뉴 건너뛰기




Volumn 83, Issue , 2015, Pages 30-44

An adaptive multi-path computation framework for centrally controlled networks

Author keywords

Automatic load balancing; Fail over; Multi path; Openflow; Path DB; Resource allocation; Routing; Software defined networking (SDN)

Indexed keywords

ADAPTIVE CONTROL SYSTEMS; ALGORITHMS; APPLICATION PROGRAMS; ELECTRIC NETWORK TOPOLOGY; GLOBAL OPTIMIZATION; NETWORK MANAGEMENT; NONLINEAR PROGRAMMING; OPTIMIZATION; RESOURCE ALLOCATION; TOPOLOGY;

EID: 84946494976     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2015.02.004     Document Type: Article
Times cited : (35)

References (31)
  • 4
    • 84904582454 scopus 로고    scopus 로고
    • A roadmap for traffic engineering in software defined networks
    • I.F. Akyildiz, A. Lee, P. Wang, M. Luo, and W. Chou A roadmap for traffic engineering in software defined networks Comput. Networks 71 2014 1 30
    • (2014) Comput. Networks , vol.71 , pp. 1-30
    • Akyildiz, I.F.1    Lee, A.2    Wang, P.3    Luo, M.4    Chou, W.5
  • 12
    • 0030246198 scopus 로고    scopus 로고
    • Quality-of-service routing for supporting multimedia applications
    • Z. Wang, and J. Crowcroft Quality-of-service routing for supporting multimedia applications IEEE J. Sel. Areas Commun. 14 7 1996 1228 1234
    • (1996) IEEE J. Sel. Areas Commun. , vol.14 , Issue.7 , pp. 1228-1234
    • Wang, Z.1    Crowcroft, J.2
  • 13
    • 0021441708 scopus 로고
    • A quick method for finding shortest pairs of disjoint paths
    • J.W. Suurballe, and R.E. Tarjan A quick method for finding shortest pairs of disjoint paths Networks 14 2 1984 325 336
    • (1984) Networks , vol.14 , Issue.2 , pp. 325-336
    • Suurballe, J.W.1    Tarjan, R.E.2
  • 14
    • 0030584509 scopus 로고    scopus 로고
    • Parallel algorithm for shortest pairs of edge-disjoint paths
    • S. Banerjee, R. Ghosh, and A. Reddy Parallel algorithm for shortest pairs of edge-disjoint paths J. Parall. Distrib. Comput. 33 2 1996 165 171
    • (1996) J. Parall. Distrib. Comput. , vol.33 , Issue.2 , pp. 165-171
    • Banerjee, S.1    Ghosh, R.2    Reddy, A.3
  • 15
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • J.Y. Yen Finding the k shortest loopless paths in a network Manage. Sci. 17 11 1971 712 716
    • (1971) Manage. Sci. , vol.17 , Issue.11 , pp. 712-716
    • Yen, J.Y.1
  • 21
    • 84946508353 scopus 로고    scopus 로고
    • T. Dietz, Trema Tutorial, 2012. < http://www.fp7-ofelia.eu/assets/Uploads/201203xx-TremaTutorial.pdf >.
    • (2012) Trema Tutorial
    • Dietz, T.1
  • 23
    • 84946508354 scopus 로고    scopus 로고
    • Multi-dimensional in-memory distributed hashing mechanism for fast network information processing in SDN
    • Submitted to
    • M. Luo, X. Wu, Y. Zeng, J. Li, K. Lin, M. Bo, W. Chou, Multi-dimensional in-memory distributed hashing mechanism for fast network information processing in sdn, Submitted to IPCCC 2014, 2014.
    • (2014) IPCCC 2014
    • Luo, M.1    Wu, X.2    Zeng, Y.3    Li, J.4    Lin, K.5    Bo, M.6    Chou, W.7
  • 24
    • 84886044356 scopus 로고    scopus 로고
    • Characterization of 3g data-plane traffic and application towards centralized control and management for software defined networking
    • L. Qian, B. Wu, R. Zhang, W. Zhang, M. Luo, Characterization of 3g data-plane traffic and application towards centralized control and management for software defined networking, in: Proceedings of 2013 IEEE International Congress on Big Data, 2013, pp. 278-285.
    • (2013) Proceedings of 2013 IEEE International Congress on Big Data , pp. 278-285
    • Qian, L.1    Wu, B.2    Zhang, R.3    Zhang, W.4    Luo, M.5
  • 29
    • 84946492304 scopus 로고    scopus 로고
    • Brite. < http://www.cs.bu.edu/brite/index.html >.
    • Brite
  • 30
    • 0024123493 scopus 로고
    • Routing of multipoint connections
    • B.M. Waxman Routing of multipoint connections IEEE J. Sel. Areas Commun. 6 9 1988 1617 1622
    • (1988) IEEE J. Sel. Areas Commun. , vol.6 , Issue.9 , pp. 1617-1622
    • Waxman, B.M.1
  • 31
    • 0012440707 scopus 로고    scopus 로고
    • Route Views Project. < http://snap.stanford.edu/data/as-allstats.html >.
    • Route Views Project


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