• Title/Summary/Keyword: Traffic Congestion Control

Search Result 390, Processing Time 0.029 seconds

A Cell Loss Constraint Method of Bandwidth Renegotiation for Prioritized MPEG Video Data Transmission in ATM Networks (ATM망에서 우선 순위가 주어진 MPEG 비디오 데이터 전송시 대역폭 재협상을 통한 셀 손실 방지 기법)

  • Yun, Byoung-An;Kim, Eun-Hwan;Jun, Moon-Seog
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1770-1780
    • /
    • 1997
  • Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

  • PDF

A Study on TCP using AODV in Mobile Ad-hoc Networks (이동 애드혹 네트워크에서 AODV를 적용한 TCP에 관한 연구)

  • Lee, Hye-Rim;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.3
    • /
    • pp.233-238
    • /
    • 2008
  • Recently, network component become to follow wireless and mobile network from wired network proposed that many TCP algorithm optimized in variety environment. When TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. Transmission errors are more frequent and may be incorrectly regarded as indications of network congestion. In this paper, it conduct how effect congestion control algorithm in Mobile ad-hoc network and compare traffic of TCP-Tahoe, TCP-Reno, TCP-New-Reno and TCP-Vegas in Mobile ad-hoc environment.

  • PDF

TCP Throughput Guarantee using Packet Buffering (패킷 버퍼링을 이용한 TCP 처리율 보장 방법)

  • Choi, Sun-Woong;Kim, Chung-Kwon
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.2
    • /
    • pp.242-250
    • /
    • 2001
  • This paper deals with the TCP bandwidth guarantee problem in a differentiated serviccs(Diffserv) network. The Diffserv assured s<:rvice differentiates packet drop probabilities to guarantee the promised bandwidth even under network congestion. However a token buffer marker fails to show adequate performance because TCI' generates packets according to the unique Tel' congestion control mechanism. We propose a marker that uses a data buffer as well as a token buffer. The marker with a data buffer works well with the assured service mechanism because it smooths Tel' traffic. We showed that the marker with a data buffer achieves the target throughput better than a marker with a token buffer only. We also showed that the optimal buffer size is proportional to reserved throughput and HTT.

  • PDF

Differentiated Services Based Admission Control and Multi Path Routing Algorithm for IPv6

  • Farooq, Muhammad Omer;Aziz, Sadia
    • Journal of Information Processing Systems
    • /
    • v.5 no.2
    • /
    • pp.97-104
    • /
    • 2009
  • In this paper we propose a Differentiated Services Based Admission Control and Routing Algorithm for IPv6 (ACMRA). The basic DiffServ architecture lacks an admission control mechanism, the injection of more QoS sensitive traffic into the network can cause congestion at the core of the network. Our Differentiated Services Based Admission Control and Routing Algorithm for IPv6 combines the admission control phase with the route finding phase, and our routing protocol has been designed in a way to work alongside DiffServ based networks. The Differentiated Services Based Admission Control and Routing Algorithm for IPv6 constructs label switched paths in order to provide rigorous QoS provisioning. We have conducted extensive simulations to validate the effectiveness and efficiency of our proposed admission control and routing algorithm. Simulation Results show that the Differentiated Services Based Admission Control and Routing Algorithm for IPv6 provides an excellent packet delivery ratio, reduces the control packets' overhead, and makes use of the resources present on multiple paths to the destination network, while almost each admitted flow shows compliance with its Service Level Agreement.

THE DISCRETE-TIME ANALYSIS OF THE LEAKY BUCKET SCHEME WITH DYNAMIC LEAKY RATE CONTROL

  • Choi, Bong-Dae;Choi, Doo-Il
    • Communications of the Korean Mathematical Society
    • /
    • v.13 no.3
    • /
    • pp.603-627
    • /
    • 1998
  • The leaky bucket scheme is a promising method that regulates input traffics for preventive congestion control. In the ATM network, the input traffics are bursty and transmitted at high-speed. In order to get the low loss probability for bursty input traffics, it is known that the leaky bucket scheme with static leaky rate requires larger data buffer and token pool size. This causes the increase of the mean waiting time for an input traffic to pass the policing function, which would be inappropriate for real time traffics such as voice and video. We present the leaky bucket scheme with dynamic leaky rate in which the token generation period changes according to buffer occupancy. In the leaky bucket scheme with dynamic leaky rate, the cell loss probability and the mean waiting time are reduced in comparison with the leaky bucket scheme with static leaky rate. We analyze the performance of the proposed leaky bucket scheme in discrete-time case by assuming arrival process to be Markov-modulated Bernoulli process (MMBP).

  • PDF

