메뉴 건너뛰기




Volumn , Issue , 2015, Pages

Achieving near-optimal traffic engineering in hybrid Software Defined Networks

Author keywords

flow optimization; hybrid SDN; request routing; software defined networks; Traffic engineering

Indexed keywords

APPROXIMATION ALGORITHMS;

EID: 84942673390     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IFIPNetworking.2015.7145321     Document Type: Conference Paper
Times cited : (43)

References (29)
  • 1
    • 68649129121 scopus 로고    scopus 로고
    • Openflow: Enabling innovation in campus networks
    • N. McKeown et al., "OpenFlow: Enabling innovation in campus networks," ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 69-74, 2008.
    • (2008) ACM SIGCOMM Computer Communication Review , vol.38 , Issue.2 , pp. 69-74
    • McKeown, N.1
  • 2
    • 84883290864 scopus 로고    scopus 로고
    • B4: Experience with a globally-deployed software defined WAN
    • S. Jain et al., "B4: Experience with a globally-deployed software defined WAN," in Proc. ACM SIGCOMM 2013, 2013, pp. 3-14.
    • (2013) Proc. ACM SIGCOMM 2013 , pp. 3-14
    • Jain, S.1
  • 3
    • 84905855369 scopus 로고    scopus 로고
    • The road to SDN
    • N. Feamster, J. Rexford, and E. Zegura, "The road to SDN," ACM Queue, vol. 11, no. 12, pp. 1-21, 2013.
    • (2013) ACM Queue , vol.11 , Issue.12 , pp. 1-21
    • Feamster, N.1    Rexford, J.2    Zegura, E.3
  • 7
    • 84881598859 scopus 로고    scopus 로고
    • Runtime relocation of CDN serving pointsenabler for low costs mobile content delivery
    • M. Liebsch and F. Z. Yousaf, "Runtime relocation of CDN serving pointsenabler for low costs mobile content delivery," in Proc. IEEE WCNC, 2013, pp. 1464-1469.
    • (2013) Proc. IEEE WCNC , pp. 1464-1469
    • Liebsch, M.1    Yousaf, F.Z.2
  • 9
    • 84904430604 scopus 로고    scopus 로고
    • Traffic engineering with ECMP: An algorithmic perspective
    • M. Chiesa, G. Kindler, and M. Schapira, "Traffic engineering with ECMP: An algorithmic perspective," in Proc. IEEE INFOCOM, 2014.
    • (2014) Proc. IEEE INFOCOM
    • Chiesa, M.1    Kindler, G.2    Schapira, M.3
  • 10
    • 84883112280 scopus 로고    scopus 로고
    • Traffic engineering in software defined networks
    • S. Agarwal, M. Kodialam, and T. Lakshman, "Traffic engineering in software defined networks," in Proc. IEEE INFOCOM, 2013, pp. 2211-2219.
    • (2013) Proc. IEEE INFOCOM , pp. 2211-2219
    • Agarwal, S.1    Kodialam, M.2    Lakshman, T.3
  • 11
    • 0003276078 scopus 로고    scopus 로고
    • OSPF version 2
    • J. Moy, "OSPF version 2," IETF RFC 2328, 1998.
    • (1998) IETF RFC , vol.2328
    • Moy, J.1
  • 12
    • 0003240740 scopus 로고
    • Use of OSI IS-IS for routing in TCP/IP and dual environments
    • R. W. Callon, "Use of OSI IS-IS for routing in TCP/IP and dual environments," IETF RFC 1195, 1990.
    • (1990) IETF RFC , vol.1195
    • Callon, R.W.1
  • 13
    • 70449686701 scopus 로고    scopus 로고
    • Cooperative content distribution and traffic engineering in an ISP network
    • W. Jiang et al., "Cooperative content distribution and traffic engineering in an ISP network," in Proc. ACM SIGMETRICS, 2009, pp. 239-250.
    • (2009) Proc. ACM SIGMETRICS , pp. 239-250
    • Jiang, W.1
  • 15
    • 84655169959 scopus 로고    scopus 로고
    • Link-state routing with hop-byhop forwarding can achieve optimal traffic engineering
    • D. Xu, M. Chiang, and J. Rexford, "Link-state routing with hop-byhop forwarding can achieve optimal traffic engineering," IEEE/ACM Transactions on Networking, vol. 19, no. 6, pp. 1717-1730, 2011.
    • (2011) IEEE/ACM Transactions on Networking , vol.19 , Issue.6 , pp. 1717-1730
    • Xu, D.1    Chiang, M.2    Rexford, J.3
  • 16
    • 18844444815 scopus 로고    scopus 로고
    • Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks
    • A. Sridharan, R. Guerin, and C. Diot, "Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks," IEEE/ACM Transactions on Networking, vol. 13, no. 2, pp. 234-247, 2005.
    • (2005) IEEE/ACM Transactions on Networking , vol.13 , Issue.2 , pp. 234-247
    • Sridharan, A.1    Guerin, R.2    Diot, C.3
  • 17
    • 84949923356 scopus 로고    scopus 로고
    • Evolving to 5G: A fast and near-optimal request routing protocol for mobile core newtorks
    • J. He and W. Song, "Evolving to 5G: A fast and near-optimal request routing protocol for mobile core newtorks," in Proc. GLOBECOM, 2014.
    • (2014) Proc. GLOBECOM
    • He, J.1    Song, W.2
  • 18
    • 84924416310 scopus 로고    scopus 로고
    • A collaborative framework for in-network video caching in mobile networks
    • J. He et al., "A collaborative framework for in-network video caching in mobile networks," in Proc. IEEE SECON, 2013, pp. 406-414.
    • (2013) Proc. IEEE SECON , pp. 406-414
    • He, J.1
  • 19
    • 84886875487 scopus 로고    scopus 로고
    • The locator/ID separation protocol (LISP)
    • D. Farinacci et al., "The locator/ID separation protocol (LISP)," IETF RFC 6830, 2013.
    • (2013) IETF RFC , vol.6830
    • Farinacci, D.1
  • 21
    • 84877756214 scopus 로고    scopus 로고
    • Moving beyond end-to-end path information to optimize CDN performance
    • R. Krishnan et al., "Moving beyond end-to-end path information to optimize CDN performance," in Proc. ACM SIGCOMM Conference on Internet Measurement, 2009, pp. 190-201.
    • (2009) Proc. ACM SIGCOMM Conference on Internet Measurement , pp. 190-201
    • Krishnan, R.1
  • 22
    • 2942563643 scopus 로고    scopus 로고
    • Traffic engineering (TE) extensions to OSPF Version 2
    • D. Katz, K. Kompella, and D. Yeung, "Traffic engineering (TE) extensions to OSPF Version 2," IETF RFC 3630, 2003.
    • (2003) IETF RFC , vol.3630
    • Katz, D.1    Kompella, K.2    Yeung, D.3
  • 23
    • 80051567936 scopus 로고    scopus 로고
    • Virtual routers as a service: The routeflow approach leveraging software-defined networks
    • M. Nascimento et al., "Virtual routers as a service: The routeflow approach leveraging software-defined networks," in Proc. International Conference on Future Internet Technologies, 2011, pp. 34-37.
    • (2011) Proc. International Conference on Future Internet Technologies , pp. 34-37
    • Nascimento, M.1
  • 24
    • 42549097902 scopus 로고    scopus 로고
    • Faster and simpler algorithms for multicommodity flow and other fractional packing problems
    • N. Garg and J. Könemann, "Faster and simpler algorithms for multicommodity flow and other fractional packing problems," SIAM Journal on Computing, vol. 37, no. 2, pp. 630-652, 2007.
    • (2007) SIAM Journal on Computing , vol.37 , Issue.2 , pp. 630-652
    • Garg, N.1    Könemann, J.2
  • 25
    • 0000114717 scopus 로고    scopus 로고
    • Approximating fractional multicommodity flow independent of the number of commodities
    • L. K. Fleischer, "Approximating fractional multicommodity flow independent of the number of commodities," SIAM Journal on Discrete Mathematics, vol. 13, no. 4, pp. 505-520, 2000.
    • (2000) SIAM Journal on Discrete Mathematics , vol.13 , Issue.4 , pp. 505-520
    • Fleischer, L.K.1
  • 26
    • 84968830840 scopus 로고    scopus 로고
    • Faster approximation schemes for fractional multicommodity flow problems
    • G. Karakostas, "Faster approximation schemes for fractional multicommodity flow problems," in Proc. ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 166-173.
    • (2002) Proc. ACM-SIAM Symposium on Discrete Algorithms , pp. 166-173
    • Karakostas, G.1


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