• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1076-1086
• /
• 2006

In providing video-on-demand (VoD) services to a number of clients through networks, the bandwidth requirements of video transmission restrict VoD services. For this reason, many significant broadcasting-based VoD schemes have been proposed to efficiently support services. However, the broadcasting-based VoD schemes approach needs frequency channel hopping, using many channels at the same time and managing many segments of a video. These make it difficult to implement. In this paper, we propose a Harmonic Staggered broadcasting scheme which has a simple structure and substantially improved VoD efficiency. The numerical results demonstrate that the viewer's waiting time of the Harmonic Staggered broadcasting scheme is close to the harmonic broadcasting scheme and the maximum buffer requirements of this can be adapted for demanding rate by adjusting the short front part of a video sizes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2897-2908
• /
• 1996

This paper presents an effective call admission control algorithm using the Common Pool on the virtual path in ATM networks. Call admission control decides whether or not to accept a new call, so as to ensure the service quality of both individiual existing calls and of the new call itself. In the proposed algorithm, a new call is accepted when the sum of the bandwidths of existing calls and of the new call will not exceed lind capacity. If the sum of their bandwidths exceed link capacity, reserved bandwidth of Common Pool is considreed to accept the new call. Computer simulation results using a simuple network model are algorithm given to evaluate accuracy and call blocking probability by the proposed method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.1
• /
• pp.66-71
• /
• 2012

In this paper, using the bargaining game theory, we propose a bandwidth management scheme that allocates bandwidth in an efficient and proportionally fair manner between the service classes with different service requirements. Since the traffic input rates of the classes are asymmetric in most of the time, the proposed scheme allocates bandwidth in proportion to the traffic input rates to increase the bandwidth utilization while protecting the quality of service of a class against the excessive traffic input of the other classes. In addition, the proposed method considers the weights of classes so that the bandwidth is allocated differentially among the classes.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.8
• /
• pp.349-355
• /
• 2024

This paper proposes a new congestion control algorithm, Dynamic Bandwidth Aware Congestion Control (DBAC), to enhance data transmission efficiency in modern network environments that require the use of multiple paths. Traditional single-path TCP has limitations that are addressed by Multipath TCP (MPTCP), which can utilize multiple paths simultaneously to maximize bandwidth and improve transmission reliability. However, MPTCP suffers performance degradation in high-speed, long-distance networks due to path characteristic asymmetry. To overcome this, DBAC combines TCP CUBIC for paths with high BDP and LIA for regular paths, optimizing resource utilization and fairness. Experimental results show that DBAC significantly improves resource utilization and transmission performance, effectively using over 80% of the bandwidth on high BDP paths, compared to less than 20% with traditional LIA.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.456-458
• /
• 1998

최근 인터넷 상에서의 효율적인 영상/음성 시스템을 개발하려는 연구가 활발히 진행되고 있다. 이러한 연구중의 중요한 분야로는 인터넷의 대역폭을 효율적으로 사용하려는 즉 가변적인 인터넷의 사용가능한 대역폭을 예측하고, 예측된 대역폭에 알맞게 영상과 음성 정보를 압축하는 연구일 것이다. 본 논문에서는 사용 가능한 대역폭 예측에 알맞게 영상정보의 압축률을 조절하는 기법을 소개한다. 본 논문에서는 영상 압축 알고리즘의 하나인 H.261에서 압축률에 관련된 변수 값과 다양한 영상에서의 압축율 변화의 상관관계를 측정하였다. 또한 본 논문에서는 측정된 상관 관계를 수식화되고, 이 수식을 어떻게 전송량 조절 (flow control)알고리즘에 사용할 것인가를 제안한다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.11 no.7
• /
• pp.1233-1239
• /
• 2000

