• Journal of Digital Contents Society
• /
• v.18 no.2
• /
• pp.411-422
• /
• 2017

Current policies for sharing bandwidth increase average throughput and improve utilization of the bandwidth in the local network. However, with these policies, a central administer, which is responsible for allocating bandwidth to each network flow, cannot allocate resources based on user characteristics. Thus, it leads to unfair bandwidth allocation because it does not guarantee services based on user characteristics. Therefore, we propose a novel negotiation method to share the bandwidth in a limited bandwidth network, in which, a user negotiates with other users to gain more resource. Ideally, we use a fuzzy system to infer and determine whether a device will request bandwidth or not based on the current usage of the given device. We conduct two experiments consisting of a video streaming simulation in OPNET and a real-time video streaming in WebRTC. The results of the experiment indicate that the proposed method can flexibly share the bandwidth utilization based on user's requirement in the network.

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

기존의 연구에서는 광 경로를 설정할 때 파장 전체를 할당함으로써 많은 대역폭 낭비를 초래하였고, 타임슬롯을 할당할 때 처음 소스 노드에서 사용할 타임슬롯을 정하여 호연결 설정 (Call Setup) 을 함으로써 광 경로가 블록킹될 확률이 높았다. 본 논문에서는 광네트워크에서 효율적으로 RWTA 문제를 해결하기 위한 새로운 타임슬롯 할당 알고리즘을제안한다. 본 논문에서 제안하는 알고리즘은 호 연결 설정 시간까지의 타임슬롯 할당을 지연함으로써 광 경로가 블록킹될 확률을 최소화 할 수 있는 장점을 지닌 최근성 (recency) 에 근거한 타임슬롯 할당 알고리즘이다.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.169-176
• /
• 2008

In this paper, we develop radio resource management queueing model in IEEE 802.IS networks considering both connection and packet level. In the upper level connection, we model connection admission control depending on availability of bandwidth and priority queue in each service class. In the lower level packet, we model dynamic bandwidth allocation considering threshold and availability of bandwidth in each service class simultaneously. Hierarchical model is built using an extended Petri Nets, SRN (Stochastic Reward Nets). Bandwidth utilization and normal throughput as performance index for all service classes of traffic are calculated and numerical results are obtained.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.633-640
• /
• 2005

This paper proposes and analyzes a message scheduling scheme and corresponding bandwidth allocation method for the hard real-time communication on dual standard 802.11 Wireless LANs. By making the superframeof one network precede that of the other by half, the dual network architecture can minimize the effect of deferred beacon and reduce the worst case waiting timeby half. The effect of deferred beacon is formalized and directly considered to decide the polling schedule of PCF phase. Simulation results executed via ns-2 show that the proposed scheme can improve the schedulability by 3$36\%$ for real-time messages and give $9\%$ more bandwidth to non-real-time messages for the given stream sets, compared with the network whose bandwidth is just doubled with the same MAC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.33-42
• /
• 2001

We consider a model describing large scale performance of multiservice networks supporting both constant- and adaptive-rate services. As the number of constant-rate connection changes over time in multiservice networks, the available bandwidth for adaptive-rate connections changes as well. We estimate the available bandwidth for adaptive-rate service in a dynamically changing traffic environment based on Erlang fixed point equation and Little\`s law. The bandwidth allocation for adaptive-rate service is determined by the max-min fairness criterion. We find an upper bound on the average minimum throughput for adaptive-rate service, and 7how that the bound is achieved in large-capacity networks. This is verified using network examples. Since max-min fair allocation may not maximize the total throughput or revenue in a network, we consider adjustments via network level priority schemes to increase efficiency.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.37-44
• /
• 2005

This paper proposes a hybrid scheme for dynamic bandwidth allocation(DBA) in Ethernet passive optical network(EPON), which combines advantages of adaptive cycle and constant cycle-based schemes. The proposed scheme is based on IPACT scheme, but it operates as adaptive cycle or constant cycle mode according to the queue status of optical line terminal(OLT) for downstream transmission. Simulation results showed that the proposed scheme could achieve a similar throughput in downstream transmission to a constant cycle-based DBA scheme, while producing a similar delay performance to the IPACT scheme in upstream transmission.

• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.996-1001
• /
• 2010

In this paper, network selection algorithm for services of mobile IPTV(internet protocol television) and implementation of a hierarchical processing system for reducing overload by terminal with low speed is proposed. This algorithm selects the network according to the following priorities derived from formulas; value that uses remaining bandwidth, network cost, signal strength. If terminal has a low processing power for using selected network and TV service, quality of service declines due to the system overloading. Hence, we implemented system which processes selected network and TV services accomplished by layer divided. Through experiments results, the method of direct user network selection waits for bandwidth assignment. However, on the one hand, that waiting time in exhausted situation will be very long. On the other hand, if we consider the priority plot of used networks, we should select the network with the best state. Therefore, data transmission rate will keep on average and the waiting time will be low.

• 한국정보통신설비학회:학술대회논문집
• /
• 2004.08a
• /
• pp.302-307
• /
• 2004

이 논문은 제한된 대역폭을 가진 고정 채널 할당 문제를 유전알고리즘을 이용하여 최적화하는 방법을 제시한다. 또한 이 논문에서는 유전알고리즘의 미세조정 능력 향상을 위해 지역 최적화 방법을 고안하였다. 고정채널 할당 문제를 행렬로 표현하여 지역 최적화 알고리즘에서는 채널을 수평 또는 수직으로 움직임으로써 유전 알고리즘의 성능 향상을 꾀한다. 제안된 방법은 기존의 방법보다 뛰어난 성능 향상을 나타냄을 실험결과에서 보일 것이다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.739-740
• /
• 2013

This paper proposes a new dynamic bandwidth allocation algorithm for XGPON (10-Gigabit-capable passive optical network). The proposed algorithm uses a common service counter for each service class unlike to the existing algorithms. The unused bandwidth of a service class can be used for other service classes to increase bandwidth utilization. We illustrate examples to show the proposed algorithm is superior to existing algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.317-319
• /
• 2018

최근 인터넷을 통한 UHD (Ultra High Definition) 스트리밍 서비스의 수요가 증가했으며 네트워크에 효율적으로 비디오 스트리밍 서비스를 제공하기 위해 HTTP 적응적 스트리밍 (HTTP Adaptive Streaming, HAS) 서비스가 등장하였다. 그러나 HTTP 적응적 스트리밍은 세그먼트의 ON-OFF 패턴으로 인해 다중 클라이언트 환경에서 공정성 (Fairness), 안정성 (Stability), 효율성 (Efficiency)을 저하시키는 문제가 있다. 본 논문에서는 다수의 HAS 클라이언트 환경에서 공정성, 안정성, 효율성을 향상시키기 위한 홈 공유기에서 인코딩 비트율 기반의 대역폭 할당 기법을 제안한다. 제안 기법은 OFF 구간을 줄이기 위해 인코딩 비트율에 맞추어 할당할 대역폭을 결정함으로써 안정적인 스트리밍을 보장한다. 실험을 통해 다중 HAS 클라이언트 환경에서 공정성, 안정성 및 효율성이 향상된 것을 확인하였다.