1 Resource Management in IP Telephony Networks Matthew Caesar, Dipak Ghosal, Randy H. Katz {mccaesar,

Slides:



Advertisements
Similar presentations
APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.
Advertisements

Policy-based Congestion Management for an SMS Gateway Alberto Gonzalez (KTH) Roberto Cosenza (Infoflex) Rolf Stadler (KTH) June 8, 2004, Policy Workshop.
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.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
Optimizing Buffer Management for Reliable Multicast Zhen Xiao AT&T Labs – Research Joint work with Ken Birman and Robbert van Renesse.
A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.
Sogang University ICC Lab Using Game Theory to Analyze Wireless Ad Hoc networks.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
A Case for Relative Differentiated Services and the Proportional Differentiation Model Constantinos Dovrolis Parameswaran Ramanathan University of Wisconsin-Madison.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Comparing flow-oblivious and flow-aware adaptive routing Sara Oueslati and Jim Roberts France Telecom R&D CISS 2006 Princeton March 2006.
Service Differentiated Peer Selection An Incentive Mechanism for Peer-to-Peer Media Streaming Ahsan Habib, Member, IEEE, and John Chuang, Member, IEEE.
1 A General Auction-Based Architecture for Resource Allocation Weidong Cui, Matthew C. Caesar, and Randy H. Katz EECS, UC Berkeley {wdc, mccaesar,
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.
Call Admission and Redirection in IP Telephony A Performance Study Matthew Caesar, Dipak Ghosal, Randy Katz {mccaesar,
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
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,
Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,
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.
Performance and Robustness Testing of Explicit-Rate ABR Flow Control Schemes Milan Zoranovic Carey Williamson October 26, 1999.
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
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 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.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
Network Planning & Capacity Management Frank Yeong-Sung Lin ( 林永松 ) Department of Information Management National Taiwan University Taipei, Taiwan, R.O.C.
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.
1 Mobility Aware Server Selection for Mobile Streaming Multimedia CDN Muhammad Mukarram Bin Tariq, Ravi Jain, Toshiro Kawahara {tariq, jain,
Performance over Different Protocols. Introduction Overview of VoIP In my words, A system to convert analogue signals to digital so that telephone calls.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.
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.
6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.
Analyze Assure Accelerate Network Model for Evaluating Multimedia Transmission Performance Over Internet Protocol PN Will become TIA/EIA-921 Jack.
CSE5803 Advanced Internet Protocols and Applications (14) Introduction Developed in recent years, for low cost phone calls (long distance in particular).
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Quality of Service for Real-Time Network Management Debbie Greenstreet Product Management Director Texas Instruments.
MBD Techniques for Internet Delay Diagnosis Roni Stern and Meir Kalech Information Systems Engineering, Ben-Gurion University, Israel 7. Future Work Diagnosing.
A Comparison of RaDiO and CoDiO over IEEE WLANs May 25 th Jeonghun Noh Deepesh Jain A Comparison of RaDiO and CoDiO over IEEE WLANs.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Analyze Assure Accelerate Network Model for Evaluating Multimedia Transmission Performance Over Internet Protocol PN Will become TIA/EIA-921 Jack.
1 Scalability and Accuracy in a Large-Scale Network Emulator Nov. 12, 2003 Byung-Gon Chun.
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.
Routing Protocols to Maximize Battery Efficiency
Architecture and Algorithms for an IEEE 802
A Study of Group-Tree Matching in Large Scale Group Communications
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
MENTER: Dynamic Traffic Engineering for MPLS Networks
   Storage Space Allocation at Marine Container Terminals Using Ant-based Control by Omor Sharif and Nathan Huynh Session 677: Innovations in intermodal.
Network Planning & Capacity Management
Chapter-5 Traffic Engineering.
Network Planning & Capacity Management
Network Planning & Capacity Management
Towards Predictable Datacenter Networks
Presentation transcript:

1 Resource Management in IP Telephony Networks Matthew Caesar, Dipak Ghosal, Randy H. Katz {mccaesar,

2 Motivation What is IP Telephony? Packetized voice over IP PSTN access through Internet Telephony Gateway (ITG) Benefits: Improved network utilization Next generation services (POTS  PANS) Growth: Revenues $1.7 billion in 2001, 6% of international traffic was over IP, growing [Frost 2002] [Telegeography 2002] Standardized, deployed protocols (TRIP, SIP, H.323)  Requires scalable architecture to limit congestion.

3 Goals 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?

4 Approach Mechanisms Congestion sensitive call admission control ITG selection Techniques Awareness of ITG congestion Path quality between important points in network Distance ITG Utilization * * ** * **

5 Overview IP Telephony Networks Pricing-based Admission Control Redirection Techniques Experimental Design Results Future Work

6 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

7 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.

8 Pricing PSTN distance pricing time of day pricing IP Telephony richer user interface allows for more dynamic pricing schemes Baseline: Flat-rate Admission Control (FAC)

9 Congestion Sensitive Call Admission Control (CAC) Goal: prevent system overload and generate revenue Price of call function of number of voice ports in use rises when highly utilized More dynamic than PSTN

10 Price-Congestion Function Used M/M/m/m (m- server loss system) responsive server loss system discouraged arrivals Found price-congestion function that maximized revenue with respect to  m-1 m      m-1   mm

11 Congestion Pricing Analysis Exponential function generates most revenue Stepwise linear function almost as good Maximum system price charged early Approximation to function minimizes price fluctuations

12 Redirection Problem: finding the “best” ITG Approach: tradeoffs between quality and load Method: LS maintains Average measured path quality Number voice ports in use Algorithms: Random Redirection (RR) (baseline) QoS Sensitive Redirection (QR) Congestion Sensitive Redirection (CR) Hybrid Scheme (CQR)

13 Redirection Schemes QoS Sensitive Redirection (QR) Different paths provide different service Technique: Use RTCP RRs to monitor path congestion Route over best paths Congestion Sensitive Redirection (CR) Unbalanced load causes call blocks Technique: Use TRIP advertisements to estimate ITG utilization Route to least utilized ITG

14 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

15 Overview IP Telephony Networks Pricing-based Admission Control Redirection Techniques Experimental Design Results Future Work

16 Experimental Method Modified ns-2 Ran for 1.5 simulated hours Eliminated first half-hour User Model Bid uniformly distributed Voice traffic on-off Markov process Self-similar cross-traffic Data points stable across several time scales

17 Evaluation: Metrics Blocking Probability Average call QoS Used Mean Opinion Score (MOS) based on RTP loss rate Economic efficiency Ratio of service tier to QoS achieved

18 Admission Control: Blocking Probability Flat pricing unnecessarily blocks many callers Congestion pricing changes system price dynamically with load

19  Redirection: Blocking Probability Congestion sensitivity decreases blocking probability Small k  few blocked calls Congestion Sensitive Redirection (CR) improves balance over Random Redirection (RR)

20 Redirection: Background Traffic Effects  QoS sensitivity minimizes effects of cross traffic  Small amount of sensitivity vastly improves call quality

21 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” Price sensitivity improves economic efficiency

22 Future Work Realistic workload Improve user model Develop price-congestion function for real users Study flash-crowd effects ITG Placement Competitive Network

23 Resource Management in IP Telephony Networks Matthew Caesar, Dipak Ghosal, Randy H. Katz {mccaesar,