• Title/Summary/Keyword: traffic grooming

Search Result 14, Processing Time 0.016 seconds

Telecommunication Network Optimization Current Status and Challenges (통신망 최적화 연구 동향)

  • Park, Kyungchul;Lee, Heesang
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.1
    • /
    • pp.13-22
    • /
    • 2008
  • This paper gives reviews on current research status in telecommunication network design. Two problems are identified as major research issues. One is the WDM network design problem, where traffic grooming, virtual topology design and routing and wavelength assignment problems are considered. The other is the OSPF weight setting problem which was proposed as a practical method to implement traffic engineering capability in IP networks. After presenting surveys on those problems, we discuss potential challenging research issues in telecommunication network design.

A machine learning assisted optical multistage interconnection network: Performance analysis and hardware demonstration

  • Sangeetha Rengachary Gopalan;Hemanth Chandran;Nithin Vijayan;Vikas Yadav;Shivam Mishra
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.60-74
    • /
    • 2023
  • Integration of the machine learning (ML) technique in all-optical networks can enhance the effectiveness of resource utilization, quality of service assurances, and scalability in optical networks. All-optical multistage interconnection networks (MINs) are implicitly designed to withstand the increasing highvolume traffic demands at data centers. However, the contention resolution mechanism in MINs becomes a bottleneck in handling such data traffic. In this paper, a select list of ML algorithms replaces the traditional electronic signal processing methods used to resolve contention in MIN. The suitability of these algorithms in improving the performance of the entire network is assessed in terms of injection rate, average latency, and latency distribution. Our findings showed that the ML module is recommended for improving the performance of the network. The improved performance and traffic grooming capabilities of the module are also validated by using a hardware testbed.

Mesh 구조의 WDM 통신망에서의 수요집적 및 광파장 경로 설정 문제

  • 이순호;윤문길;차동완
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.433-440
    • /
    • 2003
  • 통신시스템의 발전과 더불어 WDM 전송기술의 등장은 미래의 다양한 광대역 서비스의 제공이 가능하게 되었다. 하지만, 개별 수요들이 요구하는 대역폭이 광파장의 대역폭에 비해 매우 작으므로. 개별 수요들을 다중화하여 하나의 광경로를 통해 전송하는 수요집적(traffic grooming)에 관한 연구들이 많은 관심을 받고. 있다 본 연구는 mesh 구조의 WDM 통신망에서의 수요집적 및 광경로 설정에 관한 문제를 다루고 있다. 주어진 네트워크 상에 하나의 가상노드와 아크를 추가하여 새로운 네트워크를 구성하고 이를 대상으로 목적함수를 사용되는 광파장의 수를 최소화하는 혼합정수계획 모형을 수립하였다. 아울러. NP-Complete로 알려진 본 문제의 해를 효과적으로 구하기 위한 발견적 해법을 제안하며, 실제 다양한 실험을 통해 제안된 알고리즘의 효율성을 보인다.

  • PDF

Lambda Routing Table based Dynamic Routing Scheme and Its Characteristics on GMPLS Network (GMPLS 네트워크에서 Lambda Routing Table 조회형 동적 라우팅 방식 및 특성)

  • Kwon Ho-jin;Kim Young-bu;Han Chi-moon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.938-945
    • /
    • 2004
  • This paper describes the problems of the existing two multi-layer routing policies(policy 1 and policy 2) and suggests new multi-layer routing policy(policy 3) which is established the packet LSP by inquiry on packet LSP lambda routing tables for GMPLS based optical If Network. All policies of multi-layer routing schemes first try to allocate a newly requested electrical path to an existing optical path that directly connects the source and destination nodes. U such a path is not available, all policies employ different procedures. Policy 1 tries to find available existing optical paths with two or more hops that connect the source and destination nodes and policy 2 tries to establish a new one-hop optical path between source and destination nodes. Policy 3 tries to establish a new one-hop optical path by inquiry on information of the packet LSP lambda routing tables between source and destination nodes. The performances of the three multi-routing policies are evaluated by computer simulation. Simulation results show that policy 3 is the excellent of routing time and traffic acceptance capabilities compare to existing two polices if p is large, where p is the number of packet-switching-capable ports p.