• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.57-70
• /
• 2006

This paper describes a new effective algorithm to estimate routing congestion and to resolve highly congested regions for a given detailed placement. The major features of the proposed technique can be summarized as follows. Firstly, if there are congested regions due to some nets which pass through the regions it can determine which cells affect those congested spots seriously and moves some of them to resolve congestion effectively. Secondly, since the proposed technique uses the ripple movement technique to move cells it resolves congestion without sacrificing wire length. Thirdly, we use an efficient incremental data structure to trace the changes in congestion and wire length as cells move. Hence, selection of cells to move could be very accurate and fast in the course of iteration. Finally, although an MST net model is used to resolve congestion in this paper, proposed technique can be work with any net model. Particularly, if proposed technique can obtain routing information from a real router, congestion can be resolved more effectively. Experimental results show that the proposed technique can resolve congestion effectively and efficiently without sacrificing wire length.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.236-242
• /
• 2003

ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates. In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals. The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series. The predicted congestion information is backward to the node. NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction. Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• Journal of Korea Multimedia Society
• /
• v.18 no.12
• /
• pp.1475-1482
• /
• 2015

In network routers, buffers are used to resolve congestion and reduce packet loss rate whenever congestion occurs at bottleneck link. Most of the existing methods to manage such buffers focus only on queue-length-based control as one loop which have some issues of low link utilization and system stability. In this paper, we propose a novel framework which exploits two-loop control method, e.g. queue-length and congestion window size, combined with optimal margin method to facilitate parameter choices. Simulation results in ns-2 demonstrate that bottleneck link performance can be improved with higher link utilization (85%) and shorter queue length (22%) than the current deployed scheme in commercial routers (RED and DropTail).

• International Journal of Reliability and Applications
• /
• v.3 no.2
• /
• pp.99-112
• /
• 2002

Traffic congestion is one of critical factors in Internet applications to guarantee their QoS and provide reliable services. This paper discusses many existing congestion control algorithms and proposes a new ISDA. The algorithm is analyzed in respect of queue length, throughput and fairness. The proposed algorithm is working well with TCP and UDP traffics to offer QoS guarantee and fairness.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.603-609
• /
• 1987

In this paper, the single-row routing algorithm for munimizing the street congestion and reducing the between node congestion is deviced. To reduce the between node congestion, reference line crossing is defined and used. Reducing the number of total reference line crossing means reducing the total length which help reduce the power consumption of the integrated system and reducing the between node congestin which help reduce the wiring area. This algorithm has been implemented and tested with various example, then produced good results.

• The Journal of the Korea Contents Association
• /
• v.2 no.2
• /
• pp.73-84
• /
• 2002

In this paper, we propose a enhanced ERICA switch algorithm using the buffer management scheme which can reduce the queue length, support the efficiency link utilization and the fair share. It has three different buffer thresholds which are low threshold, congestion notification threshold and high threshold. According to the each buffer threshold status, switch announced congestion notification to the source differently. So, sources could know the congestion more quickly and fast remover from network congestion. As a experimental results, it is proved that proposed algorithm is the more efficient than ERICA. Especially, proposed switch algorithm provides congestion control mechanism to make the best use of with keeping fairness and reduce queue length.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.19 no.3
• /
• pp.19-27
• /
• 1982

Minimization of total routing and number of cuts has been adopted for the placement problem in LSI and printed wire board as the object function, recently. Although it is considered that in the general situation this object function reflects the final goal which is wiring of 100% of layout, it often seems to be insufficient because it does not exhibit partial wire congestion. This paper introduces a new concept called the wire congestion of segestion to get the partial wire congestion and proposes the object function to minimize the wire congestion of segmests. In order to optimize this object function, an effective heuristic algorithm is also suggestsl Experimental results show that this algorithm sustains its efficiency. The experimental consequences point out that if the total routing length is short, maximum wire congestion of segment is small and vice versa. Therefore control parameter, that is, congestion parameter, which mintnizes total length and concurrently reduces maximal wire congestion of segment, is obtained by experiment.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.3
• /
• pp.52-59
• /
• 2016

COSMOS system which was developed in Seoul for real-time signal control was designed to judge traffic condition for practicing signal operation. However, it occurs efficiency problem that stop line detection and queue length detection could not judge overflow saturation of street. For that reason, following research process GPS data of Seoul city's corporationowned taxi to calculate travel speed that excluded existing system of stop line detection and queue length detection. Also, "Research of calculating queue length by GPS data" which was progressed with following research expressed queue length. It is based on establishing algorithm of judging congestion situation. The algorithm was applied to a few areas where appeared congestion situation consistently to confirm real time traffic condition with established network. [Entrance of the National Sport Institute ${\rightarrow}$ Gangnam station Intersection, Yuksam station intersection ${\rightarrow}$ National Sport Institute.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.109-112
• /
• 2000

The EPRCA(Enhanced Proportional Rate Control Algorithm) is one of the explicit rate control algorithm recommended by the ATM forum. EPRCA algorithm is using only two threshold to buffer change is not considered for calculating ER value. In this paper to cover the shortage, two more variables are added for considering increase of buffer quantity. So calculating proper ER would avoid before getting into the congestion situation. To analysis the affect, EPRCA and proposed algorithm are compared through simulation by analysis of change of buffer length and ACR change

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1384-1396
• /
• 1998

This paper ivestigates the performance of a relative rate (RR) switch algorithm for the rate-based available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. A RR switch may notify the network congestion status to the source by suing the congestion indication (CI) bit or no increase (NI)bit in the backward RM (BRM) cells. A RR switch can be differently implemented according to the congestion detectio and notification methods. In this paper, we propose three implementation schemes for the RR switch with different congestion detection and notification methods, and analyze the allowed cell rate (ACR) of a source and the queue length of a switch in steady state. In addition, we derive the upper and lower bounds for the maximum and minimum queue lengths for each scheme respectively, and evaluate the effects of the ABR parameter values on the queue length. Furthermore, we suggest the range of the rage increase factor (RIF) and rate decrease factor (RDF) parameter values which can prevent buffer overflow and underflow at a switch.