• Title/Summary/Keyword: Router

Search Result 832, Processing Time 0.023 seconds

The Beacon Frame-Based Node Grouping Algorithm for Improving the Performance between MCT devices in the Home Wireless Network (가정 무선 네트워크 내 MCT 디바이스 간 성능 향상을 위한 Beacon frame 기반 노드 그룹화 알고리즘)

  • Kim, Gyu-Do;Kown, Young-Ho;Rhee, Byung-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2015.10a
    • /
    • pp.787-790
    • /
    • 2015
  • Recently, M2M (Machine to Machine) communication is possible the development of MTC (Machine Type Communication) devices becomes active. MCT devices in the form of home appliances have a low power consumption, low cost, short-range wireless communication in wireless home network. For purpose, MTC devices based on IEEE 802.15.4/Zigbee are composed in the form of cluster-tree topology, which consists of one PAN (Personal Area Network), one or other router and end of nodes. It happens that transmission delay, packet drop, and lacking data resulted from collision originated by a competition for allocating channels among MTC devices that greatly increased. At last performance of entire network can be degradated. This paper proposes that the beacon frame-based grouping algorithm using multiple channels in a MTC devices in the presence of wireless home network interference. The proposed algorithm decreases the transmission delay, dropped packet and throughput is more increase, so the proposal algorithm is more efficient than the IEEE 802.15.4/ Zigbee standard.

  • PDF

An Algorithm for Efficient use of Label Space over MPLS Network with Multiple Disconnent Timers (MPLS 망에서 복수 연결해제 타이머를 이용한 레이블 공간의 효율적 사용방법)

  • Lee, Sun-Woo;Byun, Tae-Young;Han, Ki-Jun;Jeong, Youn-Kwae
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.1
    • /
    • pp.24-30
    • /
    • 2002
  • Label switching technology is currently emerging as a solution for the rapidly growing of Internet traffic demand. Multiprotocol label switching(MPLS) is one of the standards made by the Internet Engineering Task Force(IETE) intended to enhance speed, scalability, and inter-opearability between label switching technologies. In MPLS, utilization of label space is a very important factor of network performance because labels are basic unit in packet switching. We propose a algorithm to effectively use label space by a multiple disconnect timer at the label switching router. Our algorithm is based on multiple utilization of the connection release timer over the MPLS network with multiple domains. In our algorithm, a relatively linger timeout interval is assigned to the traffic with higher class by the aid of the packet classifier. This reduces delay for making a new connection and also reduces the amount of packets which will be routed to the layer 3. Simulation results shows that reduction of required label number in MPLS network and this indicate our algorithm offers better performance than the existing ones in term of utilization of label space.

Development of a Moving Monitor System for Growing Crops and Environmental Information in Green House (시설하우스 이동형 환경 및 생장 모니터링 시스템 개발)

  • Kim, Ho-Joon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.9 no.3
    • /
    • pp.285-290
    • /
    • 2016
  • In rural area, our farmers confront decreasing benefits owing to imported crops and increased cost. Recently, the government encourage the 6th Industry that merges farming, rural resources, and information and communication technology. Therefor the government makes an investment in supplying 'smart greenhouse' in which a farmer monitor growing crops and environment information to control growing condition. The objective of this study is developing an Moving Monitor and Control System for crops in green House. This system includes a movable sensing unit, a controlling unit, and a server PC unit. The movable sensing unit contains high resolution IP camera, temperature and humidity sensor and WiFi repeater. It rolls on a rail hanging beneath the ceiling of a green house. The controlling unit contains embedded PC, PLC module, WiFi router, and BLDC motor to drive the movable sensing unit. And the server PC unit contains a integrated farm management software and home pages and databases in which the images of crops and environment informations. The movable sensing unit moves widely in a green house and gathers lots of information. The server saves these informations and provides them to customers with the direct commercing web page. This system will help farmers to control house environment and sales their crops in online market. Eventually It will be helpful for farmers to increase their benefits.

