• Title/Summary/Keyword: Traffic routing

Search Result 641, Processing Time 0.039 seconds

Vital Sign Monitoring System with Routing and Query of Wireless Sensor Node on Mobile Environment (모바일 환경에서 질의응답이 가능한 무선센서노드 라우팅 생체신호 모니터링 시스템)

  • Lee, Seung-Chul;Toh, Sing-Hui;Do, Kyeong-Hoon;Chung, Wan-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.357-360
    • /
    • 2008
  • Vital sign monitoring system using IEEE 502.IS.4 based wireless sensor network(WSN) is designed and developed on mobile environment and sensor node platform. WSN and CDMA are integrated to create a wide coverage to support various environments like inside and outside. We developed query processor to use selective any devices(ECG, Blood pressure and sugar module) and control of the self-organizing network of sensor nodes in a wireless sensor network. Vital sign from wireless medical any devices are analysed in cell phone first for real time signal analyses and the abnormal vital signs are sent and save to hospital server for detail signal processing. wireless signal traffic in wireless sensor network environment or data communication inside the cell phone is reduced.

  • PDF

Proactive Network Optimizer for Critical Applications (크리티컬한 응용을 위한 능동형 네트워크 최적화기)

  • Park, Bongsang;Park, Pangun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.9
    • /
    • pp.1250-1256
    • /
    • 2018
  • Recently, wireless networks are becoming an important infrastructure for the critical large-scale applications such as cyber-physical systems and next generation industrial automations. However, the fundamental performance uncertainty of wireless networks may incur the serious instability problem of the overall systems. This paper proposes the proactive network optimizer to guarantee the application demands without any real-time link monitoring information of the networks. In particularly, the proposed proactive optimizer is the cross-layer approach to jointly optimize the routing path and traffic distribution in order to guarantee the performance demand within a maximum k number of link faults. Through the simulations, the proposed proactive network optimizer provides better robustness than the traditional existing reactive networks. Furthermore, the proactive network does not expose to the major weakness of the reactive networks such as the performance degradation due to the erroneous link monitoring information and the network reconfiguration cost.

A Study on the Design of Switch for High Speed Internet Communication Network (고속 인터넷 통신망을 위한 스위치 설계에 관한 연구)

  • 조삼호
    • Journal of Internet Computing and Services
    • /
    • v.3 no.3
    • /
    • pp.87-93
    • /
    • 2002
  • A complex network and a parallel computer are made up of interconnected switching units. The role of a switching unit is to set up a connection between an input port and an output port, according to the routing information. We proposed our switching network with a remodeled architecture is a newly modified Banyan network with eight input and output ports. We have analysed the maximum throughput of the revised switch. Our analyses have shown that under the uniform random traffic load, the FIFO discipline is limited to 70%, The switching system consists of an input control unit, a switch unit and an output control unit. Therefore the result of the analyses shows that the results of the networking simulation with the new switch are feasible and if we adopt the new architecture of the revised model of the Banyan switch, the hardware complexity can be reduced. The FIFO discipline has increased by about 11% when we compare the switching system with the input buffer system. We have designed and verified the switching system in VHDL using Max+plusII. We also designed our test environment including micro computers, the base station, and the proposed architecture. We proposed a new architecture of the Banyan switch for BISDN networks and parallel computers.

  • PDF

Tier-based Proactive Path Selection Mode for Wireless Mesh Networks

  • Fu-Quan, Zhang;Joe, In-Whee;Park, Yong-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.5
    • /
    • pp.1303-1315
    • /
    • 2012
  • In the draft of the IEEE 802.11s standard, a tree topology is established by the proactive tree-building mode of the Hybrid Wireless Mesh Protocol (HWMP). It is used for cases in which the root station (e.g., gateway) is an end point of the majority of the data connections. In the tree topology, the root or central stations (e.g., parent stations) are connected to the other stations (e.g., leaves) that are one level lower than the central station. Such mesh stations are likely to suffer heavily from contention in bottleneck links when the network has a high traffic load. Moreover, the dependence of the network on such stations is a point of vulnerability. A failure of the central station (e.g., a crash or simply going into sleep mode to save energy) can cripple the whole network in the tree topology. This causes performance degradation for end-to-end transmissions. In a connected mesh topology where the stations having two or more radio links between them are connected in such a way that if a failure subsists in any of the links, the other link could provide the redundancy to the network. We propose a scheme to utilize this characteristic by organizing the network into concentric tiers around the root mesh station. The tier structure facilitates path recovery and congestion control. The resulting mode is referred to as Tier-based Proactive Path Selection Mode (TPPSM). The performance of TPPSM is compared with the proactive tree mode of HWMP. Simulation results show that TPPSM has better performance.

Multiobjective Routing and Scheduling for Vehicles Transporting Hazardous Materials (위험물 운송차량의 다목적 경로 및 스케줄 관리 방안)

  • Sin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.5
    • /
    • pp.161-172
    • /
    • 2007
  • Vehicles transporting hazardous materials can make huge damage to people, properties and environment by traffic accidents. Therefore, transporting hazardous materials is a big issue with the cutting edge technology of communications in these days. However, despite this situation, Korean government gives limited efforts for systematic management, research and investment about hazardous materials. Accordingly, this research suggests the key path finding algorithm about management of real-time schedule and routes for vehicles transporting hazardous materials. Besides, the case study is progressed in transportation networks of Seoul in order to evaluate the reality of algorithm. Specifically, time-space network transformation is performed for time window attributes. In addition, this study proposes the techniques searching for non-dominated paths considering schedule by the multiobjective shortest path algorithm based on dynamic programming in dynamic transportation networks including multiobjective attributes.

