• Title/Summary/Keyword: Queue detection

Search Result 78, Processing Time 0.024 seconds

Improving TCP Performance by Implicit Priority Packet Forwarding in Mobile IP based Networks with Packet Buffering (모바일 IP 패킷 버퍼링 방식에서 TCP 성능향상을 위한 암시적인 패킷 포워딩 우선권 보장 방안)

  • 허경;이승법;노재성;조성준;엄두섭;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.500-511
    • /
    • 2003
  • To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and the wireless link utilization performance degrades due to increased congestion by those forwarded packets. In this paper, considering the case that a mobile user moves to a congested base station in a new foreign subnetwork, we propose an Implicit Priority Packet Forwarding to improve TCP performance in mobile networks. In the proposed scheme, the old base station marks a buffered packet as a priority packet during handoff. In addition, RED (Random Early Detection) at the new congested base station does not include priority packets in queue size and does not drop those packets randomly based on average queue size. Simulation results show that wireless link utilization performance of mobile hosts can be improved without modification to Mobile IP protocol by applying proposed Implicit Priority Packet Forwarding.

Automatic Skin Basal Cell Carcinoma Detection Using Protophorphyrin IX((PpIX) Fluorescence Image (PpIX 형광영상을 이용한 피부 기저세포암 자동검출)

  • Yu, Hong-Yeon;Jun, Do-Young;Kim, Min-Sung;Hong, Sung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.1
    • /
    • pp.47-54
    • /
    • 2008
  • In this paper, we propose an auto-detection algorithm of basal cell carcinoma(BCC) from the protophorphyrin IX(PpIX) fluorescence image induced by appling the methyl 5-aminolaevulinate(MAL) ointment-induced protophorphyrin IX(PpIX) to the skin tumour area and then shining the wood lamp on the area. The proposed algorithm first generates 3 mask areas-tumor area, suspected tumor area and tumor free area and then applies local watershed algorithm to the turner and the suspected tumor areas to make small watershed regions that include similar luminance value pixels. Next, small watershed regions are merged by hierarchical queue based fast region merging that uses the difference between the average luminance values of adjacent watershed regions as a region merging criterion and finally BCC regions are detected. 50 tissue samples are acquired from the tumour regions of 10 patients with BCC that are extracted by using the proposed algorithm and are performed pathological examination by expert dermatologist. Experiment result shows the rate of tumor detection from BCC lesion using presurgical in vivo of MAL-indeuced PpIX fluorescence has high sensitivity 94.1% and relatively high specificity 82.6%.

Performance improvement of ER switch congestion control algorithm for ABR service in ATM network (ATM망에서 ABR 서비스를 위한 ER 스위치 폭주 제어 알고리즘의 성능 개선)

  • 김운하;박성곤;조용환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.1890-1906
    • /
    • 1997
  • A new ER feedback switch control algorithm, called EMRCA(Explicit Max-min Rate Control Algorithm), to control the ABR services traffic in the ATM networks, is proposed in this thesis. This scheme was interpreted the ACR variation residing on between a transient state and a stable state using the two thresholds that is the $TH_{high}$ and $TH_{low}$ in the queue to detect switch nodes congestion, and decreased the difference of minimum and maximum ACR all active connection to enhance the line bandwidth utilization. The proiposed scheme used a minimum and maximum rate of all active connections to select the connection whose the congestion rate inveoked, and uses a congestion detection mechanixm to prevent some potential cogestion by regulating selected contection.s The EMRCA scheme showed ACR variation more stable that the EPRCA scheme, also reduced buffer size of the switch, and achieved higher link utilization than the EPRCA scheme.

  • PDF

Study and Evaluation of an Incident Detection Algorithm for Urban Freeways (도시고속도로 돌발상황 감지 알고리즘 개발에 관한 연구 및 평가)

  • Seo Jeong-ho;In Sung-man;Kim Young-chan
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.3 no.1 s.4
    • /
    • pp.53-65
    • /
    • 2004
  • A series of accidents, which are non-recurrent and non-anticipated, are called incidents. These incidents make standard traffic flows interrupt, which result in the decrease of road capacity and a number of social and economic costs, such as the traffic congestion and air pollution. In order to prevent the hazard of incidents, domestic and foreign traffic management center are likely to opt auto-sense system with algorithms of auto-incident sense. However, it is evaluated that the algorithms have a low function with frequent wrong alarms, even if they accurately ry to speculate the incidents. In the case of bottleneck which has lack of road capacity, compared with other roads, due to inefficient road structured over-capacity of the demand of on-off ramp, the incidents regularly take place. Nonetheless, it can be more difficult to speculate the auto-incidents sense owing to similar incidents, such as the queue of in-out flows of cars and the change of road line. Throughout this research, the function of the model has improved excluding near road line in the module of the incidents which is based on the auto-incidents algorithms during the sense of the congestion of ramp areas.

  • PDF

Application and Evaluation of a Traffic Signal Control Algorithm based on Travel Time Information for Coordinated Arterials (연동교차로를 위한 통행시간기반 신호제어 알고리즘의 현장 적용 및 평가)

  • Jeong, Yeong-Je;Kim, Yeong-Chan
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.5
    • /
    • pp.179-187
    • /
    • 2009
  • This study develops a real-time signal control algorithm based on sectional travel times and includes a field test and evaluation. The objective function of the signal control algorithm is the equalization of delay of traffic movements, and the main process is calculating dissolved time of the queue and delay using the sectional travel time and detection time of individual vehicles. Then this algorithm calculates the delay variation and a targeted red time and calculates the length of the cycle and phase. A progression factor from the US HCM was applied as a method to consider the effect of coordinating the delay calculation, and this algorithm uses the average delay and detection time of probe vehicles, which were collected during the accumulated cycle for a stabile signal control. As a result of the field test and evaluation through the application of the traffic signal control algorithm on four consecutive intersections at 400m intervals, reduction of delay and an equalization effect of delay against TOD control were confirmed using the standard deviation of delay by traffic movements. This study was conducted to develop a real-time traffic signal control algorithm based on sectional travel time, using general-purpose traffic information detectors. With the current practice of disseminating ubiquitous technology, the aim of this study was a fundamental change of the traffic signal control method.

Dynamic O-D Trip estimation Using Real-time Traffic Data in congestion (혼잡 교통류 특성을 반영한 동적 O-D 통행량 예측 모형 개발)

  • Kim Yong-Hoon;Lee Seung-Jae
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.5 no.1 s.9
    • /
    • pp.1-12
    • /
    • 2006
  • In order to estimate a dynamic origin and destination demand between on and off-ramps in the freeways, a traffic flow theory can be used to calculate a link distribution proportion of traffics moving between them. We have developed a dynamic traffic estimation model based on the three-phase traffic theory (Kerner, 2004), which explains the complexity of traffic phenomena based on phase transitions among free-flow, synchronized flow and moving jam phases, and on their complex nonlinear spatiotemporal features. The developed model explains and estimates traffic congestion in terms of speed breakdown, phase transition and queue propagation. We have estimated the link, on and off-ramp volumes at every time interval by using traffic data collected from vehicle detection systems in Korea freeway sections. The analyzed results show that the developed model describes traffic flows adequately.

  • PDF

Active Congestion Control Using Active Router′s Feedback Mechanism (액티브 라우터의 피드백 메커니즘을 이용한 혼잡제어 기법)

  • Choe, Gi-Hyeon;Jang, Gyeong-Su;Sin, Ho-Jin;Sin, Dong-Ryeol
    • The KIPS Transactions:PartC
    • /
    • v.9C no.4
    • /
    • pp.513-522
    • /
    • 2002
  • Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

A Priority Packet Forwarding for TCP Performance Improvement in Mobile W based Networks with Packet Buffering (모바일 IP 패킷 버퍼링 방식에서 TCP 성능향상을 위한 패킷 포워딩 우선권 보장 방안)

  • Hur, Kyeong;Roh, Young-Sup;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8B
    • /
    • pp.661-673
    • /
    • 2003
  • To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and TCP transmission performance of a mobile user in the congested base station degrades due to increased congestion by those forwarded burst packets. In this paper, considering the general case that a mobile user moves to a congested base station, we propose a Priority Packet Forwarding to improve TCP performance in mobile networks. In the proposed scheme, without modification to Mobile IP protocol, the old base station marks a buffered packet as a priority packet during handoff. And priority queue at the new congested base station schedules the priority packet firstly. Simulation results show that proposed Priority Packet Forwarding can improve TCP transmission performance more than Implicit Priority Packet Forwarding and RED (Random Early Detection) schemes.