• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.1
• /
• pp.27-33
• /
• 2012

The Ethernet Passive Optical Network (EPON) has been considered to be one of the most promising solutions for the implementation of the Fiber To The Home (FTTH) technology designed to ameliorate the "last mile" bandwidth bottleneck. In the EPON network, an efficient and fair bandwidth allocation is a very important issue, since multiple optical network units (ONUs) share a common upstream channel for packet transmission. To increase bandwidth utilization, an EPON system must provide a way to adaptively allocate the upstream bandwidth among multiple ONUs in accordance to their bandwidth demands and requirements. We present a new hybrid method that satisfies these requirements. The advantage of our method comes from the consideration of application-specific bandwidth allocation and the minimization of the idle bandwidth. Our simulation results show that our proposed method outperforms existing dynamic bandwidth allocation methods in terms of bandwidth utilization.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.526-534
• /
• 2014

Most of the multiplayer games available online are based on a client-server architecture because this architecture gives better administration control to the game providers than peer-to-peer architecture. In this architecture, the server is responsible for all the communication between the connected clients. The weakness of this architecture is its bandwidth requirement and scalability. Peer-to-peer architectures have then been proposed to solve these issues. In this paper, we propose a hybrid client-server architecture in which the game state is partially shared by the mobile terminal to achieve consistency among different players. Like a peer-to-peer architecture, this architecture uses client-side capacities to reduce bandwidth requirements for the server and improves consistency in wireless networks. Client events have different timeliness and consistency requirements according to their nature in the game world. These requirements lead to tasks with different priorities on CPU processing. In the proposed architecture, either the server or the client applies consistency mechanism according to the priority level. Simulation experiments show that the bandwidth of the server in this architecture is smaller than that of the client-server architecture. As a result, the server in the proposed architecture can accommodate more clients with enhancing the scalability.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.15-24
• /
• 2013

Provisioning of quality of service (QoS) is a key issue in any multi-media system. However, in wireless systems, supporting QoS requirements of different traffic types is a more challenging problem due to the need to simultaneously minimize two performance metrics - the probability of dropping a handover call and the probability of blocking a new call. Since QoS requirements are not as stringent for non-real-time traffic, as opposed to real-time traffic, more calls can be accommodated by releasing some bandwidth from the already admitted non-real-time traffic calls. If the released bandwidth that is used to handle handover calls is larger than the released bandwidth that is used for new calls, then the resulting probability of dropping a handover call is smaller than the probability of blocking a new call. In this paper, we propose an efficient call admission control algorithm that relies on adaptive multi-level bandwidth-allocation scheme for non-realtime calls. The scheme allows reduction of the call dropping probability, along with an increase in the bandwidth utilization. The numerical results show that the proposed scheme is capable of attaining negligible handover call dropping probability without sacrificing bandwidth utilization.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.171-176
• /
• 2006

Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high qualify service to users with different requirements in a multimedia wireless/mobile network. In this paper, we propose an on-line bandwidth reservation algorithm that adjusts bandwidth reservations adaptively based on existing network conditions. The most important contribution of our work is an adaptive algorithm that is able to resolve conflicting performance criteria - bandwidth utilization, call dropping and call blocking probabilities. Our algorithm is quite flexible, is responsive to current traffic conditions in cellular networks, and tries to strike the appropriate performance balance between contradictory requirements for QoS sensitive multimedia services.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.203-210
• /
• 2013

Majority of the wireless ad hoc routing protocols are proposed to find feasible routes without considering the network load, end-to-end link quality and bandwidth requirements of the application. Therefore, protocol may not provide sufficient quality of service (QoS) to a high speed traffic such as multimedia. In this paper, we propose a path-quality and bandwidth-estimation based routing protocol (PBBR) for the high quality multimedia stream that can meet the application's bandwidth requirements and find the best reliable route. The novelty of this protocol is to select a reliable path to respond the application's requirements based on available bandwidth at each intermediate node and end-to-end path loss ratio. Obtained results from the simulation demonstrates that our protocol can achieve sufficient performance in terms of throughput and end-to-end delay.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.555-562
• /
• 2004

We consider differentiated bandwidth allocation for a piconet in short-range wireless personal network systems : Bluetooth. Since bandwidth requirements nay vary among applications/services, and/or it may change over time, it is important to decide how to allocate limited resources to various service classes to meet their service requirements. We propose a simple and efficient bandwidth allocation mechanism which meets bandwidth requirements of various service types while saving power consumption by a Power saying mode, i.e., sniff node. We compare our proposed mechanism with a conventional (weighted) round-robin polling scheme and show that it achieves significant improvement of hroughput, delay, and power consumption.

• Journal of Industrial Technology
• /
• v.24 no.B
• /
• pp.177-186
• /
• 2004

The main bottleneck for a VOD system is bandwidth of storage or network I/O due to the high bandwidth requirements and long-lived nature of digital video. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, P2P proxy patching, for improving the typical patching technique by jointly using the proxy prefix caching scheme and the P2P proxy. In our proposed scheme, each client play a role in a proxy for multicasting a regular stream to other clients that request the same stream. Due the use of the P2P proxy and the prefix caching, the server bandwidth is required significantly less than that of the typical patching technique. In the performance study, we show that our patching scheme can reduce the server bandwidth requirements compared with the existing patching techniques.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.933-938
• /
• 2006

Different multimedia services over networks not only require different amounts of bandwidth but also have different Qualify of Service (QoS) requirements. For example, QoS guarantees for higher priority calls is an important issue in multimedia communication networks. In this paper, we develop an adaptive bandwidth management algorithm, which is able to provide QoS guarantees for higher priority calls while accommodating as many heterogeneous multimedia call connections as possible. Our scheme, based on reservation and bandwidth adaptation, manages bandwidth based on real time estimates of current network conditions. Simulation results indicate the superior performance of our scheme providing excellent trade off between contradictory requirements.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.35-38
• /
• 1999

In this paper, we propose bandwidth management scheme to efficiently guarantee the QoS of various services on ATM based IMT-2000 networks. The proposed bandwidth management scheme consists of the call admission control to reduce a handoff failure probability and the scheduling scheme to efficiently allocate a time slot based on the QoS requirements in wireless links. The simulation results show that the proposed bandwidth scheme has better performance than the previous works in terms of the handoff failure probability and packet delay time.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.760-772
• /
• 1999

The CAN is a serial communication protocol for distributed real-time control and automation systems. Data generated from field devices in the distributed control of power plant are classified into three categories: real-time event data, real-time control data, non-real-time data. These data share a CAN medium. If the traffic of the CAN protocol is not efficiently controlled, performance requirements of the power plant system could not be satisfied. This paper proposes a bandwidth allocation algorithm that can be applicable to the CAN protocol. The bandwidth allocation algorithm not only satisfies the performance requirements of the real-time systems in the power plant but also fully utilizes the bandwidth of CAN. The bandwidth allocation algorithm introduced in this paper is validated using the integrated discrete-event/continuous-time simulation model which comprises the CAN network and distributed control system of power plant.