A Traffic Management Scheme for the Scalability of IP QoS (IP QoS의 확장성을 위한 트래픽 관리 방안)

  • Min, An-Gi;Suk, Jung-Bong
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.375-385
    • /
    • 2002
  • The IETF has defined the Intserv model and the RSVP signaling protocol to improve QoS capability for a set of newly emerging services including voice and video streams that require high transmission bandwidth and low delay. However, since the current Intserv model requires each router to maintain the states of each service flow, the complexity and the overhead for processing packets in each rioter drastically increase as the size of the network increases, giving rise to the scalability problem. This motivates our work; namely, we investigate and devise new control schemes to enhance the scalability of the Intesev model. To do this, we basically resort to the SCORE network model, extend it to fairly well adapt to the three services presented in the Intserv model, and devise schemes of the QoS scheduling, the admission control, and the edge and core node architectures. We also carry out the computer simulation by using ns-2 simulator to examine the performance of the proposed scheme in respects of the bandwidth allocation capability, the packet delay, and the packet delay variation. The results show that the proposed scheme meets the QoS requirements of the respective three services of Intserv model, thus we conclude that the proposed scheme enhances the scalability, while keeping the efficiency of the current Intserv model.

A study on improving fairness and congestion control of DQDB using buffer threshold value (버퍼의 문턱치값을 이용한 DQDB망의 공평성 개선 및 혼잡 제어에 관한 연구)

  • 고성현;조진교
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.618-636
    • /
    • 1997
  • DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

  • PDF

A Priority Based Multipath Routing Mechanism in the Tactical Backbone Network (전술 백본망에서 우선순위를 고려한 다중 경로 라우팅 방안)

  • Kim, Yongsin;Shin, Sang-heon;Kim, Younghan
    • Journal of KIISE
    • /
    • v.42 no.8
    • /
    • pp.1057-1064
    • /
    • 2015
  • The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.

An Efficient SVC Transmission Method in an If Network (IP 네트워크 전송에 적합한 효율적인 SVC 전송 기법)

  • Lee, Suk-Han;Kim, Hyun-Pil;Jeong, Ha-Young;Lee, Yong-Surk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.4B
    • /
    • pp.368-376
    • /
    • 2009
  • Over recent years, the development of multimedia devices has meant that a wider multimedia streaming service can be supported, and there are now many ways in which TV channels can communicate with different terminals. Generally, scalable video streaming is known to provide more efficient channel capacity than simulcast video streaming. Simulcast video streaming requires a large network bandwidth for all resolutions, but scalable video streaming needs only one flow for all resolutions. On the contrary, to preserve the same video quality, SVC(Sealable Video Coding) needs a higher bit-rate than AVC(non-layered Video Coding) due to the coding penalty($10%{\sim}30%$). In previous research, scalable video streaming has been compared with simulcast video streaming for network channel capacity, in two-user simulation environments. The simulation results show that the channel capacity of SVC is $16{\sim}20%$ smaller than AVC, but scalable video streaming is not efficient because of the limit of the present network framework. In this paper, we propose a new network framework with a new router using EDE(Extraction Decision Engine) and SVC Extractor to improve network performance. In addition, we compare the SVC environment in the proposed framework with previous research on the same way subject. The proposed network framework shows a channel capacity 50%(maximum) lower than that found in previous research studies.

