Bandwidth Reallocation for Bandwidth Asymmetry Wireless Networks Based on Distributed Multiservice Admission Control Robert Schafrik Lakshman Krishnamurthy.

Slides:



Advertisements
Similar presentations
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Advertisements

1 Mobility-Based Predictive Call Admission Control and Bandwidth Reservation in Wireless Cellular Networks Fei Yu and Victor C.M. Leung INFOCOM 2001.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
1 Adaptive Bandwidth Allocation in TDD-CDMA Systems Derek J Corbett & Prof. David Everitt The University of Sydney.
Hadi Goudarzi and Massoud Pedram
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
May 4, Mobile Computing COE 446 Network Planning Tarek Sheltami KFUPM CCSE COE Principles of Wireless.
Cell Design to Maximize Capacity in CDMA Networks Robert Akl, D.Sc.
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
Wenye Wang Xinbing Wang Arne Nilsson Department of Electrical and Computer Engineering, NC State University March 2005 A New Admission Control Scheme under.
Dynamic Guard Bandwidth Scheme for Wireless Broadband Networks IEEE INFOCOM 2001.
1 “Multiplexing Live Video Streams & Voice with Data over a High Capacity Packet Switched Wireless Network” Spyros Psychis, Polychronis Koutsakis and Michael.
1 Adaptive resource management with dynamic reallocation for layered multimedia on wireless mobile communication net work Date : 2005/06/07 Student : Jia-Hao.
Wireless & Mobile Networking: Channel Allocation
CAC for Multimedia Services in Mobile Cellular Networks : A Markov Decision Approach Speaker : Xu Jia-Hao Advisor : Ke Kai-Wei Date : 2004 / 11 / 18.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Channel Allocation for the GPRS Design and Performance Study Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science and Information Engineering.
1 Token Bucket Based CAC and Packet Scheduling for IEEE Broadband Wireless Access Networks Chi-Hung Chiang
A New Broadcasting Technique for An Adaptive Hybrid Data Delivery in Wireless Mobile Network Environment JungHwan Oh, Kien A. Hua, and Kiran Prabhakara.
Simultaneous Rate and Power Control in Multirate Multimedia CDMA Systems By: Sunil Kandukuri and Stephen Boyd.
Traffic modeling and Prediction ----Linear Models
Lecture 11: Cellular Networks
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
College of Engineering Resource Management in Wireless Networks Anurag Arepally Major Adviser : Dr. Robert Akl Department of Computer Science and Engineering.
MAXIMIZING SPECTRUM UTILIZATION OF COGNITIVE RADIO NETWORKS USING CHANNEL ALLOCATION AND POWER CONTROL Anh Tuan Hoang and Ying-Chang Liang Vehicular Technology.
Fair Real-time Traffic Scheduling over Wireless Local Area Networks Insik Shin Joint work with M. Adamou, S. Khanna, I. Lee, and S. Zhou Dept. of Computer.
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
Global versus Local Call Admission Control in CDMA Cellular Networks Robert Akl, D.Sc. Asad Parvez University of North Texas.
On QoS Guarantees with Reward Optimization for Servicing Multiple Priority Class in Wireless Networks YaoChing Peng Eunyoung Chang.
Performance evaluation of adaptive sub-carrier allocation scheme for OFDMA Thesis presentation16th Jan 2007 Author:Li Xiao Supervisor: Professor Riku Jäntti.
Lecture 5: Cellular networks Anders Västberg Slides are a selection from the slides from chapter 10 from:
1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.
Managing Handoff. For operations and management to detect and isolating Handoff being particularly challenging, therefore it is important to understand.
1 Call Admission Control for Multimedia Services in Mobile Cellular Networks : A Markov Decision Approach Jihyuk Choi; Taekyoung Kwon; Yanghee Choi; Naghshineh,
Elastic Threshold-based Admission Control for QoS Satisfaction in Wireless Networks with Reward Optimization for Multiple Priority Classes April 6, 2010.
Utilizing Call Admission Control for Pricing Optimization of Multiple Service Classes in Wireless Cellular Networks Authors : Okan Yilmaz, Ing-Ray Chen.
Fair Class-Based Downlink Scheduling with Revenue Considerations in Next Generation Broadband wireless Access Systems Bader Al-Manthari, Member, IEEE,
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
Huirong Fu and Edward W. Knightly Rice Networks Group Aggregation and Scalable QoS: A Performance Study.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Advanced Spectrum Management in Multicell OFDMA Networks enabling Cognitive Radio Usage F. Bernardo, J. Pérez-Romero, O. Sallent, R. Agustí Radio Communications.
Competitive Queue Policies for Differentiated Services Seminar in Packet Networks1 Competitive Queue Policies for Differentiated Services William.
Utility Maximization for Delay Constrained QoS in Wireless I-Hong Hou P.R. Kumar University of Illinois, Urbana-Champaign 1 /23.
Cell Zooming for Cost-Efficient Green Cellular Networks
Overload Prediction Based on Delay in Wireless OFDMA Systems E. O. Lucena, F. R. M. Lima, W. C. Freitas Jr and F. R. P. Cavalcanti Federal University of.
1 Iterative Integer Programming Formulation for Robust Resource Allocation in Dynamic Real-Time Systems Sethavidh Gertphol and Viktor K. Prasanna University.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
Effects of Call Arrival Rate and Mobility on Network Throughput in Multi-Cell CDMA Manju Hegde, Robert Akl, Paul Min Washington University St. Louis,
An Optimal Distributed Call Admission control for Adaptive Multimedia in Wireless/Mobile Networks Reporter: 電機所 鄭志川.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
1 An Analytical Model for the Dimensioning of a GPRS/EDGE Network with a Capacity Constraint on a Group of Cells r , r , r Nogueira,
Bluetooth: Quality of Service Reference: “QoS based scheduling for incorporating variable rate coded voice in Bluetooth”; Chawla, S.; Saran, H.; Singh,
1 Guard Channel CAC Algorithm For High Altitude Platform Networks Dung D. LUONG TRAN Minh Phuong Anh Tien V. Do.
WIRELESS COMMUNICATION THE CELLULAR CONCEPT- SYSTEM DESIGN FUNDAMENTALS LECTURE 4 1 Tanvir Ahmad Niazi Air University, Islamabad.
Dynamic Bandwidth Reservation in Cellular Networks Using Road Topology Based Mobility Predictions InfoCom 2004 Speaker : Bo-Chun Wang
Announcements Deadline extensions –HW 1 dues May 17 (next Wed) –Progress report due May 24 HW 1 clarifications: –On problem 3 users can lower their power.
Dynamic Bandwidth Quasi- reservation Scheme for Real- time Services in IEEE e Networks Yin Ge,and Geng-Sheng Kuo IEEE Wireless Communications and.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
QoS Guaranteed Provisioning over GPRS Wireless Mobile Links Benjamin ESHUN MSc CCN INT France.
Dynamic Resource Allocation for Shared Data Centers Using Online Measurements By- Abhishek Chandra, Weibo Gong and Prashant Shenoy.
Joint Call Admission Control and Adaptive Bandwidth Management Scheme to Enhance QoS in Heterogeneous Wireless Networks Olabisi E. Falowo and H. Anthony.
Chapter 3: Wireless WANs and MANs
Howard Huang, Sivarama Venkatesan, and Harish Viswanathan
Scheduling Algorithms in Broad-Band Wireless Networks
Channel Allocation Problem/Multiple Access Protocols Group 3
Channel Allocation Problem/Multiple Access Protocols Group 3
Air University, Islamabad
Resource Allocation Call Admission Control
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Infocom 2004 Speaker : Bo-Chun Wang
Presentation transcript:

