• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.143-148
• /
• 2002

Congestion may take place in the ATM network because of high-speed cell transmission features, and cell delay and loss also can be caused by unexpected traffic variation. Thus, traffic control mechanisms are needed. One of them to decrease congestion is the Cell shaping. This paper proposes a hybrid type cell shaper composed of a Leaky Bucket with token pool, Tn with time window, and a spacing control buffer. The simulator BONeS with the ON/OFF traffic source model evaluates the performance of the proposed cell shaping method. Simulation results show that the cell shaping concerning the respective source traffics is adapted to and then controlled on the mean bit rate.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.138-141
• /
• 2010

Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.39-44
• /
• 2003

The network performance gets down during congestion periods to solve the problem effectively. A RED(Random Earl Detection) algorithm of the queue management algorithm is proposed and IETF recommends it as a queue management. A RED algorithm controls a congestion aspect dynamically. In analyzing parameters when static value of parameter is set in the gateway cannot be handled the status of current network traffic properly We propose the Effective RED algorithm to solve with the weakness of RED In this algorithm the maximum drop probability decides to accept or drop the interning packets, is adjusted dynamically on the current queue state for controlling the congestion phase effectively in the gateway. This algorithm is confirmed by computer simulation using the NS(Network Simulator)-2.

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.134-138
• /
• 1998

Because of the statistical fluctuations and the high 'time-variability' nature of the traffic, managing the resources of the network require highly dynamic techniques with minimal Intervention and reaction times, and adaptive and learning capabilities. The neural networks normalizes the ATM cell arrival rate and queue length and has the adaptive learning algorithm, and experimentally investigated the method to prevent the congestion generated in ATM networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.354-363
• /
• 1994

This paper describes the method that voice traffic is served efficiently in BISDN. Voice is divided into talkspurt and silent period, and it is possible to transmit olny talksurt by the speech activity detection. This paper described the voice traffic control algorithm in the ATM network where cell discarding method is applied to the embedded ADPCM voice data. For traffic control, the cell discarding was used over low priority cells when it overflows the queue threshold. To estimate the efficiency of traffic control algorithm, the computer simuation was performed with cell loss probability, queue length and mean delay as performance parameters. The embedded ADPCM voice coding and cell disscarding resulted in improving the voice cell traffic efficiency and the dynamic control over network congestion.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.826-836
• /
• 2016

Increase of hypertext transfer protocol (HTTP)-based video popularity causes that broadband and Internet service providers' links transmit mainly multimedia content. Network planning, traffic engineering or congestion control requires understanding of the statistical properties of network traffic; therefore, it is desirable to investigate the characteristic of traffic traces generated, among others, by systems which employ adaptive bit-rate streaming. In our work, we investigate traffic originating from 120 client-server pairs, situated in an emulated laboratory environment, and multiplexed onto a single network link. We show that the structure of the traffic is distinct from the structure generated by first and second generation of HTTP video systems, and furthermore, not similar to the structure of general Internet traffic. The obtained traffic exhibits negative correlations, anti-persistence, and its distribution function is skewed to the right. Furthermore, we show that the traffic generated by clients employing the same or similar play-out strategies is positively correlated and synchronised (clustered), whereas traffic originated from different play-out strategies shows negative or no correlations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.965-973
• /
• 2007

We analyzed that the loss of data in TCP protocol based wireless networks caused by overlapped responses in bi-directional nodes that were resulted in out of the data sequence. This loss can be prevented by using revised TCP rate control algorithm and the performance of throughput can also be improved. The rate control algorithm is applied when the congestion happens between nodes while traffic packets are retransmitting in TCP bandwidth. In addition to applying the rate control algorithm, we determine the number of system clients in bandwidth and the average of pausing time between transmitting serial files to produce a competitive level so that an efficient performance of rapid retransmitting for the loss of multi-packets. This paper discusses the improvement of congestion control in that the decrease of the loss, firstly, as ensuring an efficient connection rate and, secondly, as using sliding window flow control.

• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.527-529
• /
• 2015

The control delays at signal intersections have proved the source of numerous vehicular and environmental complications. Control delays both directly and indirectly hinder time- and cost-effective driving by extending the duration of time spent on the road and exhausting excessive amounts of fuel. They furthermore cause traffic congestion, thereby raising overall emission levels. It is therefore imperative to reduce control delays in order to achieve time and fuel economy and reduce vehicle-related pollution. The following study accordingly uses genetic algorithms to optimize traffic signals in congested environments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.733-750
• /
• 2019

Software Defined Networking (SDN) is a new network paradigm, allowing administrators to manage networks through central controllers by separating control plane from data plane. So, one or more controllers must locate outside switches. However, this separation may cause delay problems between controllers and switches. In this paper, we therefore propose a Priority-based Scheduling policy for OpenFlow (PSO) to reduce the delay of some significant traffic. Our PSO is based on packet prioritization mechanisms in both OpenFlow switches and controllers. In addition, we have prototyped and experimented on PSO using a network simulator (ns-3). From the experimental results, PSO has demonstrated low delay for targeted traffic in the out-of-brand control network. The targeted traffic can acquire forwarding rules with lower delay under network congestion in control links (with normalized load > 0.8), comparing to traditional OpenFlow. Furthermore, PSO is helpful in the in-band control network to prioritize OpenFlow messages over data packets.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.289-296
• /
• 2015

Wireless multimedia sensor network senses and transfers mass multimedia data. Also, it is sensitive to latency. This thesis proposes a routing technique based on traffic priority in order to improve the network efficiency by minimizing latency. In addition, it proposes a congestion control mechanism that uses packet service time, packet inter-arrival time, buffer usage, etc. In this thesis, we verified the reduction of packet latency in accordance with the quality level of packet as a result of the performance analysis through the simulation method. Also, we verified that the proposed mechanism maintained a reliable network state by preventing packet loss due to network overload.