• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.17-25
• /
• 2003

In the current bandwidth mechanism, ISPs provide guaranteed internet bandwidth within itself domains. Also transmission of data through the network can cause congestion. An inevitable consequence is partly responsible for the difficulties to ISPs and customers. In economic views, multiple demands for a scarce resource are mediated through a bandwidth market. Using the auction-based admission algorithm In price congestion, I propose a different pricing scheme for statistically guaranteed QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.593-603
• /
• 1997

Connection admission decision in ATM networks requires decision made in real time using fast algorithm. It is difficult to construct a model of the multiplexed traffic and thus, approximation of the traffic load is necessary. In this paper, we propose a measurement-based dynamic CAC(Connection admission Control) in ATM(Asynchronous Transfer Mode) networks, which observes current traffic by the moving window and set the window size to the value which is computed from the measured cell loss amount. It is based on the measurements of the traffic load over an admission period that is load enough to reflect the current traffic behavior instead of analytic modeling. And, the dynamic reallocation of bandwidth for each class leads to effective bandwidth utilization. The performance of proposed method is analyzed through computer simulation. The performance of proposed method is analyzed by using SIMAN simulation package and FORTRAN language. As can be seen in the simulation result, cell loss performance and bandwidth utilization have been increased.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1482-1484
• /
• 2010

A new TCP protocol can succeed for large bandwidth delay product when it meets network bandwidth utilization efficiency and fair sharing. We introduce a novel congestion control algorithm which employs queueing delay information in order to calculate the amount of congestion window increment in increase phase, and reduces congestion window to optimal estimated bound as packet loss occurs. Combination of such methods guarantees that the proposal utilizes fully network bandwidth, recovers quickly from packet loss in wireless link, and preserves fairness for competing flows mixed short RTT and long RTT. Our simulations show that features of the proposed TCP meet the desired requirements.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1352-1355
• /
• 2009

TCP에서 사용되는 혼잡제어(Congestion control)는 많은 이점이 있지만 그에 상응하는 단점이 존재한다. 가장 널리 사용되고 있는 TCP-Reno는 혼잡이 발생되면 혼잡 윈도우(Congestion Window)크기를 절반으로 줄이고 빠른 회복(fast recovery), 빠른 재전송(fast transmit)을 수행한다. 하지만 네트워크가 고속 네트워크로 접어들면서 효율적인 측면에서 이러한 기법들을 적용하기에는 문제가 따른다. 현재 사용되고 있는 TCP는 혼잡이 발생하면 선형적으로 점진적으로 증가 하기 때문에 많은 대역폭을 지원하는 고속 네트워크에서는 이러한 TCP의 혼잡 제어가 오히려 비 효율적이다. 본 논문에서는 이러한 문제점을 해결하기 위해 혼잡 윈도우 증가율을 추가한 혼잡제어 기법인 TCP-FBA(Fast Bandwidth Acquisition)를 제안한다.

• Journal of Digital Contents Society
• /
• v.16 no.6
• /
• pp.917-925
• /
• 2015

WebRTC is one of the most recent technologies that supports browser-to-browser for voice calling, video chat, and P2P file sharing without the need of either internal or external plugins. However, there has some limitation which lets our development deal with many problems. This research will focus just on a small field of that problem which is bandwidth. While the bandwidth for downloading and uploading is fixed by service providers, but the number of users in a certain area is increasing largely by the time. In this paper, we propose a model to overcome the limitation of the bandwidth based on fuzzy control to adjust utilized bandwidth by changing frame rate and resolution of streaming video in the client itself.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3479-3489
• /
• 2000

Most of the study on fairness control method for Distributed-Queue Dual-Bus(DQDB) have been performed under specific load types such as equal probability load types or symmetric load types. On Web-based internet enviroments client-server load types are more practical traffic patlerns than specrfic load types. In this paper, an effiective fairness control method to distribute DQDR network bandwidth fairly to all stations under a client-server load is proposed. In order to implement a dynamic bandwidth timing capabihty needed to distribute the bandwidth fairty at heavy loads, the proposed method uses two pararnetexs, one is an access hrnit to legulate each station's packet transmission and the other is the number of extra emply slots that are yielded to downstream stations. In point of implementation this mechanism is simpler and easier than Bandwidth Tuning Mechanism(BTM) that uses an intermediate pattern and an adptation function. Simulation results show that it outperforms othen mecharusms.

• Journal of Digital Contents Society
• /
• v.2 no.2
• /
• pp.129-138
• /
• 2001

With the explosive growth and pervasive of the Internet, dynamic bandwidth allocation is nessary for ATM streams that carry various traffic. In order to provide quality of service(QoS) guarantees and to give the minimum cell rate, new bandwidth allocation scheme requires to be implemented. DFBA(Differential Fair Buffer Allocation) scheme is one of the methods for ATM GFR(Guaranteed Frame Rate) services. DFBA scheme treats cells selectively in a region between low buffer occupancy threshold and high buffer occupancy threshold. A big unbalance is introduced when the value being selected by DFBA scheme is greater than minimum rate. In a try to reduce the unbalance modified DFBA scheme is proposed. Selecting parameter according to the situation of network, this scheme is very effective to control the bandwidth in the various network situation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.943-950
• /
• 2005

Recently, many of researches on stream transmission for satisfying each of different real-time transmission condition of the multimedia data that demands various service quality through high-speed networks have been studied actively. In this paper, we design a scheme that discriminately reserves the network resources for the transmission of each multimedia application and propose a bandwidth allocation scheme for improving the utilization ratio of free resources. And we also propose a pipelining scheme for providing flexible real-time transmission. The proposed schemes can be used to support a real-time transmission by applying feedback transmission control method based on receiving buffer for guaranteeing the synchronization conditions requested by the multimedia data. Moreover, we propose a transmission control scheme that can take the amount of network resources down to the minimum amount within the range of permissible error-range under the guarantee with no quality degradation simultaneously when the bottleneck is caused by the network congestion. Finally, we propose a dynamic bandwidth smoothing scheme that can smooth the maximum bandwidth to the demand of each video steam for giving continuous transmission to the delay sensitive video steam between senders and receivers.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3390-3398
• /
• 1999

To achieve high-speed communication and to improve QoS characteristics, ATM is now being used as underlying transfer mechanism of Internet protocols, or TCP/IP. When TCP uses the ABR service in ATM networks, the ABR service control is important to improve the performance of TCP/IP traffic as long as there is no interaction between ABR rate control and TCP flow control. In such environment, the interoperability of EFCI and ER switches becomes unavoidable in order to more effectively control ABR traffic in ATM network. In this paper, we use the model of mixed EFCI-ER environment and discuss the performance issues, e.g., the fairness of bandwidth allocation, drop rate, throughput by using various ER switch algorithms. Among various ERSwitch algorithms, we present one algorithm that have a less network topology and allocate the fair share of VC bandwidth by simulation results.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.05a
• /
• pp.115-119
• /
• 2007

In this paper, practical problems will be covered in applying preview control to real tracked vehicle systems. Previous researches about the preview control assume that the vehicle speed is constant and the actuators have full frequency bandwidth. However, in order to apply it to real systems, those should be taken into account. Therefore this paper show the algorithm to apply the preview control to speed changing vehicles and performance variation according to a restricted frequency bandwidth.