Initial Investigation on Consolidation with Adaptive Dynamic Threshold for ABR Multicast Connections in ATM Networks (비동기 전송모드 망의 점대다중점연결을 위한 적응동적임계치기반 병합알고리즘)

  • Shin, Soung-Wook;Cho, Kwang-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.11
    • /
    • pp.962-966
    • /
    • 2001
  • The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

  • PDF

A TCP-Friendly Control Method using Neural Network Prediction Algorithm (신경회로망 예측 알고리즘을 적용한 TCP-Friednly 제어 방법)

  • Yoo, Sung-Goo;Chong, Kil-To
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.105-107
    • /
    • 2006
  • As internet streaming data increase, transport protocol such as TCP, TGP-Friendly is important to study control transmission rate and share of Internet bandwidth. In this paper, we propose a TCP-Friendly protocol using Neural Network for media delivery over wired Internet which has various traffic size(PTFRC). PTFRC can effectively send streaming data when occur congestion and predict one-step ahead round trip time and packet loss rate. A multi-layer perceptron structure is used as the prediction model, and the Levenberg-Marquardt algorithm is used as a traning algorithm. The performance of the PTFRC was evaluated by the share of Bandwidth and packet loss rate with various protocols.

  • PDF

A Study on Systemic Test Approach of Automated Control of the Personal Rapid Transit System (PRT 자동화 제어시스템의 체계적인 테스트 접근에 관한 연구)

  • Jeong Seung-Hwan;Kim Jong-Ki;Lee Kum-Seok
    • Proceedings of the KSR Conference
    • /
    • 2004.10a
    • /
    • pp.205-210
    • /
    • 2004
  • The PRT(Personal Rapid Transit) system has been being researched and examined to efficiently provide high quality services to passengers against the traffic congestion of the capital region. With concept that PRT differentiated from GRT(Group Rapid Transit), PRT generally is a tracked vehicle system operating with unmanned. The embedded software of PRT Automated Control system generally is comprised of the central software, stations software and vehicle software. The controllers of these software interface to each other using its RF communication antennas. In this paper, each embedded software of the PRT system should be applied to an incremental and systematic test approach technique in the design and implementation phase, because the reliability and safety of the PRT system should be assured

  • PDF

Carbon Reduction Effect of Traffic Operational Methods Itemized in National Project for Advanced Traffic Operation and Management (교통운영체계선진화의 탄소감축 효과 연구)

  • Kim, Wonchul;Kim, Jin-Tae
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.1D
    • /
    • pp.1-11
    • /
    • 2012
  • The presidential council on national competitiveness and the national police agency have initiated a national project to refresh the road traffic control and operation systems to increase operational efficiency at signalized intersections. It would reduce the number of stops and delay of vehicles at intersections and thus mitigate congestion and emission. Although significant reduction of carbon is expected as a consequential result, such effects has yet been studied since traffic operation was behind of interest in the field of green transportation where planning was mainly involved. This paper delivers the macroscopic effects of carbon reduction of the selected items of the national project: the ones managed by the police agency. The results showed that the studied items yield significant reduction of carbon: pedestrian push button operation, flashing signal operation, progression, lagging left turns, permitted left turn, and actuated left-turn operation would reduce 12.31%, 3.27%, 2.44%, 0.97%, 0.81%, and 0.72% of the total amount of carbon emitted a year in a whole transportation sector, respectively.

A Study of Breakwater Layout on the Basis of Marine Traffic Flow (해상교통흐름을 고려한 방파제 형상 설계에 관한 연구)

  • Jung Jae-Yong;Park Young-Soo;Ko Jae-Yong
    • Proceedings of KOSOMES biannual meeting
    • /
    • 2004.11a
    • /
    • pp.57-62
    • /
    • 2004
  • A mariner feels the ship-handling difficulty when the vessel onboard passes through breakwater. Until now, there is no a layout design of breakwater to take into account the ship-handling difficulty for the mariner. 11Us paper reproduced this situation which ship-handling is difficult by using marine traffic flow simulation, and it applied to Environmental Stress Model as the assessment model which is a quantitative model for evaluating the difficulty of ship-handling arising from restriction in maneuvering water areas and arising from traffic congestion The results are as follows. (1) The layout change of breakwater has little influence for reduction of ship-handling difficulty in the areas of vessel traffic volume. (2) In the situation of same breakwater width, difference of ship speed has an effect on decrease of ship-handling difficulty. (3) Expansion of breakwater width decreases ship-handling difficulty quantitatively.

  • PDF