• Title/Summary/Keyword: Network topology

Search Result 1,184, Processing Time 0.036 seconds

A Study on Heuristic Approaches for Routing and Wavelength Assignment in WDM All-Optical Networks (WDM 전광망에서 라우팅과 파장할당을 위한 휴리스틱 방법에 대한 연구)

  • Kim, Ki-Won;Chung, Young-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.38 no.8
    • /
    • pp.19-29
    • /
    • 2001
  • The recent explosion in the Internet applications, Internet. host number and the traffic in the IP backbone network is posing new challenges for transport network. This requires a high-speed IP backbone network that has a substantially higher bandwidth than the one offered by current networks, which prompts the development of all-optical network. To obtain optical network utilization gains, we need a software which establishs logical topology to make possible the efficient use or physical topology, and control the optical network in combination with the IP layer routing protocols. Finally, the logical topology is required higher efficient than physical topology. For this an efficient algorithm for the routing and wavelength assignment(RWA) in the WDM all-optical network is necessary. In this paper, two kinds of heuristic algorithms to establish logical topology for WDM networks and arc applied to the design of logical topology of domestic backbone network. These algorithms are found to work quite well and they arc compared with each other in terms of blocking rate, etc.

  • PDF

Efficient Logical Topology Design Considering Multiperiod Traffic in IP-over-WDM Networks

  • Li, Bingbing;Kim, Young-Chon
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.1
    • /
    • pp.13-21
    • /
    • 2015
  • In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.

A Study on the Design of a Survivable Ship Backbone Network (생존 가능한 선박 백본 네트워크 설계에 관한 연구)

  • Tak, Sung-Woo;Kim, Hye-Jin;Kim, Hee-Kyum;Kim, Tae-Hoon;Park, Jun-Hee;Lee, Kwang-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1416-1427
    • /
    • 2012
  • This paper proposes a design technique of a survivable ship backbone network, which describes a near optimal configuration scheme of physical and logical topologies of which the survivable ship backbone network consists. We first analyze and present an efficient architecture of a survivable ship backbone network consisting of redundant links and ship devices with dual communication interfaces. Then, we present an integer linear programming-based configuration scheme of a physical topology with regard to the proposed ship backbone network architecture. Finally, we present a metaheuristic-based configuration scheme of a logical topology, underlying the physical topology.

Clustering Formation and Topology Control in Multi-Radio Multi-Channel Wireless Mesh Networks

  • Que, Ma. Victoria;Hwang, Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.488-501
    • /
    • 2008
  • Convergence of various wireless systems can be cost effectively achieved through enhancement of existing technology. The emergence of Wireless Mesh Network (WMN) entails the interoperability and interconnection of various wireless technologies in one single system. Furthermore, WMN can be implemented with multi-radio and multi-channel enhancement. A multi-radio, multi-channel wireless mesh network could greatly improve certain networking performance metrics. In this research, two approaches namely, clustering and topology control mechanisms are integrated with multi-radio multi-channel wireless mesh network. A Clustering and Topology Control Algorithm (CTCA)is presented that would prolong network lifetime of the client nodes and maintain connectivity of the routers.

A Design of Network Topology Discovery System based on Traffic In-out Count Analysis (네트워크 트래픽 입출량 분석을 통한 네트워크 토폴로지 탐색 시스템 설계)

  • Park, Ji-Tae;Baek, Ui-Jun;Shin, Mu-Gon;Lee, Min-Seong;Kim, Myung-Sup
    • KNOM Review
    • /
    • v.23 no.1
    • /
    • pp.1-9
    • /
    • 2020
  • With the rapid development of science and technology in recent years, the network environment are growing, and a huge amount of traffic is generated. In particular, the development of 5G networks and edge computing will accelerate this phenomenon. However, according to these trends, network malicious behaviors and traffic overloads are also frequently occurring. To solve these problems, network administrators need to build a network management system to implement a high-speed network and should know exactly about the connection topology of network devices through the network management system. However, the existing network topology discovery method is inefficient because it is passively managed by an administrator and it is a time consuming task. Therefore, we proposes a method of network topology discovery according to the amount of in and out network traffic. The proposed method is applied to a real network to verify the validity of this paper.

An Intra-domain Network Topologyd Discovery Algorithm (자치영역 네트워크 토플로지 작성 알고리즘)

  • Min, Gyeong-Hun;Jang, Hyeok-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.4
    • /
    • pp.1193-1200
    • /
    • 2000
  • A network topology has been an important factor for an efficient network management, but data collection for the network configuration has been done manually or semi automatically by a network administrator or an expert. Requirements to generate an intro-domain network topology ar usually either all IP addresses with subne $t^ernet mask or the network identification of all IP addresses. The amounts of traffic are generally high in the semi-automatic system due to using large number of low-level protocols and commands to get rather simple data. In this paper, we propose an algorithm which can be executed with only publicly available input. It can find all IP addresses as well as the network boundary of an intra-domain by using an intelligent method developed in this algorithm. The collected data will be used to draw a network map automatically by using a proposed network topology generation algorithm.hm.

  • PDF

GA-based Two Phase Method for a Highly Reliable Network Design (높은 신뢰도의 네트워크 설계를 위한 GA 기반 두 단계 방법)

  • Jo, Jung-Bok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.5
    • /
    • pp.1149-1160
    • /
    • 2005
  • Generally, the network topology design problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size, is characterized as a kind of NP-hard combinatorial optimization problem. The problem of this research is to design the highly reliable network topology considering the connection cost and all-terminal network reliability, which can be defined as the probability that every pair of nodes can communicate with each other. In order to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability, we proposes an efficient two phase approach to design reliable network topology, i.e., the first phase employs, a genetic algorithm (GA) which uses $Pr\ddot{u}fer$ number for encoding method and backtracking Algorithm for network reliability calculation, to find the spanning tree; the second phase is a greedy method which searches the optimal network topology based on the spanning ree obtained in the first phase, with considering 2-connectivity. finally, we show some experiments to demonstrate the effectiveness and efficiency of our two phase approach.

Wavelength Assignment Algorithms fora Multihop Lightwave Network

  • Seo, Jun-Bae;Seo, Hyun-Hwa;Lee, Hyong-Woo;Cho, Choong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6B
    • /
    • pp.523-532
    • /
    • 2003
  • GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

A Multi-hop routing protocol for bluetooth devices (블루투스 멀티 홉 라우팅 프로토콜)

  • Yang, Il-Sik;Kim, Myung-Gyu;Son, Ji-Yeon;Park, Jun-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.448-450
    • /
    • 2005
  • A ubiquitous network allows all users to access and exchange information of any kind freely at any time, from anywhere, and from any appliance through the use of broadband and mobile access. Bluetooth commincation can provide the missing wireless extension to the heterogeneous network, allowing a more ubiquitous access. In this point of view, the BT specifications define ways for which each BT device can set up multiple connections with neighboring devices to communicate in a multi-hop fashion. this paper provides insights on the Bluetooth technology and on some limitations of the scatternet formations. so that, we describe a new multi-hop routing protocol for the establishment of scatternets. this protocol defines rules for forming a multi-hop topology in two phases. the first phase, topology discovery, concerns the discovery of the node's depth from a root node initiating inquiry process. the second phase forms scatternet topology based on the result of topology discovery.

  • PDF

A Multi-Chain Based Hierarchical Topology Control Algorithm for Wireless Sensor Networks

  • Tang, Hong;Wang, Hui-Zhu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3468-3495
    • /
    • 2015
  • In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.