Efficient Multicast Routing on BCube-Based Data Centers

  • Xie, Junjie;Guo, Deke;Xu, Jia;Luo, Lailong;Teng, Xiaoqiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4343-4355
    • /
    • 2014
  • Multicast group communication has many advantages in data centers and thus is widely used by many applications. It can efficiently reduce the network traffic and improve the application throughput. For the multicast application in data centers, an essential problem is how to find a minimal multicast tree, which has been proved to be NP-hard. In this paper, we propose an approximation tree-building method for the minimal multicast problem, named HD(Hamming Distance)-based multicast tree. Consider that many new network structures have been proposed for data centers. We choose three representative ones, including BCube, FBFLY, and HyperX, whose topological structures can be regarded as the generalized hypercube. Given a multicast group in BCube, the HD-based method can jointly schedule the path from each of receiver to the only sender among multiple disjoint paths; hence, it can quickly construct an efficient multicast tree with the low cost. The experimental results demonstrate that our method consumes less time to construct an efficient multicast tree, while considerably reduces the cost of the multicast tree compared to the representative methods. Our approach for BCube can also be adapted to other generalized hypercube network structures for data centers after minimal modifications.

A Simulation Model for an ALV System at a Container Terminal (컨테이너 터미널의 ALV 시스템을 위한 시뮬레이션 모형)

  • Bae, Jong-Wook;Choi, Sang-Hee;Kim, Chang-Hyun;Park, Soon-O
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.29-39
    • /
    • 2008
  • Recently, an ALV (Automated Lifting Vehicle) is studied as an efficient transporter, which can reduce the waiting time during ship operation in a container terminal. There are little of studies on an ALV system considering dynamic factors after analysing the cooperation between equipments. The performance of an ALV depends on self-loading & unloading of an ALV, vehicle’s interference, and occupancy of an available transfer point under dynamic environment. So, it is very difficult to evaluate the productivity of a container terminal with an ALV system. Therefore the simulation model with operational rules that be apt for an ALV system must be developed. Also the model has to consider the characteristics of interface operations and vehicle traffic. Supposing an container terminal with perpendicular layout, this study analyses the process of container handling operation and proposes operational rules such as the ALV dispatching, routing algorithm and so on for a model. We developed a simulation model for a container terminal with an ALV system using object-oriented simulation software, Anylogic.

  • PDF

Design and Implementation of an Automated Inter-connection Tool for Multi-Point OpenFlow Sites (다지점 오픈플로우 사이트들을 위한 자동화된 연동 도구의 설계 및 구현)

  • Na, TaeHeum;Kim, JongWon
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.1-12
    • /
    • 2015
  • To realize futuristic services with agility, the role of the experimental facility (i.e., testbed) based on integrated resources has become important, so that developers can flexibly utilize the dynamic provisioning power of software-defined networking and cloud computing. Following this trend, an OpenFlow-based SDN testbed environment, denoted as OF@TEIN, connects multiple sites with unique SmartX Racks (i.e., virtualization-enabled converged resources). In this paper, in order to automate the multi-point L2 (i.e., Ethernet) inter-connection of OpenFlow islands, we introduce an automated tool to configure the required Network Virtualization using Generic Routing Encapsulation (NVGRE) tunneling. With the proposed automation tool, the operators can efficiently and quickly manage network inter-connections among multiple OpenFlow sites, while letting developers to control their own traffic flows for service realization experiments.

Structure Analysis of Optical Internet Network and Optical Transmission Experiments Using UNI Signaling Protocol (광인터넷망 구조 분석과 UNI 시그널링 프로토콜을 이용한 광전송 실험)

  • Lee, Sang-Wha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.10
    • /
    • pp.47-54
    • /
    • 2013
  • In this paper, the structural design of optical Internet is analyzed and by using UNI (User Network Interface) signaling protocol an optical transmission experiment was performed. The hierarchical structure of the basic optical Internet consists of the backbone network, the service network and the access network. The necessary functions for each layer were described as follows: Control structure of the optical transport layer, network operation and management structure, internetworking technology of sub networks, routing and signaling technology. By using UNI signaling protocol from OIF (Optical Internetworking Forum), the optical transmission in the proposed structure of the optical Internet network was experimented. By the traffic generation of LSP (Label Switched Path) data packets along the route-configuration was delivered to UNI. Finally, by showing the value of TCP (Transmission Control Protocol) packets the optical transmission was completely and successfully demonstrated.

A Multicast-based Mobility Support Scheme in IPv6 Networks (IPv6 네트워크에서 멀티캐스트 기반 이동성 제공 방안)

  • Woo Mi ae;Jun Hong sun;Park Ho hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.210-217
    • /
    • 2005
  • With rapid advance in wireless communication technologies, many researches are conducted for providing Internet data services while users are roaming around. Efficient management of mobility of mobile nodes is essential as the use of real-time application program grows. In this paper, we propose a multicast-based localized mobility support scheme in IPv6 networks. The proposed scheme utilizes a class of multicast routing protocol for the localized mobility support. Features of the proposed scheme are use of join to a multicast group and leave from that group to localize binding update information and provision of an extended multicast group management mechanism to reduce leave latency. The results of simulation show that the proposed scheme out-performs Mobile IPv6 and Hierarchical Mobile IPv6 in UDP and TCP traffic performance and in wasted bandwidth.