• Title/Summary/Keyword: Physical topology

Search Result 133, Processing Time 0.02 seconds

A Genetic Algorithm Based Source Encoding Scheme for Distinguishing Incoming Signals in Large-scale Space-invariant Optical Networks

  • Hongki Sung;Yoonkeon Moon;Lee, Hagyu
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.2
    • /
    • pp.151-157
    • /
    • 1998
  • Free-space optical interconnection networks can be classified into two types, space variant and space invariant, according to the degree of space variance. In terms of physical implementations, the degree of space variance can be interpreted as the degree of sharing beam steering optics among the nodes of a given network. This implies that all nodes in a totally space-invariant network can share a single beam steering optics to realize the given network topology, whereas, in a totally space variant network, each node requires a distinct beam steering optics. However, space invariant networks require mechanisms for distinguishing the origins of incoming signals detected at the node since several signals may arrive at the same time if the node degree of the network is greater than one. This paper presents a signal source encoding scheme for distinguishing incoming signals efficiently, in terms of the number of detectors at each node or the number of unique wavelengths. The proposed scheme is solved by developing a new parallel genetic algorithm called distributed asynchronous genetic algorithm (DAGA). Using the DAGA, we solved signal distinction schemes for various network sizes of several topologies such as hypercube, the mesh, and the de Brujin.

  • PDF

Finite Element Analysis of Two-Dimensional Cold Forging By Using Modular Remeshing and Expert System (단위체 격자 재구성법과 전문가 시스템을 이용한 2차원 냉간 단조의 유한 요소 해석)

  • Yun, Hui-Do;Kim, Yeong-Tae;Lee, Nak-Gyu;Yang, Dong-Yeol;Lee, Byeong-Chae
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.9 no.3
    • /
    • pp.83-101
    • /
    • 1992
  • A systematic method of remeshing is required due to severe mesh distortion after some finite deformation in the finite element analysis of practical forging processes. In order to cope with the problem of mesh degeneracy during deformation, the proper design of meshes plays an improtant role in the analysis. In so-called "Modular Remeshing", the physical characteristics of metal flow and geometric characteristics are incorporated in "Module", which can be applied to the mesh design for a certain mode of deformation in so far as the topology of deforming region remains the same. For the purpose of more effective and systematic use of the modular remeshing scheme, an expert system has been developed in the framework of the proposed remeshing schemel. In oredr to show the effectiveness of the method, the rib-web type forging with axial relief or radial relief and spike forging are simulated. It has been thus shown that the proposed method of automatic remeshing by using modular remeshing and expert system can be futher extended and applied to various forging problems with complicated geometrical configurations.ical configurations.

  • PDF

A Study of Protocol comparison Analysis for MPLS Traffic Engineering (MPLS 트래픽 엔지니어링을 위한 프로토콜 비교 분석에 관한 연구)

  • Ha Yun-sik;Kim Dong-il;Choi Sam-gil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.4
    • /
    • pp.772-776
    • /
    • 2005
  • To support abruptly increasing data traffic in these days, network management is needed. And also to maintain the steady infra, there is MPLS need which can support traffic engineering. It's necessary that MPLS doesn't only manage network to support recently booming data traffic, but has capacity to support traffic engineering to keep static infrastructure. Traffic engineering, method that a large-scale user shifts traffic to the beforehand designated routes that pass through specific nodes on network, is operation that is mapping traffic flow to the physical network topology. In this paper, we supplement the defect of the traditional RSVP traffic engineering and to construct far more steady infra, we suggest the way of its development of ERSVP signaling protocol.

Medium Voltage Power Supply with Enhanced Ignition Characteristics for Plasma Torches

  • Jung, Kyung-Sub;Suh, Yong-Sug
    • Journal of Power Electronics
    • /
    • v.11 no.4
    • /
    • pp.591-598
    • /
    • 2011
  • This paper investigates a power supply of medium voltage with enhanced ignition characteristics for plasma torches. A series resonant half-bridge topology is presented as a suitable ignition circuitry. The ignition circuitry is integrated into the main power conversion system of a multi-phase staggered three-level dc-dc converter with a diode front-end rectifier. A plasma torch rated at 3MW, 2kA and having a physical size of 1m is selected to be the high enthalpy source for a waste disposal system. The steady-state and transient operations of a plasma torch are simulated. The parameters of a Cassie-Mary arc model are calculated based on 3D magneto-hydrodynamic simulations. The circuit simulation waveform shows that the ripple of the arc current can be maintained within ${\pm}10%$ of its rated value under the presence of a load disturbance. This power conversion configuration provides a high enough ignition voltage, around 5KA, during the ignition phase and high arc stability under the existence of arc disturbance noise resulting in a high-performance plasma torch system.

An Effective Multi-hop Relay Algorithm in Wireless Mesh Network (무선 메쉬 네트워크 환경에서 효율적인 다중 홉 전달 기법)

  • Kim, Young-An;Park, Chul-Hyun;Hong, Choong-Seon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10B
    • /
    • pp.872-882
    • /
    • 2006
  • The Wireless Mesh Network uses a wireless communication technology with transmission rates similar to that of a cable, which is used as a backbone network. The topology structure is in a Mesh form which resembles an Ad-hoc network, however a metric is needed in order to set the channel and channel methods since the operation intentions and interior motions are different. This thesis proposes a metric(ETR : Expected Transmission Rate) that sets the channel with physical link performance and multi hop transmission capabilities. This metric will also be based on multi channel creation methods and Hop-by-hop routing techniques for an effective multi hop transmission with no loops.

