• Journal of Communications and Networks
• /
• v.13 no.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).

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.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
• /
• v.9 no.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.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.209-218
• /
• 2005

In this paper, we present an Active Optical Network(AON) . The AON uses the Dense Wavelength Division Multiplexing(DWDM) from optical communication access network of ring type, and will be able to provide the smoothly service in the Bandwidth on Demand by using DWDM. It supports the connection of the multiple wavelength and the Sub-Carrier from the optical gigabit ethernet switch. The Wavelength Add Drop Multiplexer(WADM) extracts a specific wavelength, and composes a node of the ring network. The specific wavelength becomes demultiplexing in the Sub-Carrier and it is distributed in the user The active connection of optical gigabit ethernet switch where the distribution of access network is started and access terminal connection equipment is possible. By the BoD from the AON it compares the buffer size which changes, and it analyzes. Also the Time delay of bit compares with the throughput of server The limit of amount of time is decided. Consequently it will be able to realize the dynamic use protocol and an efficient algorithm of the network.

• Journal of Communications and Networks
• /
• v.14 no.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)
• /
• v.11 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11B
• /
• pp.784-791
• /
• 2005

To provide VoD Service on the Internet VoD server is required to have a large amount of system resource and network bandwidth. Therefore, overlay Multicast schemes are considered as suitable alternatives but they also have some drawbacks to support on-demand media services. In this paper, we propose an overlay multicast based on-demand media service scheme which could exploit server's system resource and its network bandwidth efficiently. Proposed scheme uses shared buffer of clients involving the relay of traffic and Patching while it gives no restrictions to this scheme compared with unicast. Our simulation results show that proposed scheme can support more user than unicast and improve the network performance at the same time.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.487-494
• /
• 2009

VOD(Video On Demand) that provides streaming service according to the user's requirement in real time, consists of the video streaming server and the client system. Since it is very hard to apply the traditional server-client model that a server communicates with many clients through 1:1 connection to VOD system because it requires very high network bandwidth, many researches have been done to address this problem. Batching technique is one of VOD system based on Multicast that requires very small network bandwidth. However, the batching based VOD system has a limitation that it is very hard to provide VCR(Video Cassette Recorder) ability. In this paper, we propose a technique that reduces the required network bandwidth to provide VCR function by using the characteristic of MPEG, one of international video compression standard. In the proposed technique, a new video stream for VCR function is constructed with I pictures that is able to be decoded independently. The new video stream for VCR function is transmitted with the video stream for normal play together in Batching manner. The performance evaluation result shows that the proposed technique not only reduces the required network bandwidth and memory usage but also decreases the CPU usages.

• ETRI Journal
• /
• v.26 no.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
• /
• v.44 no.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.