• Title/Summary/Keyword: Control packet

Search Result 1,137, Processing Time 0.028 seconds

Call Admission Control for Shared Buffer Memory Switch Network with Self-Similar Traffic (Self-Similar 트래픽을 갖는 공유버퍼 메모리 스위치 네트워크 환경에서 호 수락 제어 방법)

  • Kim Ki wan;Kim Doo yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.162-169
    • /
    • 2005
  • Network traffic measurements show that the data traffic on packet switched networks has the self-similar features which is different from the traditional traffic models such as Poisson distribution or Markovian process model. Most of the call admission control researches have been done on the performance analysis of a single network switch. It is necessary to consider the performance analysis of the proposed admission control scheme under interconnected switch environment because the data traffic transmits through switches in networks. From the simulation results, it is shown that the call admission control scheme may not operate properly on the interconnected switch even though the scheme works well on a single switch. In this parer, we analyze the cell loss probability, utilization and self-similarity of output ports of the interconnected networks switch by using shared buffer memory management schemes and propose the new call admission control scheme considering the interconnected network switches under self-similar traffic environments.

Congestion Control for Burst Loss Reduction in Labeled OBS Network (Labeled OBS 망에서의 버스트 손실 감소를 위한 혼잡 제어)

  • Park Jonghun;Yoo Myungsik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6B
    • /
    • pp.331-337
    • /
    • 2005
  • The optical Internet is considered as a feasible solution for transporting huge amount of traffic volume in the future Internet. Among optical switching technology for the optical Internet, OBS becomes one of the most promoting solution. Recently, a lebeled OBS(LOBS) architecture is considered for an efficient control on OBS network. Given that a data burst may contain few thousands of IP packets, a single loss of data burst results in a serious throughput degradation in LOBS network. In this paper, we improve the performance of LOBS network by introducing the burst congestion control mechanism. More specifically, the OBS router at the network core detects the network congestion by measuring the loss probability of burst control packet. The OBS router at the network edge reduces the burst generation according to the network condition repored by the OBS router at the network core. Through the simulations, it is shown that the proposed congestion control mechanism can reduce the burst loss probability and improve the LOBS network throughput.

Fast Congestion Control to Transmit Bursty Traffic Rapidly in Satellite Random Access Channel (위성 랜덤 액세스 채널에서 Bursty 트래픽의 신속한 전송을 위한 빠른 혼잡 제어 기법)

  • Noh, Hong-Jun;Lee, Yoon-Seong;Lim, Jae-Sung;Park, Hyung-Won;Lee, Ho-Sub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.11
    • /
    • pp.1031-1041
    • /
    • 2014
  • In this paper, we propose a traffic load control scheme, called fast congestion control (FCC), for a satellite channel using enhanced random access schemes. The packet repetition used by enhanced random access schemes increases not only the maximum throughput but also the sensitivity to traffic load. FCC controls traffic load by using an access probability, and estimates backlogged traffic load. If the backlogged traffic load exceeds the traffic load corresponding to the maximum throughput, FCC recognizes congestion state, and processes the backlogged traffic first. The new traffic created during the congestion state accesses the channel after the end of congestion state. During the congestion state, FCC guarantees fast transmission of the backlogged traffic. Therefore, FCC is very suitable for the military traffic which has to be transmit urgently. We simulate FCC and other traffic load control schemes, and validate the superiority of FCC in latency.

Performance Evaluation of Wireless Networked Control System Based on IEEE 802.15.4e With Redundancy (중복 전송을 고려한 IEEE 802.15.4e기반 무선 네트워크 제어 시스템 성능 평가)

  • Yen, Bui Xuan;Lee, Wonhee;Kim, Youngsuk;Yoo, Myungsik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.7
    • /
    • pp.572-580
    • /
    • 2013
  • IEEE 802.15.4e is a prospective standard for low latency control application in industries. This paper proposes a framework to evaluate the closed loop IEEE 802.15.4e based WNCS performance. The framework consists of two models: closed loop control system model and network model. The network model focuses on the PHY parameters of wireless link and takes the channel parameters into consideration. The PHY model combining with MAC model gives the control system model the probability of packet loss in a super-frame. In addition, redundancy mechanism is considered in IEEE 802.15.4e to reduce to data frame loss probability. The simulation is implemented in Matlab, PHY model takes the channel parameters from empirical results. Hence our evaluation gives insight into behavior of WNCS in different environments and it provides us a tool to design wireless network to achieve a good performance for control system.

A Receiver-based Congestion Control Algorithm with One-way Trip Time for Multimedia Applications (멀티미디어 응용을 위한 수신측 중심의 혼잡 제어 알고리즘)

  • 정기성;박종훈;홍민철;유명식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.6B
    • /
    • pp.553-562
    • /
    • 2003
  • Supporting QoS (Quality of Service) for the multimedia applications becomes an important issue as the demand of multimedia applications increases. Thus, it is necessary for the application layer to have an efficient congestion control algorithm, which can support the multimedia applications' QoS requirements. In this paper, we propose a new application layer congestion control algorithm, called RRC-OTT (Receiver-based Rate Control with One-way Trip Time). RRC-OTT algorithm differs from the previously proposed algorithms in that the receiver takes the responsibility of the network congestion control. Thus, RRC-OTT algorithm can not only precisely estimate the network congestion using OTT (one-way Trip Time), but reduce the work load from the sender (e.g., the web server). Our simulation study shows that RRC-OTT algorithm can maintain the comparable link utilization to the previously proposed algorithms and keep the packet jitter low, which thus can help enhance the quality of multimedia applications.