Bandwidth Reallocation for Bandwidth Asymmetry Wireless Networks Based on Distributed Multiservice Admission Control Robert Schafrik Lakshman Krishnamurthy

Agenda Introduction Related work on Admission control and bandwidth allocation Distributed Multiservice Admission Control – System model & DMS-AC in Two-cell system – DMS-AC in Multi-cell system Performance evaluation – Competing Systems – Static Allocations Conclusion Comments

Introduction Next generation multiservice wireless networks are expected to present distinctive traffic asymmetry between uplink and downlink. Some resources may be wasted if bandwidth is allocated symmetrically To match the asymmetric traffic load, it is necessary to allocate different bandwidth to uplink and downlink. Different call classes have different up/down ratios QoS may be different for Handoff and new call, and for each call class

Introduction (continued) If the traffic and mobility patterns are predictable, then fixed bandwidth allocation works. Bursty and variable bandwidth requirements call for new treatments of network resource management Traffic generated is time dependent It is necessary to develop a dynamic bandwidth allocation scheme that can adapt to the changing traffic conditions

Problem Statement Upload and Download communications are not always symmetric Need to determine under what conditions bandwidth needs to be reallocated Need to determine the best way to reallocation when multiple call classes and multiple cells while preserving QoS

Time Slots Some timeslots are for uplink, some are for downlink. This prevents collisions Variable time-slots for different cells always outperforms fixed time slots Reallocation of time slots affects all calls in the system, try to limit how frequently this is done