In this paper, a new approach is proposed for effectively estimating the occupied bandwidth of frequency modulation (FM) signals. The proposed method makes use of the smoothing niter for removing the perturbation of spectrum envelope, which frequently occurs in FM signals having the instantaneous frequency. An effective procedure is derived for finding the relatively accurate bandwidth of FM signals combined with x-dB bandwidth measurement method, which International Telecommunication Union-Radiocommunication (ITU-R) recommended. It was shown that the proposed approach provides superior performance relative to the one obtained with the x-dB bandwidth measurement method in terms of sample bias and mean squared error of bandwidth estimates.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.529-531
• /
• 2002

VoIP기술의 확산과 그에 따른 IP기반의 망을 포함한 packet, Multimedia서비스를 제공하는 서비스가 늘고있다. 그러나 실시한 서비스를 필요로 하는 이 서비스의 경우에는 그에 따르는 경로에 확실한 대역폭의 조건이 요구되고 있다. 하지만 best-effort방식을 사용하는 기존의 망에서는 대역폭의 확실한 보장이 이루지기 힘들다. 하지만 MPLS와 트래픽 엔지니어링 기술의 발전으로 다중경로 패킷 전달 및 동적인 부하 제어가 가능하게 되었다. 곧 차별화된 서비스에 따른 대역폭의 할당이 이루어질 수 있다. 동적인 부하 제어는 네트웍의 상태를 고려하여 경로간의 부하를 조절함으로써 네트웍의 효율성을 높일 수 있으나, 상태 정보의 시간차이에 의해 불안정한 상태에 이르기 쉽다. 본 논문에서는 차별화된 서비스를 하기 위해 부하의 할당을 안정적으로 변화시키면서도 효율적인 부하로 용량에 맞게 흐름을 받아들이고 패킷을 전송하는 기법을 제안한다.

• Annual Conference of KIPS
• /
• 2000.04a
• /
• pp.502-506
• /
• 2000

본 논문에서는 이동국의 위치를 추정하여 최근접셀과 인접셀을 구분하고 차등적인 대역폭 할당을 하므로써 대역폭의 효율적인 활용을 가능하게 하였고, 서비스 트래픽을 실시간 서비스와 비실시간 서비스로 분류함으로써 무선 멀티미디어 환경하에서 QoS를 보장해 줄 수 있는 방법을 제안했다. 또한 서로 다른 크기의 셀이 혼재하는 중첩 구조에서의 셀특성을 살려 신규호 및 핸드오프 호의 blocking확률과 dropping확률을 감소시킬 수 있는 방법을 제안하고 기존의 대역폭 할당방법과 비교 시뮬레이션하였다.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.385-390
• /
• 2010

Fair and efficient bandwidth allocation methods using the coalition game theory and the bargaining game theory following the axiomatic approach have been proposed when sending nodes with different traffic input rate try to share the bandwidth. These methods satisfy the axiomatic fairness provided by the mathematical ground of the game theories. However, since the axioms of the two game models are different from one another, the allocated bandwidths to each sending nodes become different even in the same communication environments. Thus, in this paper, we model the bandwidth allocation problem with these game theories, and quantitatively compare and analyze the allocated bandwidth and loss rate of each sending nodes in various communication environments. The results show that the bargaining game allocates relatively less bandwidth to a node with a higher sending rate than that with a lower sending rate while coalition game allocates bandwidth according to the sending rate of each node.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.100-109
• /
• 2007

Streaming protocol with the Available Bandwidth measurement scheme has problems that are to measure a Available Bandwidth uncorrectly and slowly. In this basis, in order to overcome limitations of the previous streaming protocols, we propose the NABO that is a New Available Bandwidth measurement scheme used by OWD(One-Way Delay). Proposed NABO(New Available Bandwidth measurement based on OWD) measures the constant transmission delay occurred by bottleneck link capacity and the variable delay. Competing traffic contribute to the variable delay. Through the measurement of the constant transmission delay and the competing traffic, a NABO can measure the Available Bandwidth correctly and fast in network. The simulation result proves that the proposed NABO has a performance that satisfies both accuracy viewpoint and measurement speed viewpoint.