• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.925-930
• /
• 2000

The Problem of allocating paths is very significant in order to transmit a large amount of various data on the ATM network. Therefore, selecting an optimal path among available paths between the a source node and a target node has been researched. Alternate paths designed in previous PNNI routing is not considered on the group-occupation so that traffic congestion happens, when errors occur in the network which consists of a hierarchical network architecture extendable to a large network, We propose the Top-Down algorithm considering an average of the occupation among the groups reported from a leader node in each group and minimizing a traffic congestion

• Journal of Korean Society of Transportation
• /
• v.5 no.2
• /
• pp.81-95
• /
• 1987

In line with the continued growth of car ownership, the traffic problems in central area of metropoles such as Seoul would become increasingly degraded. comparing with most western cities, the problems in Seoul are characterized by the improportionately high rates of intersection delay, station congestion, traffic accidents caused by weaving conflicts and pedestrian congestion. It is caused by the lack of flexibility I street network, which is prerequisite for upholding the efficacy of traffic management and control, resulted from the simplicity of network graph in terms of connectivity, street density and distribution by width. This pattern has been resulted from the prolonged policy pursuing the street-widening of the nagging bottleneck in such a short period since the 1950s, comparing that most western cities had undergone over several centuries an age of horse-and-vehicle transportation. In order to improve the expected traffic problems in central area over the coming periods of motorization, it is imperative to restructure the street network in Central Seoul so that the efficacy of traffic management and control may be operative. Based upon the long-range planning the street network should be restructured by stages so that cenral traffic may be controled by one-way operation and most through-traffic be detoured around fringe area.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.799-811
• /
• 2021

This paper considers a challenging problem: to simultaneously optimize the cost and the quality of service in opaque wavelength division multiplexing (WDM) networks. An optimization problem is proposed that takes the information including network topology, traffic between end nodes, and the target level of congestion at each link/ node in WDM networks. The outputs of this problem include routing, link channel capacities, and the optimum number of switch ports locally added/dropped at all switch nodes. The total network cost is reduced to maintain a minimum congestion level on all links, which provides an efficient trade-off solution for the network design problem. The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels (𝛾_w) equal to 35.72 %, 39.09 %, and 36.93 % compared to shortest path first routing and 𝛾_w equal to 29.41 %, 37.35 %, and 27.47 % compared to alternate routing in three different networks.

• Journal of Digital Convergence
• /
• v.10 no.1
• /
• pp.49-57
• /
• 2012

The Internet succeeded because of the end-to-end principle which allowed anyone to add functionality to the network. However, as the internet is increasingly becoming the platform for smart IT applications such as VoIP, IPTV, Cloud Computing and Smart Phone, networks are now under increasing strain of traffic congestion and the absence of quality of service insurances. To date, the debate over internet rules has focused on network neutrality rather than network efficiency. This article emphasizes the well-functioning role of market mechanism for the efficient use and further development of the network. To maximize the value of the network, this article proposes a differential treatment to packets based on customer types, and a two-part tariff pricing rule to secure funding to expand and upgrade networks.

• Proceedings of the KOR-KST Conference
• /
• 1999.10a
• /
• pp.47-52
• /
• 1999

The methods currently in use to evaluate traffic impacts on the transportation network involve some fundamental shortcomings. First, the methodss do not properly take into account regional and local traffic impacts on the transportation network simultaneously. Second, temporal distribution of traffic, a major contributor to transportation problems, is not accurately accounted for. Third, traffic impact studies require costly and labor-intensive efforts to collect necessary data and to establish to collect necessary data and to establish traffic impact models. In this research, a new method called AMIS is developed for congestion management, access control, and impact simulation to overcome the shortcomings involved in the current methods. The new method is designed for a variety of scenarios such as access management strategies, land use policies, traffic impacts, and other congestion management strategies. This method can effectively be used, with little modification, anywhere in the United States. It is an improvement over the current traffic impact simulation methods that produces more reliable and accurate traffic impact estimates. The case studies conducted in this research have offered evidence that the new method, AMIS, is a credible congestion management tool. Most importantly, a case study presented in this paper illustrates how the new method can be used not only to estimate regional and local impacts of alternate supply management policies in the course of a day, but virtually on an hour-by-hour basis.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.3
• /
• pp.230-234
• /
• 2007

