• Title/Summary/Keyword: Link information

Search Result 3,902, Processing Time 0.032 seconds

Frame Distribution Methods for Link Aggregation between 10GbE Switches (10GbE 스위치간 링크 집합을 위한 프레임 분배방식)

  • 이호영;이숭희;이종협
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.12A
    • /
    • pp.945-950
    • /
    • 2003
  • The link aggregation between 10GbE switches requires an advanced frame distribution method to be properly and efficiently applied. The fixed or dynamic frame distribution methods, formerly proposed, cannot fully utilize the aggregated links, where the receiving terminal only attaches to a pre-specified link among multiple physical links. A frame distribution method using tagging is proposed for the link aggregation between 10GbE switches to solve this problem. We compared the performance of the proposed method with those of the fixed and dynamic frame distribution methods. As a result, the proposed method shows a better performance when the applied load is below 0.7 and the average length of the frames is longer than 954 bytes.

Study on OSPF Routing Cost Functions for Wireless Environments (무선 환경을 고려한 OSPF 라우팅 비용함수 연구)

  • Shin, Dong Wook;Lee, Seung Hwan;Rhee, Seung Hyong;Lee, Hyung-Joo;Hoh, Mi-Jeong;Choi, Jeung-Won;Shin, Sang-Heon;Kim, Tae-Wan;Moon, Ho-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.9
    • /
    • pp.829-840
    • /
    • 2012
  • Recently, in network communication environments, it is changing very fast from wired to wireless. The open shortest path firtst (OSPF), one of link state routing protocols, mainly used in wired networks, is the routing method to select optimal traffic path as identifying the link state of neighbor routers. The traditional OSPF cost functions performs with first fixed cost permanently, unless the router link is changed. However, in wireless networks, the performance of links show big difference by other environment factors. The bit error rate (BER), a parameter which can quite affect link state in wireless networks, is not considered in the traditional OSPF cost functions. Only a link bandwidth is considered in the traditional OSPF cost functions. In this paper, we verify the various parameters which can affect link performance, whether it is permissible to use as the parameter of proposed cost functions. To propose new cost functions, we use the effective bandwidth. This bandwidth is calculated by proposed formula using the BER of the network link and link bandwidth. As applied by the proposed triggering condition, the calculated effective bandwidth decrease the unstable of network by generating less link state update messages in wireless networks that frequently changes the link state. Simulation results show that the proposed cost functions significantly outperforms the traditional cost functions in wireless networks in terms of the services of VoIP and data transmission.

Link Travel Time Estimation and Evaluation of Applicability to Traffic Information Collection Based RFID Probe Data (RFID 기반의 통행시간 추정 기법 개발 및 교통정보수집 적용가능성 평가)

  • Shim, Sang-Woo;Choi, Kee-Choo;Lee, Kyun-Jin
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.6 no.2
    • /
    • pp.15-25
    • /
    • 2007
  • This paper aims at testing the applicability of RFID (radio frequency identification) based link travel time estimation algorithm in urban street settings in Jeju island Korea. For this, we developed algorithm and compared link travel times derived from the RFID probe based algorithm with those from (already available) GPS based link travel time estimation algorithm and with the actual link travel times from survey. RFID readers are composed of master reader and slave reader and the participating passenger cars were supposed to be equipped with RFID tag inside the vehicle. The data were sent to traffic information center and we used those data in comparison. The algorithm produced link travel times in a successful manner and the accuracy of those link travel times was about 88%. For the same link segments, the accuracy of GPS based link travel times was 93%. The t-test showed that both RFID and GPS based link travel times were not different in accuracy from statistical point of view. The applicability of RFID was tested successfully and the algorithm proposed seemed to be used in similar urban settings. Some limits and future research agenda have also been presented.

  • PDF