WORM-HUNTER: A Worm Guard System using Software-defined Networking

  • Hu, Yixun;Zheng, Kangfeng;Wang, Xu;Yang, Yixian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.484-510
    • /
    • 2017
  • Network security is rapidly developing, but so are attack methods. Network worms are one of the most widely used attack methods and have are able to propagate quickly. As an active defense approach to network worms, the honeynet technique has long been limited by the closed architecture of traditional network devices. In this paper, we propose a closed loop defense system of worms based on a Software-Defined Networking (SDN) technology, called Worm-Hunter. The flexibility of SDN in network building is introduced to structure the network infrastructures of Worm-Hunter. By using well-designed flow tables, Worm-Hunter is able to easily deploy different honeynet systems with different network structures and dynamically. When anomalous traffic is detected by the analyzer in Worm-Hunter, it can be redirected into the honeynet and then safely analyzed. Throughout the process, attackers will not be aware that they are caught, and all of the attack behavior is recorded in the system for further analysis. Finally, we verify the system via experiments. The experiments show that Worm-Hunter is able to build multiple honeynet systems on one physical platform. Meanwhile, all of the honeynet systems with the same topology operate without interference.

Assessing Resilience of Inter-Domain Routing System under Regional Failures

  • Liu, Yujing;Peng, Wei;Su, Jinshu;Wang, Zhilin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1630-1642
    • /
    • 2016
  • Inter-domain routing is the most critical function of the Internet. The routing system is a logical network relying on the physical infrastructure with geographical characteristics. Nature disasters or disruptive accidents such as earthquakes, cable cuts and power outages could cause regional failures which fail down geographically co-located network nodes and links, therefore, affect the resilience of inter-domain routing system. This paper presents a model for regional failures in inter-domain routing system called REFER for the first time. Based on REFER, the resilience of the inter-domain routing system could be evaluated on a finer level of the Internet, considering different routing policies of intra-domain and inter-domain routing systems. Under this model, we perform simulations on an empirical topology of the Internet with geographical characteristics to simulate a regional failure locating at a city with important IXP (Internet eXchange Point). Results indicate that the Internet is robust under a city-level regional failure. The reachability is almost the same after the failure, and the reroutings occur at the edge of the Internet, hardly affecting the core of inter-domain routing system.

A deadlock-Free Fault-Tolerant routing Method Using Partial-Adaptiveness in a N-Dimensional Meshed Network (N-차원 메쉬 네트워크에서의 부분적 적응성을 이용한 Deadlock-Free 결함포용 라우팅 기법)

  • Mun, Dae-Geun;Gam, Hak-Bae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1090-1097
    • /
    • 1999
  • the multi computers operated in harsh environments should be designed to guarantee normal operations in the presence of the component faults. One solution for this is a fault-tolerant routing. In the paper, we consider n-dimensional meshed network for the basic topology and propose a simple fault-tolerant routing algorithm that can transfer messages to their destination as desired in the presence of some component faults. the built algorithms basically adopts a WormHole(WH) routing method and uses the virtual channels sharing a physical channel for deadlock-freedom. Consequently, we show that the suggested algorithm has a higher performance than the X-Y routing algorithm through simulation results.

  • PDF

A Design of Routing Path and Wavelength Assignment with Minimum Number of Wavelengths in WDM Optical Transport Network (WDM 광전달망에서 최소 파장 수를 갖는 경로설계 및 파장할당)

  • 박구현;우재현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.8
    • /
    • pp.1883-1892
    • /
    • 1998
  • This paper considers the efficient design of routing path and wavelength assignment asignment in the sigle-hop WDM optical transport networks. The connecton demands between node-pairs are given and a connection must be made by only one lightpath. It is assumed that no wavelength conversion is allowed and the physical topology of the network is given. This paper proposes a method to find the routes of lightpaths and assign wavelengths to the routes, which minimizes the number of total wavelength to satisfy all connection demands. We establish a new optimization model that finds the minimum number of wavelengths. A heuristic algorithm with polynomial iterations is developed for the problem. The algorithm is implemented and applied to the netowrks with real problem size. The results of the application are compared with the commericial optimization solver, GAMS/OSL and Wauters & Demeester [8].

  • PDF

Location-based Routing Mechanism for Route Discovery (Low-Rate WPAN에서 경로탐색을 위한 위치기반 라우팅 메카니즘)

  • Lee, Jae-Jo;Heo, Joon;Hong, Choong-Seon;Lee, Dae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9B
    • /
    • pp.808-817
    • /
    • 2004
  • Many researchers are now working in the Low-Rate WPAN environment. Low-Rate WPAN has as its goal the enhancing computer use by making many sensors available throughout the physical environment, but making them effectively invisible to the user. Low-Rate WPAN environment consists of wireless sensor devices that may move often. Movement of hosts results in a change in routes and the need of some mechanism for determining new routes. This paper suggests an approach to utilize location information to improve performance of a routing mechanism for Low-Rate WPAN Environment. Accordingly, we proved that the proposed mechanism results in a significant reduction in a number of routing messages when comparing with existing mechanisms.