• Title/Summary/Keyword: Bandwidth Utilization

Search Result 368, Processing Time 0.02 seconds

Adaptive Online Load Balancing Algorithm for Multimedia Service in Cellular Networks (셀룰러 네트워크 상에서 멀티미디어 서비스 제공을 위한 효율적인 온라인 부하분산 기법에 대한 연구)

  • Kim, Sung-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12B
    • /
    • pp.811-817
    • /
    • 2005
  • Efficient bandwidth management is necessary in order to provide high quality service to users in a multimedia wireless/mobile network. In this paper, I propose an on-line load balancing algorithm with preemption. This technique is able to balance the traffic load among cells accommodating heterogeneous multimedia services while ensuring efficient bandwidth utilization. The most important features of my algorithm are its adaptability, flexibility and responsiveness to current network conditions. In addition, my online scheme to control bandwidth adaptively is a cell-oriented approach. This approach has low complexity making it practical for real cellular networks. Simulation results indicate the superior performance of my algorithm.

Protection/Restoration of PON Systems Using WDM based 2-OLT Structure (WDM 기반 2-OLT 구조를 이용한 PON 시스템 보호 및 절체)

  • Rawshan, Fahmida;Park, Youngil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1168-1173
    • /
    • 2012
  • In this paper, we propose a protection architecture of passive optical network (PON) system by using two optical line terminals (OLTs). Using this scheme, the network can sustain services to access area and restores normal operation in faulty conditions. Unlike existing systems, the proposed one increases the efficiency of the system by operating both OLTs using different wavelengths in normal condition. During protection mode, a Shared-bandwidth allocation scheme is employed to maximize the utilization efficiency. Performance analysis shows that the proposed scheme can provide reliability to Ethernet-based PON system very efficiently.

The Analysis of Random Propagating Worms using Network Bandwidth

  • Ko, Kwang-Sun;Jang, Hyun-Su;Park, Byuong-Woon;Eom, Young-Ik
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.2
    • /
    • pp.191-204
    • /
    • 2010
  • There is a well-defined propagation model, named the random constant spread (RCS) model, which explains worms that spread their clones with a random scanning strategy. This model uses the number of infected hosts in a domain as a factor in the worms' propagation. However, there are difficulties in explaining the characteristics of new Internet worms because they have several considerable new features: the denial of service by network saturation, the utilization of a faster scanning strategy, a smaller size in the worm's propagation packet, and to cause maximum damage before human-mediated responses are possible. Therefore, more effective factors are required instead of the number of infected hosts. In this paper, the network bandwidth usage rate is found to be an effective factor that explains the propagations of the new Internet worms with the random scanning strategy. The analysis and simulation results are presented using this factor. The simulation results show that the scan rate is more sensitive than the propagation packet for detecting worms' propagations.

Performance Analysis of MAC Protocols for Ethernet PON (이더넷 PON을 위한 MAC 프로토콜 성능 분석)

  • 안계현;이봉주;한경은;강동국;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.457-465
    • /
    • 2003
  • In this paper, we analyze the performances of variable MAC (Medium Access Control) protocols and present an efficient MAC protocol for Ethernet PON (Passive Optical Network). We consider three MAC protocols: static TDMA, dynamic TDMA, and Interleaved polling. Static TDMA assigns an equal amount of bandwidth to all ONUs regardless of the request information but Dynamic TDMA dynamically allocates the bandwidth to each ONU considering its request. Interleaved Polling operates a cycle with variable time period and a polling method for informing a uplink transmission chance to each ONU. This paper theoretically analyzes the available bandwidth for each of three protocols. We also implement the simulation models for them by using OPNET and evaluates the performances under various bursty traffic environments. The results are compared and analyzed in terms of channel utilization and queueing delay.

Cyclic Polling-Based Dynamic Bandwidth Allocation for Differentiated Classes of Service in Ethernet Passive Optical Networks (EPON망에서 차등 CoS 제공을 위한 주기적 폴링 기반의 동적 대역 할당 방법)

  • 최수일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.7B
    • /
    • pp.620-627
    • /
    • 2003
  • Ethernet passive optical networks (EPONs) are an emerging access network technology that provide a low-cost method of deploying optical access lines between a carrier's central office and customer sites. Dynamic bandwidth allocation (DBA) provides statistical multiplexing between the optical network units for efficient upstream channel utilization. To support dynamic bandwidth distribution, 1 propose an cyclic polling-based DBA algorithm for differentiated classes of service in EPONs. And, I show that an interleaved polling scheme severely decreases downstream channel capacity for user traffics when the upstream network load is low. To obtain realistic simulation results, I used synthetic traffic that exhibits the properties of self-similarity and long-range dependence I then analyzed the network performance under various loads, specifically focusing on packet delays for different classes of traffic.

