• Journal of Internet Computing and Services
• /
• v.8 no.4
• /
• pp.41-49
• /
• 2007

Ethernet passive optical network(EPON) is the next-generation technology for supporting services of high-quality at low-cost. In the EPON, all optical network units(ONUs) have to share a limited uplink channel for upstream data. In order to satisfy bandwidth demands of users on high-capacity local access networks(LANs), the optical line terminal(OLT) efficiently divides and allocates time slots of uplink channel to all ONUs. We discuss previous schemes for dynamic bandwidth allocation(DBA), such as interleaved polling with adaptive cycle time(IPACT) and sliding cycle time(SLICT). In this paper, dynamic right sizing of maximum-windows(DRSM), as a novel bandwidth allocation service, is proposed for more effective and efficient time slot allocation of the uplink channel. DRSM which is based on past information of bandwidth allocated by OLT calculates maximum available bandwidth and dynamically alters the maximum window size for the next ONU. This scheme does not only exert every effort to meet bandwidth demands of ONUs with the possible scope, it also seeks fairness of bandwidth allocation among ONUs.

• Journal of Broadcast Engineering
• /
• v.23 no.6
• /
• pp.813-823
• /
• 2018

UHD content is characterized by higher bandwidth requirements to provide seamless playback. The existing HTTP adaptive streaming scheme periodically requests video segment of lower quality than the available bandwidth in the steady state. In the steady state, the On-Off pattern is repeated due to the difference of the available bandwidth and the encoding rate of the content. And the repeated Off interval is causing the problem that can not efficiently use the available bandwidth. In the wireless environment where the delay and loss rate are higher with large bandwidth fluctuations, this problem is exacerbated because the available bandwidth is estimated inaccurately. Therefore, in this paper, we propose a segment scheduling scheme for efficient bandwidth utilization of UHD contents streaming in wireless environment. Proposed scheme is a group segment that simultaneously reqeusts multiple segments in one request message in order to reduce frequency of OFF interval. Through simulation, Our scheme improves bandwidth utilization.

• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.59-79
• /
• 2010

This paper considers bandwidth allocation and scheduling problems on Ethernet Passive Optical Networks (EPON). EPON is one of the good candidates for the optical access network. This paper formulates the bandwidth allocation problem as a nonlinear mathematical one and characterizes the optimal bandwidth allocation which maximizes weighted sum of throughput and fairness. Based upon the characterization, two heuristic algorithms are suggested with various numerical tests. The test results show that our algorithms can be used for efficient bandwidth allocation on the EPON. This paper also shows that the WSPT (Weighted Shortest Processing Time) rule is optimal for minimization the total delay time in transmitting the traffic of the given allocated bandwidth.

• 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 Communications and Networks
• /
• v.16 no.2
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1200-1207
• /
• 1996

The paper presents and analyzes two efficient burst-level bandwidth reservation protocols for multi-hop ATM Local Area Networks. With the tell-and-wait (TNW) protocol and the tell-and-go (TNG) protocol[6], a negative acknowledgmen(NACK) message representing the bandwidth starvation on a switch on the source-destnation path can be always sent by a destination. We note that the protocols waste more bandwidth as the round-trip delay increases, since the switches on the path must reserve the bandwidth until the NACK will arrive. Based on this pitfall, the proposed protocols allow and ATM node, rather than a destination node to send a NACK. This allowance can save the needless bandwidth wastage. Using the thinned load approximation method, we show the proposed protocols have good performance and practical simplicity. Thus, the proposed protocols may be candidates for the ABR service in multi-hop ATM LANs and ATM WANs.

• Proceedings of the KIEE Conference
• /
• 2008.10c
• /
• pp.199-201
• /
• 2008

In this paper, We studied optimum service model of passenger car monitoring system at limited wireless bandwidth subway and railway. High bandwidth is better if we need more services. But, high bandwidth requires more cost at tunnel of subway. More bandwidth make receive sensitivity to bad. We deduced best bandwidth of subway wireless transmission system reflecting the cost of installation and efficiency of system. Consequently, we decide efficient service model of passenger car monitoring system.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1597-1604
• /
• 2005

Recursive Patching is an efficient multicast technique for large-scale video on demand systems and recursively shares existing video streams with asynchronous clients. When Recursive Patching initiates a transition stream, it always makes a transition stream have additional data for the worst future request. In order to share a VOD server's limited network bandwidth efficiently, this paper proposes Practical Patching that removes the unnecessary data included in the transition stream. The proposed Practical Patching dynamically expands ongoing transition streams when a new request actually arrives at the server. As a result, the transition streams never have unnecessary data. Simulation result confirmed that the proposed technique is better than Recursive Patching in terms of service latency and defection rate.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.375-378
• /
• 2009

The Spectrum Sensing Technology is the core technology of the Cognitive Radio (CR) System that is one of the future wireless communication technologies. This is the technology that temporarily allocates the frequency bandwidth by scanning surrounding wireless environments to keep licensed terminals and search the unused frequency bandwidth. In this paper, we proposed the efficient Spectrum Sensing Method using the Short Time Fourier Transform (STFT). The Cosine and DVB-H signal with the 6MHz bandwidth is used as the Input Signal. And we confirm the Spectrum Sensing result using Modified Periodogram Method, Welch's Method for compared with Short Time Fourier Transform Algorithm.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.89-103
• /
• 1995

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.