• Journal of Communications and Networks
• /
• 제13권5호
• /
• pp.518-524
• /
• 2011

A high assurance IP encryption (HAIPE) compliant protocol accelerator is proposed for military networks consisting of red (or classified) networks and black (or unclassified) networks. The boundary between red and black sides is assumed to be protected via a HAIPE device. However, the IP layer encryption introduces challenges for bandwidth on demand satellite communication. The problems experienced by transmission control protocol (TCP) over satellites are well understood: While standard modems (on the black side) employ TCP performance enhancing proxy (PEP) which has been shown to work well, the HAIPE encryption of TCP headers renders the onboard modem's PEP ineffective. This is attributed to the fact that under the bandwidth-on-demand environment, PEP must use traditional TCP mechanisms such as slow start to probe for the available bandwidth of the link (which eliminates the usefulness of the PEP). Most implementations recommend disabling the PEP when a HAIPE device is used. In this paper, we propose a novel solution, namely broadband HAIPE-embeddable satellite communications terminal (BHeST), which utilizes dynamic network performance enhancement algorithms for high latency bandwidth-on-demand satellite links protected by HAIPE. By moving the PEP into the red network and exploiting the explicit congestion notification bypass mechanism allowed by the latest HAIPE standard, we have been able to regain PEP's desired network enhancement that was lost due to HAIPE encryption (even though the idea of deploying PEP at the modem side is not new). Our BHeST solution employs direct video broadcast-return channel service (DVB-RCS), an open standard as a means of providing bandwidth-on-demand satellite links. Another issue we address is the estimation of current satellite bandwidth allocated to a remote terminal which is not available in DVBRCS. Simulation results show that the improvement of our solution over FIX PEP is significant and could reach up to 100%. The improvement over the original TCP is even more (up to 500% for certain configurations).

• 제어로봇시스템학회논문지
• /
• 제6권8호
• /
• pp.623-628
• /
• 2000

Video-on-demand system in which users can request any video through the network at any time is made possible by rapid increase in network bandwidth and capacity of the media server. However true video-on-demand system cannot support all requests since bandwidth requirement is still too demanding. Therefore efficient bandwidth reduction algorithm is necessary. both the piggybacking method and the batching method are novel solutions that can provide more logical number of streams than the physical system can support. Of course each of them has its pros and cons. hence piggybacking with batching-by-size can take advantage of both the schemes. Some parameters such as the size of batch and the size of the catch-up window should be adjusted and order to maximize the bandwidth reduction for piggybacking with batching-by-size method. One of the most important parameters is decided optimally in this paper. Simulation shows that the optimized parameter can achieve considerable reductionand consequently remarkable enhancement in performance.

• Journal of Computing Science and Engineering
• /
• 제9권3호
• /
• pp.134-141
• /
• 2015

In on-demand multimedia streaming systems, streaming techniques are usually combined with proxy caching to obtain better performance. The patch streaming technique has no start-up latency inherent to it, but requires extra bandwidth to deliver the media data in patch streams. This paper proposes a proxy caching technique which aims at reducing the bandwidth cost of the patch streaming technique. The proposed approach determines media prefixes with high patching cost and caches the appropriate media prefix at the proxy/local server. Herein the scheme is evaluated using a synthetically generated media access workload and its performance is compared with that of the popularity and prefix-aware interval caching scheme (the prefix part) and with that of patch streaming with no caching. The bandwidth saving, hit ratio and concurrent number of clients are used to compare the performance, and the proposed scheme is found to perform better for different caching capacities of the proxy server.

• 한국컴퓨터정보학회논문지
• /
• 제10권6호
• /
• pp.209-218
• /
• 2005

링형 광 액세스망에서 능동형 광네트워크(AON: Active Optical Network)는 DWDM(Dense Wavelength Division Multiplexing)을 이용하여 요구대역폭(BoD: Bandwidth on Demand)에 따라서 가입자에게 원활한 서비스를 제공할 수 있다. 이를 위하여 기존의 광 기가비트 이더넷 스위치에서 다수개의 파장 및 서브캐리어(Sub-Carrier) 접속을 지원하며, 특정 파장을 분기하는 WADM (Wavelength Add Drop Multiplexer)과 링의 형태로 연결된다. WADM에서 분기된 특정 파장은 가입자단에 이르러 서브캐리어별로 역다중화 되어 가입자에게 분배되므로 가입자망의 분배가 시작되는 광 기가비트 이더넷 스위치와 가입자 단말 접속 장치간의 능동적인 연결이 가능한 구조를 가진다 본 논문에서는 이러한 AON 구조에서 BoD에 따라서 달라지는 버퍼의 크기를 비교 분석하고 또한 비트의 지체시간을 서버의 처리율과 비교 분석한다. 이러한 실험을 통하여 소요 시간의 한계를 결정함으로써 가입자에게 요구 대역폭에 따른 원활한 서비스를 제공할 수 있는 네트워크의 동적 운용 프로토콜 및 효율적인 알고리즘 구현을 위한 기준을 제시한다.

• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.709-730
• /
• 2017