Generally, huge amounts of data traffic are generated by using broadcasting method to deliver sensing data to a sink node reliably so that it makes a severe network saturation problem resulting in unreliable data transfer. In order to handle this problem, a new congestion control protocol is required for supporting reliable data transfer, minimal use of energy and network resources at the same time in wireless sensor networks. In this paper, it proposes a Protocol to guarantee both a reliable transfer in data accuracy and minimum consumption of energy waste by using Hop-by-Hop sequence number and DSbACK(Delayed and Selective ACK Buffer Condition) scheme. In addition, it proves that reliability and energy efficiency are enhanced by the proposed method with the simulation results performed on TinyOS platform which is a component based built-in OS announced by UC Berkely with the performance comparison of other existing methods.

• Journal of Korea Multimedia Society
• /
• v.3 no.4
• /
• pp.399-406
• /
• 2000

There are sendee_based research and receiver_based research for dynamic adaptation to network congestion which arises from multicast video conference ; the former results in bandwidth waste of receivers who use high available bandwidth on account of average loss rate in transmission rate, the latter in short of the method that divides layers of available bandwidth of receivers dynamically. In order to do so, in this paper, we established two multicast groups divided into non-congestion status and congestion status according to receiver's network state, and implemented the bandwidth management algorithm which is designed for providing receivers with profitable qualities for available bandwidth by letting them choose each group dynamically in reference to loss rate. As a result, experiments proved that bandwidth waste problem was improved by receiver's dynamic choice according to loss rate.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.65-70
• /
• 2001

In this paper, a Modified RED algorithm for congestion avoidance in IP networks is presented. The RED detects incipient congestion by computing the average queue size. By notifying only a randomly selected fraction of connection, it causes to the global synchronization or fairness problem, And also, the network characteristics need to be known in order to find th optimum average queue length. When the average queue size exceeds a minimum threshold, a modified RED algorithm drops packets based on the state of each connection. Performance is improved because of keeping the average queue size low while allowing occasional bursts of packets in the queue, we compare performance of modified RED with RED and Drop Tail in terms of goodput, network utilization and fairness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1480-1489
• /
• 1996

In ATM networks there are two methods in traffic control as schemes advancing the quality of service. One is reactive control after congestion and the other which is generally recommended, is preventive control before congestion, including connection admission control on call leel and usage parameter control, network parameter control, priority control and congestion control on cell level. In particular, usage parameter control is required for restricting the peak cell rate of bursy tracffic to the parameter negotiated at call set-up phase since the peak cell rate significantly influences the network quality of service. The scheme for progressing quality of service by usage parameter control is themethod using VSA(Virtual Scheduling Algorlithm) recommended ITU-T. The method using VSSA(Virtual Scheduling Suggested Algorlithm) in this paper is suggested by considering cell delay variation and token rate of leaky bucket, compared VSA and VSANT(Virtual Scheduling Algolithm with No Tolerance) with VSSA which polices violated cell probability of conformed peak cell rate and intentionally excessive peak cell rate. VSSA method using IPP(Interruped Poisson Process) model of input traffic source showed more quality of service than VSA and VSANT methods as usage parameter control because the suggested method reduced the violated cell probability of contformed peak cell rate and intentionally excessive peak cell rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1052-1062
• /
• 2004

Recent studies have pointed out that existing high-speed TCP protocols have a severe unfairness and TCP friendliness problem. As the congestion window achieved by a high-speed TCP connection can be quite large, there is a strong possibility that the sender will transmit a large burst of packets. As such, the current congestion control mechanisms of high-speed TCP can lead to bursty traffic flows in hi인 speed networks, with a negative impact on both TCP friendliness and RTT unfairness. The proposed solution to these problems is to evenly space the data sent into the network over an entire round-trip time. Accordingly, the current paper evaluates this approach with a high bandwidth-delay product network and shows that pacing offers better TCP friendliness and fairness without degrading the bandwidth scalability.