QoS Metric Call Admission Control (CAC) Critical CAC Parameters – Pn – New call blocking probability – Ph – Handoff call blocking probability MINBlock used to optimize

Distributed Multiservice Admission Control (DMS-AC) Provides a base to compare new techniques against Tries to find proper threshold – Limits new calls of certain classes – If blocking probability exceeds a bound, it reallocates – If QoS thresholds for some classes cannot be found, it reallocates

Related Work CAC schemes – CDMA (fixed, symmetric) – CDMA/TDD (fixed, asymmetric) SA – same-slot allocation (all cells have same allocation) DA – different slot allocation (cells can have different allocations, but adjacent cells may have slot interference) – Limited Fractional Guard Channel scheme – DCA Distributed Admission Control Jeon’s CAC for MSWN [7] DMS-AC scheme

Limited Fractional Guard Channel (LFGC) Minimize a linear objective function Weighted sum of handoff and new call blocking probabilities C channels C-T reserved for new and handoff When T channels are used, only handoff calls are accepted Extended to deal with multiple call classes[20]

Distributed Admission Control (DCA) Based on communication between cells to predict handoffs Only deals with one call class Knapsack problem [18] to deal with multiple call classes

Distributed Multiservice Admission Control System Model Total bandwidth allocated of a cell is fixed. Bandwidth allocated on uplink and downlink is different and also adjustable [3] [8] M classes of calls in the system The calls of particular class have the same bandwidth requirements, mobility characteristics and mean resource holding time

Distributed Multiservice Admission Control System Model (contined) Design goal of the proposed admission control scheme is: φ i < η i Φ i < ρ i η i (eta) - Highest tolerable dropping probability of class i hand-off calls. φ i (phi) – hand-off call dropping probability of class i calls Φ i (phi) – New call blocking probability of class i calls. ρ i (rho) – Highest tolerable new call blocking probability

Distributed Multiservice Admission Control System Model (contined) DMS-AC operates in distributed manner System states exchanged periodically between adjacent cells Base station of cell makes an admission decision based on the state information of the cell itself and its neighboring cells. DMS-AC uses the admission threshold of each call class based on the system states to limit the admission of new calls. Dynamic threshold scheme is used. Threshold of specific call class is recomputed and reset periodically. Control period – interval between two threshold computing process (15 – 60 minutes).

Distributed Multiservice Admission control in a Two- Cell System Fig. 1. Two-cell system. C r is the observing cell and C l is the neighbouring cell Total bandwidth in C r (C l ) is denoted by B r u + B r d (B l u + B l d ) In DMS-AC we need to define the overload states of a specific call class in the multiservice system. In multiservice networks, the set of overload states of different call classes may be different.

Distributed Multiservice Admission control in a Two- Cell System (contined) Example: – Cell has 10 downlink and 5 uplink channels – Class 1 calls require 1 uplink and 1 downlink channel – Class 2 calls require 1 uplink and 3 downlink channels – (n1, n2) denote the system states, where n1 and n2 denote the class 1 calls and class 2 calls in the system – (0,3) and (2,2) are overload states of class 2 calls. No class 2 calls are not admissible while class 1 calls are admissible. Fig. 2. An example. (a) Overload states of class 1 calls. (b) Overload states of class 2 calls

Distributed Multiservice Admission control in a Two- Cell System (contined) During a control period, the admission of class i new call in the observing cell C r should satisfy the following two conditions: 1)The admission of a new class i call in C r cannot cause the call dropping probability of class j call in C r denoted by φ r j to exceed η j 2)The admission of a new class I call in C r cannot cause the call dropping probability of call class j in the neighboring cell C l, denoted by φ l j to exceed η j The key of DMS-AC is to determine the thresholds of individual call class in each cell (i.e. we need to compute φ r j and φ l j )