To address the challenge of unprecedented growth in mobile data traffic, ultra-dense network deployment is a cost efficient solution to offload the traffic over some small cells. The overlapped coverage areas of small cells create more than one candidate access points for one mobile user. Signal strength based user association in IEEE 802.11 results in a significantly unbalanced load distribution among access points. However, the effective bandwidth demand of each user actually differs vastly due to their different preferences for mobile applications. In this paper, we formulate a set of non-linear integer programming models for joint user association control and user demand guarantee problem. In this model, we are trying to maximize the system capacity and guarantee the effective bandwidth demand for each user by soft-association control with a software defined network controller. With the fact of NP-hard complexity of non-linear integer programming solver, we propose a Kernighan Lin Algorithm based graph-partitioning method for a large-scale network. Finally, we evaluated the performance of the proposed algorithm for the edge users with heterogeneous bandwidth demands and mobility scenarios. Simulation results show that the proposed adaptive soft-association control can achieve a better performance than the other two and improves the individual quality of user experience with a little price on system throughput.

• 한국통신학회논문지
• /
• 제30권11B호
• /
• pp.784-791
• /
• 2005

인터넷 환경에서 VoD 서비스를 제공하기 위해서는 시스템 자원과 네트워크 대역폭을 효율적으로 사용해야 한다. 이러한 효율성을 높이기 위한 대안으로 오버레이 멀티캐스트를 생각 할 수 있지만 실제로 On-Demand 서비스에 적용하기 위해서는 많은 결점의 보완이 필요하다. 본 논문에서는 이러한 결점을 보완하고 기존 시스템 환경의 간단한 확장으로 VoD 서버의 자원과 대역폭을 효율적으로 사용할 수 있는 오버레이 멀티캐스트 모델을 제안한다. 제안된 모델은 호스트의 공유 버퍼와 패칭 채널 그리고 트리 구성 알고리즘을 이용하여 임의적인 사용자 데이터 요구시점은 물론 다양한 재생율 지원 등 제한사항이 없는 On-Demand 서비스 수행이 가능하다. 시뮬레이션 결과는 제안된 모델이 기존의 유니캐스트를 이용한 경우보다 월등히 많은 사용자를 수용할 뿐 아니라 네트워크의 성능 또한 향상시켜줌을 보여주고 있다.

• 정보처리학회논문지C
• /
• 제16C권4호
• /
• pp.487-494
• /
• 2009

VOD(Video On Demand) 시스템은 실시간으로 사용자의 요구를 받아들여 동영상 서비스를 제공하는 시스템으로서 크게 서비스를 제공하는 서버와 사용자의 요구를 처리하는 클라이언트로 구성된다. 하나의 서버에서 다수의 사용자에게 1:1로 서비스를 제공하기에는 네트워크 대역폭의 제약이 크기 때문에 이를 해결하기 위한 다양한 연구들이 진행되어왔다. 그 동안 제안된 다양한 멀티캐스트 기반의 VOD시스템들 중에서 Batching방식의 VOD시스템이 단순하면서 네트워크 부하가 적은 것으로 알려져 있다. 하지만 Batching방식에 의한 VOD시스템에서는 VCR(Video Cassette Recorder)기능을 제공하기 어렵기 때문에 VOD시스템의 On-Demand 특성을 제대로 제공하지 못하는 단점이 있다. 본 논문에서는 대표적인 동영상 압축표준인 MPEG의 특성을 이용하여 VCR기능을 제공하기 위해 필요한 대역폭을 최소화하는 기법을 제안한다. 제안하는 기법에서는 MPEG로 압축된 동영상에서 독립적 재생이 가능한 I픽쳐만 추출하여 빠른 재생을 위한 데이터를 별도로 구성한다. 이렇게 구성된 빠른 재생을 위한 데이터와 일반적인 재생을 위한 데이터 모두 Batching방식으로 멀티캐스팅으로 전송한다. 성능분석을 통하여 제안된 기법을 사용할 경우 클라이언트의 버퍼요구량과 네트워크 사용량을 줄이고 이와 더불어 CPU사용량도 줄어드는 것을 확인하였다.

• ETRI Journal
• /
• 제26권2호
• /
• pp.185-188
• /
• 2004

In this paper, we design a two-step scheduling algorithm to support multiple bandwidth allocation policies for upstream channel access in an Ethernet passive optical network. The proposed scheduling algorithm allows us a simultaneous approach for multiple access control policies: static bandwidth allocation for guaranteed bandwidth service and dynamic bandwidth allocation for on-demand, dynamic traffic services. In order to reduce the scheduling complexity, we separate the process of the transmission start- time decision from the process of grant generation. This technique does not require the timing information of other bandwidth allocation modules, so respective modules are free from a heavy amount of timing information or complex processing.

• ETRI Journal
• /
• 제44권6호
• /
• pp.945-954
• /
• 2022

The 5G mobile network is promising to handle the dynamic traffic demands of user equipment (UE). Unmanned aerial vehicles (UAVs) equipped with wireless transceivers can act as flying base stations in heterogeneous networks to ensure the quality of service of UE. However, it is challenging to efficiently allocate limited bandwidth to UE due to dynamic traffic demands and low network coverage. In this study, a blockchain-enabled bandwidth allocation framework is proposed for secure bandwidth trading. Furthermore, the proposed framework is based on the Cournot oligopoly game theoretical model to provide the optimal solution; that is, bandwidth is allocated to different UE based on the available bandwidth at UAV-assisted-based stations (UBSs) with optimal profit. The Cournot oligopoly game is performed between UBSs and cellular base stations (CBSs). Utility functions for both UBSs and CBSs are introduced on the basis of the available bandwidth, total demand of CSBs, and cost of providing cellular services. The proposed framework prevents security attacks and maximizes the utility functions of UBSs and CBSs.