RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재 SCIE SCOPUS

    Evaluation of Topology Optimization Objectives in IP Networks

    한글로보기

    https://www.riss.kr/link?id=A106609077

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    In the past, various optimization objective functions havebeen proposed to help in network optimization, especially for usein traffic engineering (TE) and topology optimization. This varietyof optimization objectives resulted in the emergence of algorithmstargeting different objectives. However, the role of the objectivefunction has been largely overlooked. Because, the choiceof a particular objective function was not justified in most of thecases. Some researchers criticized this arbitrary selection of objectivefunctions. Even though some researchers intuitively suggestusing a specific objective, only few work tackled with the problemof evaluating the objectives. In this paper, we evaluate various networkoptimization objectives on topology optimization. Previously,a study analyzed the efficiency of some routing optimization objectivesusing linear programming (LP) by linear relaxation. However,some of the objective functions are nonlinear, and such a linear relaxationdoes not treat each objective equally.The difficulty arisesdue to the fact that optimization algorithms are objective functiontailored heuristics. To achieve fairness, we compare and analyzedifferent traffic optimization objectives for topology optimizationusing neural networks which are used to model nonlinear relations.
    By using neural networks, we strive to avoid any unfairness, suchas obviating linear approximation. Also, our work suggests whichfeatures are meaningful for machine learning in network optimization.
    Our method partially agrees with the previous work, and weconclude that delay is the best performing optimization objective.
    번역하기

    In the past, various optimization objective functions havebeen proposed to help in network optimization, especially for usein traffic engineering (TE) and topology optimization. This varietyof optimization objectives resulted in the emergence of algor...

    In the past, various optimization objective functions havebeen proposed to help in network optimization, especially for usein traffic engineering (TE) and topology optimization. This varietyof optimization objectives resulted in the emergence of algorithmstargeting different objectives. However, the role of the objectivefunction has been largely overlooked. Because, the choiceof a particular objective function was not justified in most of thecases. Some researchers criticized this arbitrary selection of objectivefunctions. Even though some researchers intuitively suggestusing a specific objective, only few work tackled with the problemof evaluating the objectives. In this paper, we evaluate various networkoptimization objectives on topology optimization. Previously,a study analyzed the efficiency of some routing optimization objectivesusing linear programming (LP) by linear relaxation. However,some of the objective functions are nonlinear, and such a linear relaxationdoes not treat each objective equally.The difficulty arisesdue to the fact that optimization algorithms are objective functiontailored heuristics. To achieve fairness, we compare and analyzedifferent traffic optimization objectives for topology optimizationusing neural networks which are used to model nonlinear relations.
    By using neural networks, we strive to avoid any unfairness, suchas obviating linear approximation. Also, our work suggests whichfeatures are meaningful for machine learning in network optimization.
    Our method partially agrees with the previous work, and weconclude that delay is the best performing optimization objective.

    더보기

    참고문헌 (Reference)

    1 A. K. Dutta, "WDM technologies : Optical networks. Volume III" Elsevier Academic Press 2004

    2 S. Agarwal, "Traffic engineering in software defined networks" 2211-2219, 2013

    3 A. Nucci, "The problem of synthetically generating IP traffic matrices : initial recommendations" 35 (35): 19-32, 2005

    4 D. O. Hebb, "The organization of behaviour" Wiley 1949

    5 P. Borgnat, "Seven years and one day: Sketching the evolution of internet traffic" 711-719, 2009

    6 W. B. Gong, "Self-similarity and long range dependence on the internet : A second look at the evidence, origins and implications" 48 (48): 377-399, 2005

    7 D. O. Awduche, "RFC 2702: Requirements for traffic engineering over MPLS"

    8 S. Uhlig, "Providing public intradomain traffic matrices to the research community" 36 (36): 83-, 2006

    9 P. Sangkatsanee, "Practical real-time intrusion detection using machine learning approaches" 34 (34): 2227-2235, 2011

    10 B. Fortz, "Optimizing OSPF/IS-IS weights in a changing world" 20 (20): 756-767, 2002

    1 A. K. Dutta, "WDM technologies : Optical networks. Volume III" Elsevier Academic Press 2004

    2 S. Agarwal, "Traffic engineering in software defined networks" 2211-2219, 2013

    3 A. Nucci, "The problem of synthetically generating IP traffic matrices : initial recommendations" 35 (35): 19-32, 2005

    4 D. O. Hebb, "The organization of behaviour" Wiley 1949

    5 P. Borgnat, "Seven years and one day: Sketching the evolution of internet traffic" 711-719, 2009

    6 W. B. Gong, "Self-similarity and long range dependence on the internet : A second look at the evidence, origins and implications" 48 (48): 377-399, 2005

    7 D. O. Awduche, "RFC 2702: Requirements for traffic engineering over MPLS"

    8 S. Uhlig, "Providing public intradomain traffic matrices to the research community" 36 (36): 83-, 2006

    9 P. Sangkatsanee, "Practical real-time intrusion detection using machine learning approaches" 34 (34): 2227-2235, 2011

    10 B. Fortz, "Optimizing OSPF/IS-IS weights in a changing world" 20 (20): 756-767, 2002

    11 J. Zheng, "Optical WDM Networks: Concepts and design principles" John Wiley & Sons 2004

    12 W. E. Leland, "On the self-similar nature of Ethernet traffic(extended version)" 2 (2): 1-15, 1994

    13 O. Heckmann, "On realistic network topologies for simulation" 28-32, 2003

    14 R. Rojas, "Neural networks: A systematic introduction" Springer-Verlag 1996

    15 K. Kar, "Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications" 18 (18): 2566-2579, 2000

    16 A. Elwalid, "MATE : Multipath adaptive traffic engineering" 40 (40): 695-709, 2002

    17 D. Levin, "Logically centralized? state distribution trade-offs in software defined networks" 1-, 2012

    18 I. Chlamtac, "Lightpath communications : An approach to high bandwidth opticalWAN’s" 40 (40): 1171-1182, 1992

    19 N. Degrande, "Inter-area traffic engineering in a differentiated services network" 11 : 427-445, 2003

    20 S. Balon, "How well do traffic engineering objective functions meet TE requirements" 3976 : 75-86, 2006

    21 Y. S. Hanay, "Evaluation of topology optimization objectives" 458-461, 2015

    22 J. He, "Don’t optimize existing protocols, design optimizable protocols" 37 (37): 53-58, 2007

    23 G. Tanaka, "Complex-valued multistate associative memory with nonlinear multilevel functions for gray-level image reconstruction" 20 (20): 1463-1473, 2009

    24 N. N. Aizenberg, "CNN based on multi-valued neuron as a model of associative memory for grey scale images" 36-41, 1992

    25 CISCO, "Best practices in core network capacity planning architectural principles of the MATE portfolio of products"

    26 N. Wang, "An overview of routing optimization for internet traffic engineering" 10 (10): 36-56, 2008

    27 A. Sivaraman, "An experimental study of the learnability of congestion control" 479-490, 2014

    28 F. Blanchy, "An efficient decentralized on-line traffic engineering algorithm for MPLS networks" 2003

    29 Y. Koizumi, "Adaptive virtual network topology control based on attractor selection" 28 (28): 1720-1731, 2010

    30 A. Balachandran, "A quest for an internet video quality-of-experience metric" 97-102, 2012

    31 T. Karagiannis, "A nonstationary Poisson view of Internet traffic" 1558-1569, 2004

    32 Y. Jin, "A Modular machine learning system for flow-level traffic classification in large networks" 6 (6): 1-34, 2012

    33 A. Altin, ""Intra-domain traffic engineering with shortest path routing protocols" 204 (204): 2013

    더보기

    동일학술지(권/호) 다른 논문

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2023 평가 해외DB학술지평가 신청대상 (해외등재 학술지 평가)
    2020-01-01 등재 등재학술지 유지 (해외등재 학술지 평가) KCI등재
    2005-01-01 등재 SCI 등재 (등재후보1차) KCI등재
    2004-01-01 등재 등재후보학술지 유지 (등재후보2차) KCI등재후보
    2003-01-01 등재 등재후보 1차 PASS (등재후보1차) KCI등재후보
    2001-07-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.74 0.09 0.53
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.42 0.34 0.264 0.02
    더보기

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