A Study on Non-participating TDL Message Analyzer (비가입형 TDL 메시지 분석기에 관한 연구)

  • Hwang, Byoung-Han;Lee, Jung-Woong
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.3
    • /
    • pp.290-294
    • /
    • 2018
  • Modern warfare exhibit a NCW (Network Centric Warfare) aspect through quick situation awareness and Command and Control. And Tactical messages operate on various tactical data links (TDLs). For monitoring TDL messages processed by data link processor(DLP), message analysers are generally developed as a component during system development. In addition, in order to forward TDL messages processed by DLP to the message anayzer, the interface messages between DLP and message analysers should be defined interface control document(ICD). We propose the methods using UDP or TCP packets provided by TDL layers that are delivered to DLP without communicating directly with DLP. Depending on TDL message standards and Interface Control Documents(ICDs), we design the message analyzer which communicates with data link processor using internal messages. Using known header field information from the TDL application standard such as JREAP-C, we can quickly filter candidate packets against collected packets and use the full data size information contained in the headers to verify the completed message. Because the methods proposed in this paper do not communicate directly with DLP, the methods proposed in this paper are enable to analyze the TDL application messages such as JREAP-C or Link-K without constraints in existing methods that should be reflected in the system configuration and ICD.

Analysis of FTIR Spectra in Organic Inorganic Hybrid Type SiOC Films (유무기 하이브리드 SiOC 박막의 화학적 이동에 대한 FTIR 스펙트라 분석)

  • Oh Teresa
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.6 s.336
    • /
    • pp.17-22
    • /
    • 2005
  • Organic-inorganic hybrid type thin films are the next generation candidates as low-k materials. SiOC films are analyzed the bonding structure by the red and blue chemical shift using the fourier transform infraredspectra. Conventional chemical shift of organic chemistry is a red shift, but hybrid type SiOC films were observed the red and blue shift. The chemical shift originates from the interaction between the C-H bond and high electronegative atoms, and the blue shift in SiOC films is caused by the porosity due to the increase of the electron rich group such as much methyl radicals. The bonding structures of SiOC films are also divided into the Si-O-C cross-link structure and the Si-O-C cage-link structure due to the chemical shifts. The Si-O-C cross-link structure progressed the adhesion attributed to the C-H bond elongation in the reason of the red shift, and the dielectric constant also decreases.

Bottleneck link bandwidth Measurement Algorithm for improving end-to-end transit delay in Grid network (그리드 네트워크에서 종단간 전송 지연 향상을 위한 bottleneck 링크 대역폭 측정 알고리즘)

  • Choi, Won-Seok;Ahn, Seong-Jin;Chung, Jin-Wook
    • The KIPS Transactions:PartC
    • /
    • v.10C no.7
    • /
    • pp.923-928
    • /
    • 2003
  • This paper proposes a bottleneck link bandwidth measurement algorithm for reducing packet transmission delay within the grid network. There are two methods for measuring bottleneck link bandwidth:Packet Pair algorithm and Paced Probes algorithm. They measure bottleneck link bandwidth using the difference in arrival times of two paced probe packets of the same size traveling from the same source to destination. In addition, they reduce the influences of cross traffic by pacer packet. But there are some problems on these algorithms:it's not possible to know where bottleneck link occurred because they only focus on measuring the smallest link bandwidth along the path without considering bandwidth of every link on the path. So hop-by-hop based bottleneck link bandwidth measurement algorithm can be used for reducing packet transmission delay on grid network. Timestamp option was used on the paced probe packet for the link level measurement of bottleneck bandwidth. And the reducing of packet transmission delay was simulated by the solving a bottleneck link. The algorithm suggested in this paper can contribute to data transmission ensuring FTP and realtime QoS by detecting bandwidth and the location where bottleneck link occurred.

