• Title/Summary/Keyword: State update transmission

Search Result 9, Processing Time 0.023 seconds

Flow Holding Time based Advanced Hybrid QoS Routing Link State Update in QoS Routing

  • Cho, Kang Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.4
    • /
    • pp.17-24
    • /
    • 2016
  • In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

Performance evaluations of a link state update mechanism considering traffic variation (트래픽 변화를 고려한 링크 상태 업데이트 알고리즘의 성능 분석)

  • Choi, Seung-Hyuk;Jung, Myoung-Hee;Yang, Mi-Jeong;Kim, Tae-Il;Park, Jae-Hyung;Chung, Min-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.1
    • /
    • pp.27-33
    • /
    • 2006
  • To guarantee QoS (Quality of Service), routers should determine routing paths satisfying service requirements, based on link state information as well as network topology. Link status database (LSD) in routers should be efficiently managed to effectively reflect the current state of all links. However, there is a trade off between the exact reflection of the current link status and its update cost. For exactly reflecting the current link status, each router immediately notifies its neighbors that link state information is changed. This may degrade performance of the router due to the processing of link state update messages. On the other side, if the current link state information is not updated appropriately, a route setup request can be rejected because of the discrepancy between the current link state information and previously updated link state information in LSD. In this paper, we propose a traffic variation based link state update algorithm for adaptively controlling the generation of link state update messages and compare its performance with those of four existing algorithms by intensive simulations.

  • PDF

Hybrid Link State Update Algorithm in QoS Routing (하이브리드 QoS 라우팅 링크 상태 갱신 기법)

  • Cho, Kang Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.3
    • /
    • pp.55-62
    • /
    • 2014
  • This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.

Quantized System Modeling and Performance Evaluation

  • Lee, Jong-Sik
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2003.11a
    • /
    • pp.87-93
    • /
    • 2003
  • This paper reviews existing message-filtering schemes and presents a quantization-based message-filtering approach which reduces state update transmission and message traffic requirement. For a realization of the approach we develop a DEVS-based integrator which provides behavior and characteristic of the quantization-based approach. We take a spaceship and space traveling system as a case study to evaluate performance of the quantization-based approach. The approach is validated by DEVSJAVA simulations of the case study. The comparison of message traffic requirement between DTSS (Discrete Time System Specification)-based and DEVS-based systems apparently shows system performance improvement through the quantization-based approach.

  • PDF

A TEST Frame Application Technique for Improving Data Communication and Topology Update Function in Ad-Hoc Tactical Wireless Networks (Ad-Hoc 전술 무선 통신망에서 데이터 통신 및 토폴로지 갱신 기능 향상을 위한 TEST 프레임 적용 기법)

  • You, Ji-Sang;Baek, In-Cheol
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.10 no.1
    • /
    • pp.44-54
    • /
    • 2007
  • In the military field, according to the MIL-STD-188-220, which is an Ad-Hoc communication protocol used for sending out or receiving data and voice smoothly among nodes in the situation that wireless communication nodes move arbitrarily, data communication is cut off because nodes can not know topology changes perpetually in the link disconnection state due to node movement in the case that transmitters do not confirm whether data is delivered to receivers or not, and transmit only the data having routine precedence continuously. In order to solve this problem, we have proposed the technique that makes efficient data communication possible by achieving a rapid topology change detection and link information update using TEST frame. We have analyzed TEST frame application effects in the two aspects of the topology update delay time and the data transmission success ratio.

LSU Message Count Controlled Link State Update Algorithm in QoS Routin (LSU 메시지 수를 제어 가능한 QoS 라우팅 링크 상태 갱신 알고리즘)

  • Cho, Kang-Hong;Kim, Nam-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.6
    • /
    • pp.75-81
    • /
    • 2012
  • This paper has proposed Message Count Control Mechanism based Link State Update(LSU) Algorithm that has not had a strong influence on the depreciation of QoS routing performance. Most existing LSU algorithms have the limit that cannot control the count of LSU message. Especially, adaptive algorithms have a bad performance when traffic are excessive and fickle. We classify as the importance of LSU message that have a influence on available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed model and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

Application of SA-SVM Incremental Algorithm in GIS PD Pattern Recognition

  • Tang, Ju;Zhuo, Ran;Wang, DiBo;Wu, JianRong;Zhang, XiaoXing
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.1
    • /
    • pp.192-199
    • /
    • 2016
  • With changes in insulated defects, the environment, and so on, new partial discharge (PD) data are highly different from the original samples. It leads to a decrease in on-line recognition rate. The UHF signal and pulse current signal of four kinds of typical artificial defect models in gas insulated switchgear (GIS) are obtained simultaneously by experiment. The relationship map of ultra-high frequency (UHF) cumulative energy and its corresponding apparent discharge of four kinds of typical artificial defect models are plotted. UHF cumulative energy and its corresponding apparent discharge are used as inputs. The support vector machine (SVM) incremental method is constructed. Examples show that the PD SVM incremental method based on simulated annealing (SA) effectively speeds up the data update rate and improves the adaptability of the classifier compared with the original method, in that the total sample is constituted by the old and new data. The PD SVM incremental method is a better pattern recognition technology for PD on-line monitoring.

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.

A Packet-Based Channel Access Scheme in Wireless ATM Network

  • Ryu Jung-pil;Lee Byeong-jik;Lee Ick-soo;Ha Nam-koo;Noh Jae-hwan;Han Ki-Jun
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.165-169
    • /
    • 2004
  • This paper proposes a packet-based channel access scheme in Distributed-Queuing Request Update Multiple Access(DQRUMA) MAC(Media Access Control) protocol. To increase a channel access ratio, we eliminate the wait-to-transmit state that does not transmit Xmt_Req(Transmission Request) although the mobile terminal(MS) has new arrival packets in buffer.

  • PDF