Differentiated Bandwidth Allocation Research Articles

Dynamic bandwidth allocation algorithm based on MUMS two-dimensional priority queue for NG-EPON with multi-transceiver ONUs

Abstract Recently, the IEEE 802.3 Ethernet Working Group has been working to explore new solutions for the next-generation Ethernet passive optical network (NG-EPON). It’s desirable for NG-EPON to support the coexistence of multi-type users and multi-type services (MUMS) on a single access platform. Moreover, in the future, ONU may be equipped with multiple transceivers to break through bandwidth limit of a single wavelength and then achieve greater throughput per ONU. In this paper, a two-dimensional priority queue model is designed for buffer differentiation management. Then, a dynamic bandwidth allocation (DBA) algorithm including joint grant sizing and scheduling is presented to carry out differentiated bandwidth allocation among MUMS. By providing different aggregated data rates and setting scalable wavelength resource pools for different users and services, flexible ONU configurations are allowed. By using time-order filling (ToF) and wavelength-order filling (WoF) in combination to realize grant scheduling, the flexibility of multi-transceiver ONUs gets further exploited. Finally, the simulation demonstrates the effectiveness of the proposed algorithm. Not only each type of service/user can get reasonable network access capacity that matches its bandwidth requirements, but the overall network performance also gets improved compared with other DBAs for NG-EPON.

Performance Analysis of Thunder Crystal: A Crowdsourcing-Based Video Distribution Platform

Delivering high-definition (HD) videos to a large number of Internet users is a challenging research problem due to its heavy bandwidth consumption and inelastic quality-of-service (QoS) requirement. Different from the traditional content delivery networks and overlay peer-to-peer networks, crowdsourcing-based platforms, e.g., Thunder Crystal, deliver HD videos by renting agents’ bandwidth and storage resources. Cash will be rewarded to agents based on agents’ upload traffic. Online video providers, i.e., Tencent Video and YouKu, pay Thunder Crystal for its video distribution service. Therefore, a critical problem for Thunder Crystal is to evaluate the performance it can achieve, which determines Thunder Crystal’s competitiveness and its bargaining power with online video providers. Although previously studied proportional video replication and random request scheduling strategy are implemented by Thunder Crystal, the system performance cannot be evaluated by simply using existing models, because of its novel business model. To address this problem, this paper proposes a theoretical framework that can analyze the performance for synchronized streaming, video-on-demand (VoD) streaming, and video downloading, which are all supported by Thunder Crystal. A differentiated bandwidth allocation is designed to boost Thunder Crystal’s streaming performance by assigning downloading users more fluctuating bandwidth, which only slightly degrades downloading performance. Finally, simulation is conducted to validate the accuracy of our theoretical results.

CHOKeR: A Novel AQM Algorithm With Proportional Bandwidth Allocation and TCP Protection

Although differentiated services (DiffServ) networks have been well discussed in the past several years, a conventional Active Queue Management (AQM) algorithm still cannot provide low-complexity and cost-effective differentiated bandwidth allocation in DiffServ. In this paper, a novel AQM scheme called CHOKeR is designed to protect TCP flows effectively. We adopt a method from CHOKeW to draw multiple packets randomly from the output buffer. CHOKeR enhances the drawing factor by using a multistep increase and single-step decrease (MISD) mechanism. In order to explain the features of CHOKeR, an analytical model is used, followed by extensive simulations to evaluate the performance of CHOKeR. The analytical model and simulation results demonstrate that CHOKeR achieves proportional bandwidth allocation between different priority levels, fairness guarantee among equal priority flows, and protection of TCP against high-speed unresponsive flows when network congestion occurs.

Foreword to Special Issue

Parallel and distributed computing has been under many years of development, having played a central role in shaping different research and application trends such as grid computing, cloud computing, green computing, etc. The broad applications of parallel and distributed computing have also made the relevant research field interdisciplinary, cross boundaries among architectures, communications, computing, algorithms and programming. The objective of this special issue is to address some recent developments in this interdisciplinary area. The special issue is based on the presentations made at the 13th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2012) held in Beijing, 14–16 December 2012. Fatima Furqan and Doan B. Hoang in their paper “Wireless Fair Intelligent Congestion Control — A Qos Performance Evaluation” propose a congestion control scheme in WiMAX Networks, by scheduling the traffic and ensuring the output buffer of base station operates around a target operating point without violating the QoS requirement of connections. The paper evaluates the performance of the proposed scheme in terms of throughput, delay and jitter for different classes of services under various parameter settings. A detailed simulation study on various settings of parameters is also carried out in NS-2. Yangyang Li, Hongbo Wang, Jiankang Dong, Junbo Li and Shiduan Cheng in their paper “Differentiated Bandwidth Guarantees for Cloud Data Centers” propose a differentiated bandwidth allocation scheme for data center networks, to guarantee network performance of applications and provide fine-grained service differentiation. The problem is formulated as a multi-objective optimization problem and solved by a heuristic algorithm. Xu Liang, Youli Qu and Guixiang Ma in their paper “Research on Contrastive Viewpoint Summarization for Opinionated Texts” propose an approach for summarizing multi-topic contrastive viewpoints in opinionated text processing. They model the opinionated texts with Topic-Aspect Model and get the topic and aspect attribute of each sentence, and use some ranking methods to evaluate the centrality of each sentence, based on which the summary is finally generated. We sincerely thank all the authors and reviewers for their contributions to this special issue. Special thanks are given to Prof. Francis Lau, the EIC of JOIN, for

Differentiated Bandwidth Allocation with TCP Protection in Core Routers

Differentiated Services (DiffServ) networks categorize routers into edge routers and core routers. In core routers, one of the technological challenges is how to implement differentiated bandwidth allocation and TCP protection together with low complexity. We present an Active Queue Management (AQM) scheme called CHOKeW. A method is borrowed from a previous scheme, CHOKe, which draws a packet at random from the buffer, compares it with the arriving packet, and drops both if they are from the same flow. CHOKeW enhances the drawing function by adjusting the maximum number of draws based on the priority of the new arrival and the current status of network congestion. With respect to the number of flows, both the memory-requirement complexity and the per-packet-processing complexity for CHOKeW is O(1). An analytical model and multiple simulations are used to explain and evaluate CHOKeW. We show that CHOKeW is able to 1) support differentiated bandwidth allocation; 2) provide the flows in the same priority with better fairness than other conventional stateless AQM schemes such as RED and BLUE; 3) maintain high link utilization as well as short queue length; and 4) protect TCP flows by restricting the bandwidth share of high-speed unresponsive flows.

블루투스 피코넷에서의 효율적인 전력 및 자원 스케줄링

근거리 무선 개인 네트워크 시스템 즉, 블루투스의 피코넷을 위한 전력 및 차등 대역폭 할당을 고려한다. 대역폭 요구는 어플리케이션/서비스에 또는 시간에 따라서 변할 수도 있으므로, 제한된 자원을 서비스 요구를 만족하면서 다양한 서비스 클래스로 어떻게 할당할 것인가를 결정 하는 것이 중요하다. 본 논문에서는 다양한 서비스 형태의 대역폭 요구를 만족하면서 전력 절약 모드 (즉, 스니프 모드)에 의해 전력 소비를 절약하는 간단하고 효율적인 대역폭 할당 메커니즘을 제안한다. 기존의 (가중치) 라운드 로빈 폴링 방법과 제안된 메커니즘을 비교하고, 전송율, 지연시간, 전력 소비 측면에서의 성능 향상을 보인다. 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.