Distributed Multiservice Admission control in a Two- Cell System (continued) The key of DMS-AC is to determine the thresholds of individual call class in each cell (i.e. we need to compute φ r j and φ l j ) The probability that x i class i calls out of r i calls stay in C r has a binomial distribution given by Similarly, the probability that y i class i calls handoff to C r from C l during the control period is

Distributed Multiservice Admission control in a Two- Cell System (continued) Using formulas 1 & 2, we need can find P r (n i ) P r (n i ) denote the probability that there are n i class i calls in C r during T units of time At any time system stays in feasible state, should satisfy

Distributed Multiservice Admission control in a Two- Cell System (continued)

Blocking probability of class j calls in Cr can be expressed as: Blocking probability of class j calls in Cl is expressed as:

Derivation of Admission threshold Th i 1 and Th i 2 denote the thresholds of class i calls that satisfies the first and second admission conditions The final admission threshold of class i calls in Cr, which satisfies all admission conditions, is given by

Extension to multicell system C 0 be the current observing cell C 1 to C 6 be the neighboring cell

Extension to multicell system During a control period, the admission of a class i (I Є [0, M-1]) call in C 0 should satisfy: 1. The admission of a new class i call in C 0 cannot cause the call dropping probability of call class j in C 0, φ 0 j to exceed η j 2.The admission of a new class i call in C 0 cannot the call dropping probability of call class j in the neighboring cells to exceed η j

Valid States n M q -Number of calls for class q in the system Not all of these states are good for the system, but they are possible. Matrix will not be symmetric. S (i,j) is the subset of states such that adding a call of type i will cause overload for class j Call classes Number of feasible states Constrained by Bu and Bd

Threshold-Based Admission Control Scheme Test for conditions 1,2, and 5 If you are the current call class (note: not always zero!) You are NOT the current cell Conditions

Case 1 – Cell i will Become Full for Some Call Class s i is in the set S(i,j) – adding a call type i will cause at least one other class j to become full Need to reallocate up/down channels

Admission Case 1 – Ratio of Uplink and Downlink Needs to Change Need to choose an allocation between

Admission Case 2 – Cell r Will Not be able to Accept Handoff from Cell l Cell r either doesn’t have enough room or accepting a handoff will cause a class to overload See if Cell r can reallocate to accommodate

DMS-AC Pseudocode

Comparisons Analysis using a 2-cell system 15 minute control period 100 channels 2 call classes – Real time ( 1 up, 1 down ) – Non Real Time ( 1 up, 3 down )

Jeon’s scheme Similar goal – create a scheme for reallocating in asymmetric environments Accounts for traffic load in both directions Uses Markov analysis Also only considers QoS for New and Handoff calls

Comparison with Jeon (1) New call QoS is similar, and not shown Jeon does not consider NRT QoS

Comparison with Jeon (2) Call types vary independently

Comparison with Jeon (3) Similar performance with small loads Jeon’s begins to lag with NRT calls Jeon’s breaks down when volume is high

Comparison with Static Sol’n (1) No reallocation is performed for “AC without BA” RT call arrival rates in both Cr and Cl increase from 0.07 to 0.12 simultaneously Up/down ratio is 30 up/ 70 down

Comparison with Static Sol’n (2) average NRT call arrival rates in both Cr and Cl change from to simultaneously Up/down ratio is initially 50 up/ 50 down

Comparison with Static Sol’n (3) Traffic increases for Cr, decreases for Cl

Conclusions Changing the up/down ratio for several asymmetric call classes helps maximize the resources of a Cell, and still guarantees QoS for new and handoff calls When to reallocate – Allocations for a call class nears max – Allocations of neighbor for that class nears max How to reallocate – Find min B that fills QoS requirement

Comments Experimental setup was simplistic – Perhaps more than 2 call types could be considered in a simulation – Perhaps compare the performance of more than 2 cells A call cannot itself be dynamic (aka use 1up/1down for a while then switch to 1up/2down) Does not consider revenue, but that might be achievable by adjusting admittance thresholds Performs slightly better than Jeon in some conditions

Backup Slides

Other Notes – Assume C 0 covers a conference, and becomes overloaded – C 1 - C 6 will be unable to accept any calls of any class (due to the handoff constraint) C0C0

Overview Uplink and Downlink bandwidth is asymmetric Determine when to change ratio of uplink to downlink Determine how to compute best ratio to satisfy QoS Satisfy QoS for call classes