A Visualization Technique of Inter-Device Packet Exchanges to Test DLNA Device Interoperability (DLNA 기기의 상호운용성 시험을 위한 패킷교환정보 시각화 방법)

  • Kim, Mijung;Jin, Feng;Yoon, Ilchul
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.10a
    • /
    • pp.531-534
    • /
    • 2014
  • DLNA is an established industry standard which supports contents sharing among smart devices in home wired- and wireless-network environment and is well known in Korea as Allshare or Smartshare. The DLNA standard is implemented as built-in services in most of Android smart phones and tablets. In addition to the handheld devices, DLNA service can also be employed in speakers, printers, and so on. However, users have reported many interoperability issues between DLNA devices. Developers typically identify causes by analyzing the packet exchange information between devices. However, this approach costs them to put additional effort to filter relevant packets, to reconstruct packet exchange history and the protocol flow. Consequently, it ends up with increased development time. In this paper, we demonstrate a technique to automatically analyze and visualize the packet exchange history. We modified a router firmware to capture and store packets exchanged between DLNA devices, and then analyze and visualize the stored packet exchange history for developers. We believe that visualized packet exchange history can help developers to test the interoperability between DLNA devices with less effort, and ultimately to improve the productivity of developers.

  • PDF

Study on the Quantitative Analysis of the Major Environmental Effecting Factors for Selecting the Railway Route (철도노선선정에 영향을 미치는 주요환경항목 정량화에 관한 연구)

  • Kim, Dong-ki;Park, Yong-Gul;Jung, Woo-Sung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.29 no.6D
    • /
    • pp.761-770
    • /
    • 2009
  • The energy efficiency and environment-friendly aspect of the railway system would be superior to other on-land ransportation systems. In a preliminary feasibility study stage and selection of optimal railway route, the energy efficiency and problems related to environment are usually considered. For the selection of optimal railway route, geographical features and facility of management are generally considered. Environment effect factors for the selection of environment-friendly railway router are focused and studied in this paper. In this study, various analysis of opinion of specialists (railway, environment, transport, urban planning, survey) and the guideline for construction of environment-friendly railway were accomplished. From these results of various analysis, 7 major categories (topography/geology, flora and fauna, Nature Property, air quality, water quality, noise/vibration, visual impact/cultural assets) were extracted. To select environment friendly railway route, many alternatives should be compared optimal route must be selected by a comprehensive assessment considering these 7 categories. To solve this problem, the selected method was AHP which simplifies the complex problems utilizing hierarchy, quantifying qualitative problems through 1:1 comparison, and extracting objective conclusions by maintaining consistency. As a result, a GUIbased program was developed which provides basic values of weighted parameters of each category defined by specialists, and a quantification of detailed assessment guidelines to ensures consistency.

Index-based Searching on Timestamped Event Sequences (타임스탬프를 갖는 이벤트 시퀀스의 인덱스 기반 검색)

  • 박상현;원정임;윤지희;김상욱
    • Journal of KIISE:Databases
    • /
    • v.31 no.5
    • /
    • pp.468-478
    • /
    • 2004
  • It is essential in various application areas of data mining and bioinformatics to effectively retrieve the occurrences of interesting patterns from sequence databases. For example, let's consider a network event management system that records the types and timestamp values of events occurred in a specific network component(ex. router). The typical query to find out the temporal casual relationships among the network events is as fellows: 'Find all occurrences of CiscoDCDLinkUp that are fellowed by MLMStatusUP that are subsequently followed by TCPConnectionClose, under the constraint that the interval between the first two events is not larger than 20 seconds, and the interval between the first and third events is not larger than 40 secondsTCPConnectionClose. This paper proposes an indexing method that enables to efficiently answer such a query. Unlike the previous methods that rely on inefficient sequential scan methods or data structures not easily supported by DBMSs, the proposed method uses a multi-dimensional spatial index, which is proven to be efficient both in storage and search, to find the answers quickly without false dismissals. Given a sliding window W, the input to a multi-dimensional spatial index is a n-dimensional vector whose i-th element is the interval between the first event of W and the first occurrence of the event type Ei in W. Here, n is the number of event types that can be occurred in the system of interest. The problem of‘dimensionality curse’may happen when n is large. Therefore, we use the dimension selection or event type grouping to avoid this problem. The experimental results reveal that our proposed technique can be a few orders of magnitude faster than the sequential scan and ISO-Depth index methods.hods.