Mobility Prediction Based Autonomous Data Link Connectivity Maintenance Using Unmanned Vehicles in a Tactical Mobile Ad-Hoc Network (전술 모바일 애드혹 네트워크에서 무인기를 이용하는 이동 예측 기반의 데이터 링크 연결 유지 알고리즘)

  • Le, Duc Van;Yoon, Seokhoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.1
    • /
    • pp.34-45
    • /
    • 2013
  • Due to its self-configuring nature, the tactical mobile ad hoc network is used for communications between tactical units and the command and control center (CCC) in battlefields, where communication infrastructure is not available. However, when a tactical unit moves far away from the CCC or there are geographical constraints, the data link between two communicating nodes can be broken, which results in an invalid data route from the tactical units to CCC. In order to address this problem, in this paper we propose a hierarchical connectivity maintenance scheme, namely ADLCoM (Autonomous Data Link Connectivity Maintenance). In ADLCoM, each tactical unit has one or more GW (gateway), which checks the status of data links between tactical units. If there is a possibility of link breakage, GWs request ground or aerial unmanned vehicles to become a relay for the data link. The simulation results, based on tactical scenarios, show that the proposed scheme can significantly improve the network performance with respect to data delivery ratio.

Modeling and Analysis of Link Initialization Access of RE-DSRC (RF-DSRC 링크초기접속 모델링 및 분석)

  • Lee Min-Heui;Kwag Su-Jin;Jung Jong-In;Lee Sang-Sun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.4 no.2 s.7
    • /
    • pp.23-31
    • /
    • 2005
  • ITS(Intelligent Transportation System) implementing information collection services and information support services for cars of moving fast needs a communication system of special aim such as RF-DSRC(Radio Frequency Dedicated Short Range Communication). Before RSE(Road Side Equipment) and OBE(On-Board Equipment) will be able to communicate RF-DSRC, OBE first have to request Link Initialization Access using ACTC(Activation Channel) in allocated ACTS(Activation Slot) by Slotted ALOHA. Even though Link Initialization Access is a important element to decide performance of communication system, optimal mathematic modeling study of Link Initialization Access which is adapted RF-DSRC characteristics is not enoush. So, in this paper, we propose mathematical modeling about Link Initialization Access of RF-DSRC. And then we computed Link Initialization Access probability defining offer load(G) which is adapted RF-DSRC characteristics for analyzing performance of modeling.

  • PDF

Optimal Link Length Design for Departure Time-based Link Travel Time Information (출발시각기준 링크통행시간 정보의 공간적 설계 (연속류를 중심으로))

  • Kim, Jae-Jin;No, Jeong-Hyeon;NamGung, Seong;Park, Dong-Ju
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.2 s.95
    • /
    • pp.145-155
    • /
    • 2007
  • The objectives of this study aye to develop an on-line departure time-based travel time estimation method and to determine an optimal link length for the estimation. This study developed a link-based rolling horizon logic as the travel time estimation method. In order to determine an optimal link length, the information error of the travel time provision from the user's perspective was defined and employed as a selection criterion. It was found that, when the travel time aggregation size was set as five minutes, a link length of four kilometers gave the most accurate result.

Mesh Network Implementation using DWDS-based Link Layer Routing (DWDS 기반의 링크 계층 라우팅을 통한 메쉬 네트워크 구현)

  • Yoon, Mi-Kyung;Yang, Seung-Chur;Kim, Jong-Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2A
    • /
    • pp.165-173
    • /
    • 2010
  • WMN(Wireless Mesh Network) is an wireless backbone network technology that is an easily configurable network in the low cost compared to the wireless LAN(Local Area Network). Most of the previous researches have evaluated their algorithms by the simulations rather than by the implementation. There exist some implementation papers, however, they have the limitations of the flexibility on the link establishment and the link quality utilization. Consequently, the benefit of the WMN - configuration flexibility is degraded and the performance deterioration occurs in the multi-hop wireless environment. In this paper, we introduce a Linux-based link layer Wireless Mesh Routing System - WBMR. The design and implementation of WBMR provides the dynamic link establishment and the effective multi-channel usage. We have modified the ntroof the original WLAN operation for the dynamic link establishment, and the Linux bridge for the link layer routing. The result of performance evaluation verifies that our WBMR supports fast self-configuration and increases data transmission throughput compared to the other researches of the wireless multi-hop environment.