Call Admission and Redirection in IP Telephony A Performance Study Matthew Caesar, Dipak Ghosal, Randy Katz {mccaesar,

Slides:



Advertisements
Similar presentations
The leader in session border control for trusted, first class interactive communications.
Advertisements

APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.
Policy-based Congestion Management for an SMS Gateway Alberto Gonzalez (KTH) Roberto Cosenza (Infoflex) Rolf Stadler (KTH) June 8, 2004, Policy Workshop.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Architectures for Congestion-Sensitive Pricing of Network Services Thesis Defense by Murat Yuksel CS Department, RPI July 3 rd, 2002.
Bayesian Piggyback Control for Improving Real-Time Communication Quality Wei-Cheng Xiao 1 and Kuan-Ta Chen Institute of Information Science, Academia Sinica.
LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM BY ANILA JAGANNATHAM ELENA HARRIS.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
1 Routing Techniques in Wireless Sensor networks: A Survey.
Cell Design to Maximize Capacity in CDMA Networks Robert Akl, D.Sc.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Resource pricing and the evolution of congestion control By R. J. Gibbens and F. P. Kelly.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
1 Resource Management in IP Telephony Networks Matthew Caesar, Dipak Ghosal, Randy H. Katz {mccaesar,
Lecture 9. Unconstrained Optimization Need to maximize a function f(x), where x is a scalar or a vector x = (x 1, x 2 ) f(x) = -x x 2 2 f(x) = -(x-a)
Comparing flow-oblivious and flow-aware adaptive routing Sara Oueslati and Jim Roberts France Telecom R&D CISS 2006 Princeton March 2006.
1 A General Auction-Based Architecture for Resource Allocation Weidong Cui, Matthew C. Caesar, and Randy H. Katz EECS, UC Berkeley {wdc, mccaesar,
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Configurable restoration in overlay networks Matthew Caesar, Takashi Suzuki.
Traffic Matrix Estimation: Existing Techniques and New Directions A. Medina (Sprint Labs, Boston University), N. Taft (Sprint Labs), K. Salamatian (University.
Detecting SYN-Flooding Attacks Aaron Beach CS 395 Network Secu rity Spring 2004.
A Study of VoIP Gateway Selection Techniques Matthew Caesar, Dipak Ghosal, Randy Katz {mccaesar,
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Dynamic routing – QoS routing Load sensitive routing QoS routing.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
RRAPID: Real-time Recovery based on Active Probing, Introspection, and Decentralization Takashi Suzuki Matthew Caesar.
Using Prices to Allocate Resources at Access Points Jimmy Shih, Randy Katz, Anthony Joseph One Administrative Domain Access Point A Access Point B Network.
Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He
A Study on Quality of Service Issues in Internet Telephony  IP Telephony – Applications and Services  Advantages and benefits of Voice over IP  Technical.
On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
1 Latency Equalization: A Programmable Routing Service Primitive Minlan Yu Joint work with Marina Thottan, Li Li at Bell Labs.
Analyze Assure Accelerate Standard IP Network Model for Comparing Voice Quality of IP Telephony Devices Dolby VoIP? How close are we to better than PSTN.
Internet Infrastructure and Pricing. Internet Pipelines Technology of the internet enables ecommerce –Issues of congestion and peak-load pricing –Convergence.
Server Load Balancing. Introduction Why is load balancing of servers needed? If there is only one web server responding to all the incoming HTTP requests.
Cost-Performance Tradeoffs in MPLS and IP Routing Selma Yilmaz Ibrahim Matta Boston University.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
Services Composition North Team Pete Perlegos Matthew Caesar Sridhar Machiraju Yitao Duan.
1 Mobility Aware Server Selection for Mobile Streaming Multimedia CDN Muhammad Mukarram Bin Tariq, Ravi Jain, Toshiro Kawahara {tariq, jain,
CS540/TE630 Computer Network Architecture Spring 2009 Tu/Th 10:30am-Noon Sue Moon.
1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.
1 EnviroStore: A Cooperative Storage System for Disconnected Operation in Sensor Networks Liqian Luo, Chengdu Huang, Tarek Abdelzaher John Stankovic INFOCOM.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
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.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
CSE5803 Advanced Internet Protocols and Applications (14) Introduction Developed in recent years, for low cost phone calls (long distance in particular).
Algorithms for Resource Allocation in HetNet Jianwei Liu Clemson University.
Quality of Service for Real-Time Network Management Debbie Greenstreet Product Management Director Texas Instruments.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Draft-deoliveira-diff-te-preemption-02.txt J. C. de Oliveira, JP Vasseur, L. Chen, C. Scoglio Updates: –Co-author: JP Vasseur –New preemption criterion.
Presenter: Kuei-Yu Hsu Advisor: Dr. Kai-Wei Ke 2013/9/30 Performance analysis of video streaming on different hybrid CDN & P2P infrastructure.
A Hierarchical Edge Cloud Architecture for Mobile Computing IEEE INFOCOM 2016 Liang Tong, Yong Li and Wei Gao University of Tennessee – Knoxville 1.
Web Servers load balancing with adjusted health-check time slot.
William Stallings Data and Computer Communications
Routing Protocols to Maximize Battery Efficiency
CONNECTING TO THE INTERNET
Energy Conservation in Content Distribution Networks
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
ISP and Egress Path Selection for Multihomed Networks
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
MENTER: Dynamic Traffic Engineering for MPLS Networks
Chapter-5 Traffic Engineering.
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Towards Predictable Datacenter Networks
Presentation transcript:

Call Admission and Redirection in IP Telephony A Performance Study Matthew Caesar, Dipak Ghosal, Randy Katz {mccaesar,

Approach Goal: High quality, economically efficient telephony over the Internet. Low blocking probability Provide preferential treatment, high QoS Questions: How to perform call admission control? How best to route calls through converged network? Solutions: Congestion sensitive call admission control ITG selection Techniques Awareness of ITG congestion Path quality between important points in network

System Architecture ITG LS Example Call Setup Example Advertisement Gateway (ITG) IP Terminal Location Server (LS) Internet Admin. Domain (AD) Example Call Session ITG LS

Method Scope of study 1. All calls are net-to- phone 2. ADs cooperate to provide service. 3. Use IETF’s TRIP architecture to support interoperability. 4. Disregard degradation in access network. 5. Prices determined at start of call. 6. ITGs offer equal PSTN reachability. Experimental Setup Modified ns-2 Run for 1.5 simulated hrs. User Model  Bid uniformly distributed Self-similar cross-traffic Metrics:  Blocking Probability  Average call QoS Used Mean Opinion Score (MOS) based on RTP loss rate  Economic efficiency Ratio of price paid to QoS achieved

Congestion-sensitive Call Admission Control Goal: prevent system overload and generate revenue Price of call function of number of voice ports in use rises when highly utilized Used M/M/m/m (m-server loss system) to calculate price responsive server loss system discouraged arrivals Found price-congestion function that maximized revenue with respect to  m-1 m      m-1   mm

Congestion Pricing Analysis Analysis Exponential function generates most revenue Stepwise linear function performs almost as well Maximum system price charged early Simulation  Flat pricing unnecessarily blocks many callers  Congestion pricing changes system price dynamically with load

Redirection Problem : finding the “best” ITG Approach : tradeoffs between quality and load Method : LS maintains Average measured path quality Number voice ports in use Redirection Schemes Random Redirection (RR) (baseline) QoS Sensitive Redirection (QR)  Use RTCP RRs to monitor path congestion  Route over best paths to maximize call QoS Congestion Sensitive Redirection (CR)  Use TRIP advertisements to estimate ITG utilization  Route to least utilized ITG to improve load balance

Hybrid Redirection (CQR) Choosing nearby ITG improves call quality, but can unbalance load. Algorithm: Compute Rdm =  *M i +(1-  )*Q i  M i is utilization, Q i is loss rate Select randomly from k ITGs with lowest Rdm Tradeoffs: Use  to trade off call quality and load balance Use k to vary flash crowd protection Price Sensitive CQR (PCQR) Decrease  for higher bids

Call Redirection Congestion sensitivity decreases blocking probability Small k  few blocked calls Congestion Sensitive Redirection (CR) improves balance over Random Redirection (RR)  QoS sensitivity minimizes effects of cross traffic  Small amount of sensitivity vastly improves call quality 

Summary Admission Control Schemes: Congestion sensitive pricing decreases unnecessary call blocking, increases revenue, and improves economic efficiency Derived exponential price-congestion function that maximizes revenue Redirection Schemes: Hybrid scheme achieves “best of both worlds”  Low call blocking and high call QoS Price sensitivity improves economic efficiency Future Work: Improve user model Study flash-crowd effects ITG Placement