A Tunable Transmitter - Tunable Receiver Algorithm for Accessing the Multichannel Slotted-Ring WDM Metropolitan Network under Self-Similar Traffic

  • Sombatsakulkit, Ekanun;Sa-Ngiamsak, Wisitsak;Sittichevapak, Suvepol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.777-781
    • /
    • 2004
  • This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

  • PDF

An Improvement of Performance for Data Downstream in IEEE 802.11x Wireless LAN Networks (IEEE 802.11x 무선 랜에서의 데이터 다운스트림 성능 향상)

  • Kim, Ji-Hong;Kim, Yong-Hyun;Hong, Youn-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.11 s.353
    • /
    • pp.149-158
    • /
    • 2006
  • We proposed a method for improving a performance of TCP downstream between a desktop PC as a fixed host and a PDA as a mobile host in a wired and wireless network based on IEEE 802.11x wireless LAN. With data transmission between these heterogeneous terminals a receiving time during downstream is slower than that during upstream by 20% at maximum. The reason is that their congestion window size will be oscillated due to a significantly lower packet processing rate at receiver compared to a packet sending rate at sender. Thus it will cause to increase the number of control packets to negotiate their window size. To mitigate these allergies, we proposed two distinct methods. First, by increasing a buffer size of a PDA at application layer an internal processing speed of a socket receive buffer of TCP becomes faster and then the window size is more stable. However, a file access time in a PDA is kept nearly constant as the buffer size increases. With the buffer size of 32,768bytes the receiving time is faster by 32% than with that of 512bytes. Second, a delay between packets to be transmitted at sender should be given. With an inter-packet delay of 5ms at sender a resulting receiving time is faster by 7% than without such a delay.

Operation and Analysis of Network for Multivendor PLC Group Management in the Wall Paper Process (발포 벽지 공정에서 이기종 PLC 그룹 관리를 위한 네트워크 운영과 해석)

  • Gang, Seong-Deok;Lee, Dong-Chun;Kim, Jeong-Ho;Lee, Sang-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.2
    • /
    • pp.283-294
    • /
    • 1996
  • To operate the automatic devices of manufacturing process more effectively and to solve the needs of the resource sharing, network technology is applied to the unit control devices located in common manufacturing zone and operated by connecting them. This paper introduces deign and test operation of cell system for the management of multivendor PLC by applying to wall paper process based on the manufacturing standardization of CIM. The analysis of designed multivendor PLC group is performed by selecting the parameters such as variation of data packet size and node number of PLC ladder logic program and variation by analyzing the corresponding variation values of token rotation time and waiting time for the system operation. For the method of the analysis,the equation is considering the overhead such as indicated packet service time and transmission safety margin for PLC network connection in M/G/1 queue model,and it is applied to the cell system and PLC group manage-ment for operation .Through the experiment,it is found that the realtime processing is possible with expanded and better result than the resuit obtained by Jayasumana.Browaka with PLC scan time considered,response lower limit of 10-20 msec. data packet size not more than 50 bytes.and the number of nodes less than 40.

  • PDF

Handover in LTE networks with proactive multiple preparation approach and adaptive parameters using fuzzy logic control

  • Hussein, Yaseein Soubhi;Ali, Borhanuddin M;Rasid, Mohd Fadlee A.;Sali, Aduwati
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.7
    • /
    • pp.2389-2413
    • /
    • 2015
  • High data rates in long-term evolution (LTE) networks can affect the mobility of networks and their performance. The speed and motion of user equipment (UE) can compromise seamless connectivity. However, a proper handover (HO) decision can maintain quality of service (QoS) and increase system throughput. While this may lead to an increase in complexity and operational costs, self-optimization can enhance network performance by improving resource utilization and user experience and by reducing operational and capital expenditure. In this study, we propose the self-optimization of HO parameters based on fuzzy logic control (FLC) and multiple preparation (MP), which we name FuzAMP. Fuzzy logic control can be used to control self-optimized HO parameters, such as the HO margin and time-to-trigger (TTT) based on multiple criteria, viz HO ping pong (HOPP), HO failure (HOF) and UE speeds. A MP approach is adopted to overcome the hard HO (HHO) drawbacks, such as the large delay and unreliable procedures caused by the break-before-make process. The results of this study show that the proposed method significantly reduces HOF, HOPP, and packet loss ratio (PLR) at various UE speeds compared to the HHO and the enhanced weighted performance HO parameter optimization (EWPHPO) algorithms.

A New Congestion Control Algorithm for Vehicle to Vehicle Safety Communications (차량 안전 통신을 위한 새로운 혼잡 제어 알고리즘 제안)

  • Yi, Wonjae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.5
    • /
    • pp.125-132
    • /
    • 2017
  • Vehicular safety service reduces traffic accidents and traffic congestion by informing drivers in advance of threats that may occur while driving using vehicle-to-vehicle (V2V) communications in a wireless environment. For vehicle safety services, every vehicle must broadcasts a Basic Safety Message(BSM) periodically. In congested traffic areas, however, network congestion can easily happen, reduce the message delivery ratio, increase end-to-end delay and destabilize vehicular safety service system. In this paper, to solve the network congestion problem in vehicle safety communications, we approximate the relationship between channel busy ratio and the number of vehicles and use it to estimate the total network congestion. We propose a new context-aware transmit power control algorithm which controls the transmission power based on total network congestion. The performance of the proposed algorithm is evaluated using Qualnet, a network simulator. As a result, the estimation of total network congestion is accurately approximated except in specific scenarios, and the packet error rate in vehicle safety communication is reduced through transmit power control.