TCP Delayed Window Update Mechanism for Fighting the Bufferbloat

  • Wang, Min;Yuan, Lingyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4977-4996
    • /
    • 2016
  • The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. Researchers have made three types of suggestions to solve the bufferbloat problem. One is End to End (E2E) congestion control, second is deployment of Active Queue Management (AQM) techniques and third is the combination of above two. However, these solutions either seem impractical or could not obtain good bandwidth utilization. In this paper, we propose a Transmission Control Protocol(TCP)delayed window update mechanism which uses a congestion detection approach to predict the congestion level of networks. When detecting the network congestion is coming, a delayed window update control strategy is adopted to maintain good protocol performance. If the network is non-congested, the mechanism stops work and congestion window is updated based on the original protocol. The simulation experiments are conducted on both high bandwidth and long delay scenario and low bandwidth and short delay scenario. Experiment results show that TCP delayed window update mechanism can effectively improve the performance of the original protocol, decreasing packet losses and queuing delay while guaranteeing transmission efficiency of the whole network. In addition, it can perform good fairness and TCP friendliness.

Selection of a Competent Wireless Access Point for High Wireless Bandwidth

  • Park, Ji-Yeon;Hwang, Ki-Tae
    • Journal of Information Processing Systems
    • /
    • v.2 no.3 s.4
    • /
    • pp.159-162
    • /
    • 2006
  • Wireless LANs are becoming more widespread because of the rapid advance of wireless technologies and mobile computers. In this paper, we present the design and implementation of a system to help mobile users to select the most competent AP. By monitoring the network traffic of APs within the local LAN in real time, this system offers the mobile user the network utilizations, locations, and signal strengths of APs online. Based on the information, the user can select a competent AP with a high wireless bandwidth. Finally, we verified the accuracy of monitoring and calculating with regard to the utilizations of APs through real experiments.

Token with Timer Algorithm for Guaranteeing Periodic Communication Services in Timed Token Protocol Networks

  • Yeol, Choo-Young;Kim, Cheeha
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.57.2-57
    • /
    • 2001
  • Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an approach to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time can be used by other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This approach can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.

  • PDF

Mobility Influences on the Capacity of Wireless Cellular Networks

  • Zhang, Yide;Li, Lemin;Li, Bo
    • ETRI Journal
    • /
    • v.28 no.6
    • /
    • pp.799-802
    • /
    • 2006
  • Capacity has always been a major concern in wireless networks. This letter studies the impact of mobility on the overall system capacity in wireless cellular networks. In this letter, we present a simple system model which we developed to capture the inherent relationships among system capacity, new call blocking probability, handoff dropping probability, call terminating probability, and bandwidth utilization rate. We investigate the complex relationship between mobility and capacity-related parameters. Through simulation, we demonstrate that mobility has a significant impact on capacity and is reversely proportional to the bandwidth reserved for handoff traffic.

  • PDF

Characterization of Adaptive Modulators in Fixed Wireless ATM Networks

  • Mohammadi, Abbas;Kumar, Surinder
    • Journal of Communications and Networks
    • /
    • v.6 no.2
    • /
    • pp.123-132
    • /
    • 2004
  • The various challenges to realize a fixed wireless ATM network are discussed and some solutions for these challenges are presented. In this paper, the capacity allocation in wireless ATM, the wireless link impact on ATM traffic, and the optimum utilization of the wireless network resonrces for a line of sight (LOS) winless ATM link are studied. An adaptive MQAM modulator is introduced to provide a suitable solution to these issues. The modulator level is adjusted using a unique QoS metric in a wireless network. The metric, termed modified effective bandwidth, takes into account the bandwidth demand, QoS requirements, and outage conditions of the wireless ATM link. A performance study using VBR MPEG-l video traffic in a fixed wireless channel (Ricean channel) demonstrates the advantages of the proposed system.