MANAGEMENT SCIENCE doi /mnsc ec pp. ec1 ec12

Size: px
Start display at page:

Download "MANAGEMENT SCIENCE doi /mnsc ec pp. ec1 ec12"

Transcription

1 MANAGEMENT SCIENCE doi 0.87/mnsc ec pp. ec ec e-companion ONLY AVAILABLE IN ELECTRONIC FORM informs 008 INFORMS Electronic Companion Service Adoption and Pricing of Content Delivery Network (CDN) Services by Kartik Hosanagar, John Chuang, Ramayya Krishnan, and Michael D. Smith, Management Science, doi 0.87/mnsc

2 Online Appendix for Service Adoption and Pricing of Content Delivery Network (CDN) Services Kartik Hosanagar, John Chuang, Ramayya Krishnan, Michael D. Smith Appendix A We can use the conjugate pairs theorem from calculus (Currier 000) to analyze the properties of the optimal infrastructure level, I * ( λ). The theorem states that for the problem max F( x, a), the derivative x * x / a and the cross partial F xa have the same sign. The following results follow by applying the theorem: i) If the cost of infrastructure increases, I * decreases. * I U Ia = -. This implies that < 0. a As expected, if the infrastructure costs (cost of processing and bandwidth) decrease, the optimal level of investment in infrastructure increases. ii) If there are significant economies in scale in content delivery, I * increases. * I U Ib = I > 0. Thus > 0. b That is, if server or bandwidth sellers provide high volume discounts, infrastructure levels of CPs will increase. iii) If a content provider s cost of losing requests is high, I * is correspondingly higher. K ( K + ) λ ( I λ) I λ Proof: U Ic =. We know from the first order condition that ( I λ ) I λ - c λ c ( K + ) λ ( I λ) I {a - b I}- + I λ ( I λ ) K = 0. Since -{a - b I} < 0 (the rate at which infrastructure costs increase with infrastructure level I), it follows that c λ + K I λ c ( K + ) λ ( I λ) I + ( I λ ) - K + K = cu Ic > 0. Since c > 0, it follows immediately that

3 * I U Ic > 0. From the conjugate pairs theorem, > 0. c In other words, if the cost (c) of losing a request increases, the optimal infrastructure level also increases. iv) If the arrival rate of requests λ increases, I * increases. Proof: This statement follows from conjugate pairs theorem if U > 0 is true. Computing the cross partial with respect to I, λ and simplifying, K K { K( I λ)( I + λ ) Iλ( I λ )}. K K c( K + ) λ I U I λ = Thus, U 3 Iλ > 0 if and only if ( I λ ) Iλ K ( I λ)( I + λ ) Iλ( I K K λ ) > 0. This can be restated as K + K + U Iλ > 0 if and only if Kp ( K + ) p + ( K + ) p K > 0 (OA) where p = I / λ. For I >> λ, it follows that p >>. Thus ( K + ) p > K (OA) Also, for large K (queue size), we know the following is true: p > +. This can be restated as: K K + K + Kp > ( K + ) p (OA3) Adding (B) and (C) yields Kp K + + ( K + ) p > ( K + ) p + K. Combining this result with (A), it K + * I follows that U Iλ > 0. That is, > 0. λ QED. Appendix B: Numerical Results I. Numerical Results on CP s Infrastructure Sizing (Poisson Traffic) We employ numerical tests using parameter values conforming to typical bandwidth and hosting costs to determine the approximate relationship between λ and I *. The CP s optimal infrastructure is

4 determined by trading off the cost of infrastructure against the cost of lost requests. We now fix the parameters associated with these two costs. For the infrastructure cost function, C( I) I = a I a, we assume that a =3.56 and a = These values roughly correspond to current infrastructure costs. For example, under these parameter values, the cost of serving 33 requests/min is $804 per month. If we assume that the average size of the response to a request is 50 Kbytes, this implies that the cost of serving data at.55 Mbps is $804 per month. This is reasonable given the cost of a T connection (approximately $400 per month) and maintaining a workstation. Likewise, the cost of serving 6,975 requests per minute is $,04, which is also approximately the cost of a T3 connection and the associated cost of maintaining a server. Finally, the cost of serving 3,55 requests per minute is $57,08 per month, roughly equivalent to the cost of an OC3 connection. These costs are also comparable to managed hosting costs at the time of this study. We assume that the cost of a lost request, c, is $0. This is based on an assumption that 0% of visitors purchase products/services with an average purchase of $00, and a customer leaves a website if a request does not go through. Finally, we assume that the queue size, K, (for requests waiting to be processed) is 04 requests. Figure A shows the optimal infrastructure level (in requests/min) for different arrival rates ranging from 5,000 to 0,000 requests per minute. The relationship is approximately linear. To test for robustness, we repeated the numerical analysis for a variety of other settings for buffer size K and cost of lost requests c, and found that the relationship is approximately linear in all cases. For example, Figure A shows the relationship for the case where { a = 3.46; a = ; K = 56; c = * that the special case where I = λ (boundary solution) is also linear. 0}. While the plotted solutions are all interior solutions, note

5 Optimal Infrastructure Level Request Arrival Rate Optimal Infrastructure Level Request Arrival Rate Figure OA: Optimal Infrastructure Level versus Arrival Rate (Case ) Figure OA: Optimal Infrastructure Level versus Arrival Rate (Case ) Case of Multiple Servers: We relax the assumption of a single server system and numerically evaluate the CP s capacity sizing decision for a three server system. The queue size is 4, cost of lost requests is $0 and all other settings are the same as in Figures OA and OA. The optimal infrastructure level for different arrival rates is plotted in Figure OA3. The relationship continues to be approximately linear. As is intuitive, the optimal infrastructure level for each server (I * ) can now be lower than the mean arrival rate, λ, as three servers are sharing the load. Optimal Infrastructure Level Request Arrival Rate Figure OA3: Optimal Infrastructure Level Vs. Arrival Rate (with Three Servers)

6 Sensitivity to Cost Parameters: We test the impact of different cost parameters on the CP s optimal infrastructure level. Figure OA4 shows the relationship for the case where the cost of a lost request is scaled up to c=$80. All other parameters are the same as in Figure OA, i.e., a = 3.46; a = ; K 56}. In Figure OA5, { = we test the impact of a decline in the CP s infrastructure costs. Specifically, we set a =.5 and leave the remaining parameters unchanged Optimal Infrastructure Mean Arrival Rate Figure OA4: Optimal Infrastructure Level Vs Arrival Rate (Cost of lost requests = $80) Optimal Infrastructure Mean Arrival Rate Figure OA5: Optimal Infrastructure Level Vs Arrival Rate (a =.5) As expected, the infrastructure levels are higher than in the base case. That is, if the cost of lost requests increases or the infrastructure cost decreases, the optimal infrastructure increases. In both these

7 instances, the nearly linear relationship between mean arrival rate and optimal infrastructure is maintained. Thus the numerical analysis supports the assumption in Section 3.. (optimal infrastructure varies approximately linearly with mean demand). II. Numerical Results on Optimal Infrastructure Sizing (MMPP Traffic) We now study optimal infrastructure sizing under bursty traffic. All parameters except the traffic at the CP are the same as in the previous subsection (Figure OA). This includes cost of infrastructure, cost of a lost request and buffer size. For the traffic at the CP server, we assume MMPP parameters as described in section 3.. ( λ = 0λ ; ( q = 0.9, q = 0.) ). In addition, we maintain constant burstiness ( Ψ / λ ) across CPs. Figure OA6: Optimal Infrastructure Level for Poisson and MMPP traffic Figure OA7: Net cost incurred by CP The number of lost requests associated with any choice of I can be computed numerically and the optimal infrastructure level can be computed by trading off the infrastructure cost and cost of lost requests. In Figure OA6, we present the optimal infrastructure level associated with a given mean arrival rate under the assumption of MMPP traffic. For the sake of comparison, we also present the infrastructure levels if the traffic were Poisson (from Figure OA). Interestingly, we find that the CP s optimal infrastructure level with bursty traffic is lower than that with Poisson traffic, even though MMPP traffic has higher variance than Poisson traffic for the same mean arrival rate. This is driven by the fact that most of the lost

8 requests are due to bursts that occur when the system in state. In order to see a marked reduction in lost requests, the infrastructure level has to be raised above λ. However, this raises the infrastructure cost substantially and is suboptimal. Thus, the high disparity in arrival rates between the two states implies that the CP is often willing to accept server downtime during bursts, and thus the optimal infrastructure level is driven by λ and not λ. Since λ < λ, the optimal infrastructure level is also lower than that with Poisson traffic. In Figure OA7, we plot the CPs net cost (infrastructure cost + cost of lost requests) and observe that it is higher with MMPP traffic than under Poisson traffic. Thus, the CPs expected surplus is lower when the traffic is MMPP. The primary takeaway from this section is that the approximately linear relationship between optimal infrastructure and mean arrival rate is valid under bursty traffic as well. III. Numerical Results on Pricing with Bursty Traffic In this section, we determine the impact of cost and traffic parameters on the optimal price and resulting profits of the CDN. We first test the impact of a decrease in the CPs infrastructure costs. With declining bandwidth costs and costs of managed hosting solutions, this is particularly relevant. In the second row of Table OA, we present the simulation results on optimal usage-based prices for the case where a =.5. The results for the base case (a =3.46) from the paper are also presented for comparison (row ). When a CP s infrastructure costs decline, CP surplus from self-provisioning increases, and hence CDNs have to lower their price to continue to attract customers. This is consistent with the analytical results from Section 3.. We also test the impact of a decline in the CDN s variable cost by setting b =. The results are presented in row 3 of Table OA. Consistent with the analytical results of Section 3., the optimal price decreases when the CDN s costs decrease. Thus in reality, when infrastructure costs decrease, prices will decrease substantially, driven by both the increased CP surplus from selfprovisioning and the decrease in cost of operating a CDN. Interestingly, in all these cases, we observe that If the CP s cost is convex in the number of lost requests, then the CP may be more willing to incur higher infrastructure costs in return for lower cost of lost requests. The resulting infrastructure level can be much higher than suggested in Figure C. Regardless, bursts will continue to negatively impact the CP s surplus.

9 the optimal volume-based price function entails volume discounts when traffic is Poisson or pure MMPP (MMPP with same burstiness across CPs). However, CPs are charged a volume tax when the traffic is mixed, i.e. characterized by heterogeneity in burstiness across CPs. Poisson MMPP Mixed { a =3.46, b =3} 3.9X 6.6e 8.5X 4.9e 4.8X + 7.6e { a =.5, b =3} 3.0X 5.6e { a =3.46, b =} 3.4X 6.6e 7.X 6.6e 8.X 5.6e 3.7X + 7.6e 4.X + 5.6e Table OA: Optimal Price Functions for the Three Cases In each of the two new cases (first with a =.5 and second with b =), we also determine the CDN profits under pricing at the 95 th percentile of usage. Figures OA8 and OA9 demonstrate that while percentile-pricing provides no significant advantages when traffic is Poisson or pure-mmpp, it can enable a significant increase in profits when the traffic profile is mixed. This supports the results in our paper..60e+07.40e+07.0e+07 CDN Profit.00E E E+06 Usage-based Price 95th Percentile-based Price 4.00E+06.00E E+00 Poisson MMPP Mixed Traffic Profile Figure OA8: CDN Profit with Different Pricing Policies and Traffic Profiles (a =.5)

10 .50E+07.00E+07 CDN Profit.50E+07.00E+07 Usage-based Price 95th Percentile-based Price 5.00E E+00 Poisson MMPP Mixed Traffic Profile Figure OA9. CDN Profit with Different Pricing Policies and Traffic Profiles (b =) IV. Impact of Correlation in Traffic across CPs The simulation results presented in the paper are based on an assumption of independent traffic across CPs. This is generally reasonable given the considerable variety in types of subscribers that CDNs have today. However, it is interesting to consider how correlation in traffic across CPs might impact the CDN s pricing policy. In this subsection, we present the results of our pricing simulations for mixed traffic, assuming a correlation in traffic for the,000 CPs. All the off-diagonal entries in the correlation matrix are set to the same value. Because the primary impact of any correlation in bursts across CPs will be to overwhelm the CDN s infrastructure, we will make assumptions about the CDN s available capacity. If the CDN has infinite capacity, correlations in bursts do not impact the CDN s ability to provide services to the CPs. Thus, correlations in bursts would not impact either the value that CPs get from the CDN or the CDN s variable costs. In the presence of capacity constraints, simultaneous bursts across CPs can overwhelm the CDN s infrastructure and hinder its ability to provide service. We set the CDN s available capacity at 5M requests/period. Further, we assume that the CDN operates under the constraint that the 95 th percentile of the traffic from subscribers should be less than

11 75% of available capacity. Though the specific numbers chosen here are arbitrary, the structure of this decision rule reflects a common rule of thumb employed at CDNs. The simulation results are presented in Figure OA0. In our simulations, we find that initially there is no marked difference in the CDN s optimal price as the correlation coefficient increases. This is because the 95 th percentile of traffic is still within the limit. That is, the optimal price computed is an interior solution. CPs do not face any negative externality from bursts from another CP because any bursts can be easily accommodated by the CDN by rerouting requests and adjusting the number and placement of replicas. However, if the correlation in traffic continues to increase, it also increases the 95 th percentile of the subscriber traffic, eventually resulting in the traffic constraint being met. When this occurs, the CDN is unable to maintain its service and must either increase capacity or limit the traffic in its network. For a given capacity constraint, the CDN must increase its price as shown in Figure OA6. Thus, the net impact of correlation in burstiness is an increase in the price charged by the CDN Price(X=000) Correlation Coefficient Figure OA0. CDN s Price Vs. Correlation in CPs traffic Appendix C: CDN Simulations The simulations discussed in this Section are implemented on the CDNSim simulation platform. CDNSim is a trace-driven CDN simulator that simulates a network with clients, CDN servers and origin That is, the specific choice of 75% capacity utilization at the 95 th percentile of traffic is arbitrary, but it reflects a common X% capacity utilization at 95/99 th percentile of traffic rule of thumb.

12 servers interconnected through several intermediate routers. The simulator creates a network once the number of CDN servers and clients is specified. The simulator offers several network topology generators. We use the GT-ITM topology generator (Zegura et al 996) in our simulations. The topology generator creates edges connecting the CDN servers and routers based on the distance between them. CDNSim implements several features of TCP/IP, including packet switching, retransmission, etc. Each client is assigned to one of the CDN servers based on distance. The speed of the connection between the nodes is based on typical bandwidth in the real-world. Requests generated by the clients are forwarded to the designated CDN server and the server responds from its local cache or by forwarding the request to another CDN server or the origin server. The data objects and requests are generated using trace generators as described in Paliis et al (005). Initially, all objects are stored in the origin servers and all CDN servers are empty. During this phase, requests are always forwarded by the CDN servers to the origin servers. The initial request data is used as a training dataset for a placement algorithm that then assigns the objects to the CDN servers in order to minimize latency. One object may be stored in more than one CDN server by the placement algorithm. The training data is used only for object placement and thus performance results below do not account for requests in the training data. The response time for a request is the time between the user issuing a request and subsequently receiving the response. Lastly, simulations in CDNSim are considered valid if the number of request denied is zero or negligible relative to the total number of requests issued. Further details regarding the simulation testbed can be obtained from Pallis et al (005). Below, we focus only on the mean response time as a function of CDN network size. The complexity of the objects placement algorithm with N servers in CDNSim is O(N 4 ) and hence we restrict the simulations to a maximum of 50 CDN servers (which takes over a day to run). In Figure OA, we report the mean response time as a function of the number of CDN servers. We observe that the mean response time decreases with the number of CDN servers in a convex manner. Thus, the benefit from the CDN (improvement in response time) increases with the number of CDN servers in a concave fashion. This is consistent with the empirical observations in Cronin et al (00). Thus, we model the mean

13 response time per request as an increasing function of the number of CDN servers. Generally, the simulations suggest that the mean response time is strongly influenced by the network topology and the speed of the connections between the various elements of the networks (clients, CDNs, origin server, routers) Mean Latency Number of CDN Servers Figure OA: Mean Response Time versus Number of CDN Servers References K. Currier. Comparative Statics Analysis in Economics. World Scientific Publishing Company. August 000.

Service Adoption and Pricing of Content Delivery Network (CDN) Services

Service Adoption and Pricing of Content Delivery Network (CDN) Services University of Pennsylvania ScholarlyCommons Operations, nformation and Decisions Papers Wharton Faculty Research 9-008 Service Adoption and Pricing of Content Delivery Network CDN Services kartik Hosanagar

More information

Appendix B. Standards-Track TCP Evaluation

Appendix B. Standards-Track TCP Evaluation 215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error

More information

Worst-case Ethernet Network Latency for Shaped Sources

Worst-case Ethernet Network Latency for Shaped Sources Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................

More information

Optimizing Cloud Resources for Delivering IPTV. Services through Virtualization

Optimizing Cloud Resources for Delivering IPTV. Services through Virtualization Optimizing Cloud Resources for Delivering IPTV 1 Services through Virtualization Vaneet Aggarwal, Vijay Gopalakrishnan, Rittwik Jana, K. K. Ramakrishnan, Vinay A. Vaishampayan Abstract Virtualized cloud-based

More information

Chapter 4. Routers with Tiny Buffers: Experiments. 4.1 Testbed experiments Setup

Chapter 4. Routers with Tiny Buffers: Experiments. 4.1 Testbed experiments Setup Chapter 4 Routers with Tiny Buffers: Experiments This chapter describes two sets of experiments with tiny buffers in networks: one in a testbed and the other in a real network over the Internet2 1 backbone.

More information

Optimizing Cloud Resources for Delivering IPTV Services through Virtualization

Optimizing Cloud Resources for Delivering IPTV Services through Virtualization Optimizing Cloud Resources for Delivering IPTV Services through Virtualization Vaneet Aggarwal, Vijay Gopalakrishnan, Rittwik Jana, K. K. Ramakrishnan, Vinay A. Vaishampayan Abstract Virtualized cloud-based

More information

Network Control and Signalling

Network Control and Signalling Network Control and Signalling 1. Introduction 2. Fundamentals and design principles 3. Network architecture and topology 4. Network control and signalling 5. Network components 5.1 links 5.2 switches

More information

The Design and Performance Analysis of QoS-Aware Edge-Router for High-Speed IP Optical Networks

The Design and Performance Analysis of QoS-Aware Edge-Router for High-Speed IP Optical Networks The Design and Performance Analysis of QoS-Aware Edge-Router for High-Speed IP Optical Networks E. Kozlovski, M. Düser, R. I. Killey, and P. Bayvel Department of and Electrical Engineering, University

More information

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies CSCD 433/533 Priority Traffic Advanced Networks Spring 2016 Lecture 21 Congestion Control and Queuing Strategies 1 Topics Congestion Control and Resource Allocation Flows Types of Mechanisms Evaluation

More information

Adaptive Mechanism for Aggregation with fragments retransmission in high-speed wireless networks

Adaptive Mechanism for Aggregation with fragments retransmission in high-speed wireless networks Int. J. Open Problems Compt. Math., Vol. 4, No. 3, September 2011 ISSN 1998-6262; Copyright ICSRS Publication, 2011 www.i-csrs.org Adaptive Mechanism for Aggregation with fragments retransmission in high-speed

More information

CHAPTER 5 PROPAGATION DELAY

CHAPTER 5 PROPAGATION DELAY 98 CHAPTER 5 PROPAGATION DELAY Underwater wireless sensor networks deployed of sensor nodes with sensing, forwarding and processing abilities that operate in underwater. In this environment brought challenges,

More information

Implementation of a leaky bucket module for simulations in NS-3

Implementation of a leaky bucket module for simulations in NS-3 Implementation of a leaky bucket module for simulations in NS-3 P. Baltzis 2, C. Bouras 1,2, K. Stamos 1,2,3, G. Zaoudis 1,2 1 Computer Technology Institute and Press Diophantus Patra, Greece 2 Computer

More information

Solace Message Routers and Cisco Ethernet Switches: Unified Infrastructure for Financial Services Middleware

Solace Message Routers and Cisco Ethernet Switches: Unified Infrastructure for Financial Services Middleware Solace Message Routers and Cisco Ethernet Switches: Unified Infrastructure for Financial Services Middleware What You Will Learn The goal of zero latency in financial services has caused the creation of

More information

Communication Networks

Communication Networks Communication Networks Prof. Laurent Vanbever Exercises week 4 Reliable Transport Reliable versus Unreliable Transport In the lecture, you have learned how a reliable transport protocol can be built on

More information

Performance Consequences of Partial RED Deployment

Performance Consequences of Partial RED Deployment Performance Consequences of Partial RED Deployment Brian Bowers and Nathan C. Burnett CS740 - Advanced Networks University of Wisconsin - Madison ABSTRACT The Internet is slowly adopting routers utilizing

More information

Impact of Traffic Aggregation on Network Capacity and Quality of Service

Impact of Traffic Aggregation on Network Capacity and Quality of Service Impact of Traffic Aggregation on Network Capacity and Quality of Service Towela Nyirenda-Jere (towela@ittc.ukans.edu) Information and Telecommunications Technology Center University of Kansas http:// www.ittc.ukans.edu

More information

UNIT IV -- TRANSPORT LAYER

UNIT IV -- TRANSPORT LAYER UNIT IV -- TRANSPORT LAYER TABLE OF CONTENTS 4.1. Transport layer. 02 4.2. Reliable delivery service. 03 4.3. Congestion control. 05 4.4. Connection establishment.. 07 4.5. Flow control 09 4.6. Transmission

More information

Impact of Revenue-Driven CDN on the Competition among Network Operators

Impact of Revenue-Driven CDN on the Competition among Network Operators Impact of Revenue-Driven CDN on the Competition among Network Operators Patrick Maillé Telecom Bretagne, France patrick.maille@telecom-bretagne.eu Gwendal Simon Telecom Bretagne, France gwendal.simon@telecom-bretagne.eu

More information

Interconnection Networks: Topology. Prof. Natalie Enright Jerger

Interconnection Networks: Topology. Prof. Natalie Enright Jerger Interconnection Networks: Topology Prof. Natalie Enright Jerger Topology Overview Definition: determines arrangement of channels and nodes in network Analogous to road map Often first step in network design

More information

A TCO Analysis of Ericsson's Virtual Network System Concept Applied to Mobile Backhaul

A TCO Analysis of Ericsson's Virtual Network System Concept Applied to Mobile Backhaul A TCO Analysis of Ericsson's Virtual Network System Concept Applied to Mobile Backhaul Executive Summary Controlling total cost of ownership (TCO) of access, aggregation, and edge networks used for mobile

More information

Network Management & Monitoring

Network Management & Monitoring Network Management & Monitoring Network Delay These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/) End-to-end

More information

This Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network

This Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information

More information

Improving VoD System Efficiency with Multicast and Caching

Improving VoD System Efficiency with Multicast and Caching Improving VoD System Efficiency with Multicast and Caching Jack Yiu-bun Lee Department of Information Engineering The Chinese University of Hong Kong Contents 1. Introduction 2. Previous Works 3. UVoD

More information

On TCP friendliness of VOIP traffic

On TCP friendliness of VOIP traffic On TCP friendliness of VOIP traffic By Rashmi Parthasarathy WSU ID # 10975537 A report submitted in partial fulfillment of the requirements of CptS 555 Electrical Engineering and Computer Science Department

More information

An overview on Internet Measurement Methodologies, Techniques and Tools

An overview on Internet Measurement Methodologies, Techniques and Tools An overview on Internet Measurement Methodologies, Techniques and Tools AA 2011/2012 emiliano.casalicchio@uniroma2.it (Agenda) Lezione 2/05/2012 Part 1 Intro basic concepts ISP Traffic exchange (peering)

More information

Performance Analysis of TCP Variants

Performance Analysis of TCP Variants 102 Performance Analysis of TCP Variants Abhishek Sawarkar Northeastern University, MA 02115 Himanshu Saraswat PES MCOE,Pune-411005 Abstract The widely used TCP protocol was developed to provide reliable

More information

Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks

Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science Co-Director, Advanced Computer Networks Lab University

More information

The Simplex Algorithm for LP, and an Open Problem

The Simplex Algorithm for LP, and an Open Problem The Simplex Algorithm for LP, and an Open Problem Linear Programming: General Formulation Inputs: real-valued m x n matrix A, and vectors c in R n and b in R m Output: n-dimensional vector x There is one

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction In a packet-switched network, packets are buffered when they cannot be processed or transmitted at the rate they arrive. There are three main reasons that a router, with generic

More information

100 Mbps. 100 Mbps S1 G1 G2. 5 ms 40 ms. 5 ms

100 Mbps. 100 Mbps S1 G1 G2. 5 ms 40 ms. 5 ms The Influence of the Large Bandwidth-Delay Product on TCP Reno, NewReno, and SACK Haewon Lee Λ, Soo-hyeoung Lee, and Yanghee Choi School of Computer Science and Engineering Seoul National University San

More information

Caching and Optimized Request Routing in Cloud-based Content Delivery Systems

Caching and Optimized Request Routing in Cloud-based Content Delivery Systems Caching and Optimized Request Routing in Cloud-based Content Delivery Systems Niklas Carlsson a, Derek Eager b, Ajay Gopinathan 1a, Zongpeng Li c a Linköping University, Sweden, niklas.carlsson@liu.se

More information

Congestion control in TCP

Congestion control in TCP Congestion control in TCP If the transport entities on many machines send too many packets into the network too quickly, the network will become congested, with performance degraded as packets are delayed

More information

Lecture 6: Multicast

Lecture 6: Multicast Lecture 6: Multicast Challenge: how do we efficiently send messages to a group of machines? Need to revisit all aspects of networking Last time outing This time eliable delivery Ordered delivery Congestion

More information

Routing, Routing Algorithms & Protocols

Routing, Routing Algorithms & Protocols Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a

More information

Week 7: Traffic Models and QoS

Week 7: Traffic Models and QoS Week 7: Traffic Models and QoS Acknowledgement: Some slides are adapted from Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition, J.F Kurose and K.W. Ross All Rights Reserved,

More information

Introducing optical switching into the network

Introducing optical switching into the network Introducing optical switching into the network ECOC 2005, Glasgow Nick McKeown High Performance Networking Group Stanford University nickm@stanford.edu http://www.stanford.edu/~nickm Network religion Bigger

More information

Protecting Network Quality of Service Against Denial of Service Attacks

Protecting Network Quality of Service Against Denial of Service Attacks Protecting Network Quality of Service Against Denial of Service Attacks Douglas S. Reeves Peter Wurman NC State University S. Felix Wu U.C. Davis Dan Stevenson Xiaoyong Wu MCNC DARPA FTN PI Meeting January

More information

Evaluation Report: Improving SQL Server Database Performance with Dot Hill AssuredSAN 4824 Flash Upgrades

Evaluation Report: Improving SQL Server Database Performance with Dot Hill AssuredSAN 4824 Flash Upgrades Evaluation Report: Improving SQL Server Database Performance with Dot Hill AssuredSAN 4824 Flash Upgrades Evaluation report prepared under contract with Dot Hill August 2015 Executive Summary Solid state

More information

Quality of Service (QoS)

Quality of Service (QoS) Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive

More information

1188 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 5, OCTOBER Wei Sun, Student Member, IEEE, and Kang G. Shin, Fellow, IEEE

1188 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 5, OCTOBER Wei Sun, Student Member, IEEE, and Kang G. Shin, Fellow, IEEE 1188 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 5, OCTOBER 2005 End-to-End Delay Bounds for Traffic Aggregates Under Guaranteed-Rate Scheduling Algorithms Wei Sun, Student Member, IEEE, and Kang

More information

Distributed Traffic Shaping for Line Cards in the Cisco Gigabit Switch Router

Distributed Traffic Shaping for Line Cards in the Cisco Gigabit Switch Router Distributed Traffic Shaping for Line Cards in the Cisco 12000 Gigabit Switch Router This document describes the Distributed Traffic Shaping (DTS) feature for the 12000 series Gigabit Route Processor line

More information

Streaming Video and TCP-Friendly Congestion Control

Streaming Video and TCP-Friendly Congestion Control Streaming Video and TCP-Friendly Congestion Control Sugih Jamin Department of EECS University of Michigan jamin@eecs.umich.edu Joint work with: Zhiheng Wang (UofM), Sujata Banerjee (HP Labs) Video Application

More information

Using Traffic Models in Switch Scheduling

Using Traffic Models in Switch Scheduling I. Background Using Traffic Models in Switch Scheduling Hammad M. Saleem, Imran Q. Sayed {hsaleem, iqsayed}@stanford.edu Conventional scheduling algorithms use only the current virtual output queue (VOQ)

More information

Optimizing Cloud Resources for Delivering IPTV. Services through Virtualization

Optimizing Cloud Resources for Delivering IPTV. Services through Virtualization Optimizing Cloud Resources for Delivering IPTV 1 Services through Virtualization Vaneet Aggarwal, Vijay Gopalakrishnan, Rittwik Jana, K. K. Ramakrishnan, Vinay A. Vaishampayan Abstract Virtualized cloud-based

More information

Characterizing Internet Load as a Non-regular Multiplex of TCP Streams

Characterizing Internet Load as a Non-regular Multiplex of TCP Streams Characterizing Internet Load as a Non-regular Multiplex of TCP Streams J. Aracil, D. Morató Dpto. Automática y Computación Universidad Pública de Navarra {javier.aracil,daniel.morato}@unavarra.es http://www.tlm.unavarra.es

More information

Latency on a Switched Ethernet Network

Latency on a Switched Ethernet Network FAQ 07/2014 Latency on a Switched Ethernet Network RUGGEDCOM Ethernet Switches & Routers http://support.automation.siemens.com/ww/view/en/94772587 This entry is from the Siemens Industry Online Support.

More information

On the Relationship of Server Disk Workloads and Client File Requests

On the Relationship of Server Disk Workloads and Client File Requests On the Relationship of Server Workloads and Client File Requests John R. Heath Department of Computer Science University of Southern Maine Portland, Maine 43 Stephen A.R. Houser University Computing Technologies

More information

Distributed Algorithms in Networks EECS 122: Lecture 17

Distributed Algorithms in Networks EECS 122: Lecture 17 istributed lgorithms in Networks EES : Lecture 7 epartment of Electrical Engineering and omputer Sciences University of alifornia erkeley Network Protocols often have unintended effects TP Eample TP connections

More information

Buffer Management for Self-Similar Network Traffic

Buffer Management for Self-Similar Network Traffic Buffer Management for Self-Similar Network Traffic Faranz Amin Electrical Engineering and computer science Department Yazd University Yazd, Iran farnaz.amin@stu.yazd.ac.ir Kiarash Mizanian Electrical Engineering

More information

Analyzing the Receiver Window Modification Scheme of TCP Queues

Analyzing the Receiver Window Modification Scheme of TCP Queues Analyzing the Receiver Window Modification Scheme of TCP Queues Visvasuresh Victor Govindaswamy University of Texas at Arlington Texas, USA victor@uta.edu Gergely Záruba University of Texas at Arlington

More information

Introduction to Protocols

Introduction to Protocols Chapter 6 Introduction to Protocols 1 Chapter 6 Introduction to Protocols What is a Network Protocol? A protocol is a set of rules that governs the communications between computers on a network. These

More information

Replicate It! Scalable Content Delivery: Why? Scalable Content Delivery: How? Scalable Content Delivery: How? Scalable Content Delivery: What?

Replicate It! Scalable Content Delivery: Why? Scalable Content Delivery: How? Scalable Content Delivery: How? Scalable Content Delivery: What? Accelerating Internet Streaming Media Delivery using Azer Bestavros and Shudong Jin Boston University http://www.cs.bu.edu/groups/wing Scalable Content Delivery: Why? Need to manage resource usage as demand

More information

- The Cost of Network Latency -

- The Cost of Network Latency - - The Cost of Network Latency - Network latency in the U.S. has risen steadily with the deployment of more communications networks and increased complexity of internetworking. Just as air travel involves

More information

Delayed reservation decision in optical burst switching networks with optical buffers

Delayed reservation decision in optical burst switching networks with optical buffers Delayed reservation decision in optical burst switching networks with optical buffers G.M. Li *, Victor O.K. Li + *School of Information Engineering SHANDONG University at WEIHAI, China + Department of

More information

EXTENDING THE PRIORITY CEILING PROTOCOL USING READ/WRITE AFFECTED SETS MICHAEL A. SQUADRITO A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE

EXTENDING THE PRIORITY CEILING PROTOCOL USING READ/WRITE AFFECTED SETS MICHAEL A. SQUADRITO A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE EXTENDING THE PRIORITY CEILING PROTOCOL USING READ/WRITE AFFECTED SETS BY MICHAEL A. SQUADRITO A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE IN COMPUTER

More information

ANALYSIS OF THE CORRELATION BETWEEN PACKET LOSS AND NETWORK DELAY AND THEIR IMPACT IN THE PERFORMANCE OF SURGICAL TRAINING APPLICATIONS

ANALYSIS OF THE CORRELATION BETWEEN PACKET LOSS AND NETWORK DELAY AND THEIR IMPACT IN THE PERFORMANCE OF SURGICAL TRAINING APPLICATIONS ANALYSIS OF THE CORRELATION BETWEEN PACKET LOSS AND NETWORK DELAY AND THEIR IMPACT IN THE PERFORMANCE OF SURGICAL TRAINING APPLICATIONS JUAN CARLOS ARAGON SUMMIT STANFORD UNIVERSITY TABLE OF CONTENTS 1.

More information

The Impact of Reprovisioning on the Choice of Shared versus Dedicated Networks

The Impact of Reprovisioning on the Choice of Shared versus Dedicated Networks University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering 9-20-2010 The Impact of Reprovisioning on the Choice of Shared versus Dedicated Networks

More information

Delivery Network on the Internet

Delivery Network on the Internet Optimal erver Placement for treaming Content Delivery Network on the Internet Xiaojun Hei and Danny H.K. Tsang Department of Electronic and Computer Engineering Hong Kong University of cience and Technology

More information

Loopback: Exploiting Collaborative Caches for Large-Scale Streaming

Loopback: Exploiting Collaborative Caches for Large-Scale Streaming Loopback: Exploiting Collaborative Caches for Large-Scale Streaming Ewa Kusmierek Yingfei Dong David Du Poznan Supercomputing and Dept. of Electrical Engineering Dept. of Computer Science Networking Center

More information

Scaling Internet Routers Using Optics Producing a 100TB/s Router. Ashley Green and Brad Rosen February 16, 2004

Scaling Internet Routers Using Optics Producing a 100TB/s Router. Ashley Green and Brad Rosen February 16, 2004 Scaling Internet Routers Using Optics Producing a 100TB/s Router Ashley Green and Brad Rosen February 16, 2004 Presentation Outline Motivation Avi s Black Box Black Box: Load Balance Switch Conclusion

More information

PCnet-FAST Buffer Performance White Paper

PCnet-FAST Buffer Performance White Paper PCnet-FAST Buffer Performance White Paper The PCnet-FAST controller is designed with a flexible FIFO-SRAM buffer architecture to handle traffic in half-duplex and full-duplex 1-Mbps Ethernet networks.

More information

CHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE

CHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE 143 CHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE 6.1 INTRODUCTION This chapter mainly focuses on how to handle the inherent unreliability

More information

Capacity planning and.

Capacity planning and. Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Some economical principles Assume users have

More information

Zero to Microservices in 5 minutes using Docker Containers. Mathew Lodge Weaveworks

Zero to Microservices in 5 minutes using Docker Containers. Mathew Lodge Weaveworks Zero to Microservices in 5 minutes using Docker Containers Mathew Lodge (@mathewlodge) Weaveworks (@weaveworks) https://www.weave.works/ 2 Going faster with software delivery is now a business issue Software

More information

Using Low-power Modes for Energy Conservation in Ethernet LANs

Using Low-power Modes for Energy Conservation in Ethernet LANs Using Low-power Modes for Energy Conservation in Ethernet LANs Maruti Gupta Department of Computer Science Portland State University Portland, OR 9727 Email: mgupta@cs.pdx.edu Suresh Singh Department of

More information

Efficient and Accurate Ethernet Simulation

Efficient and Accurate Ethernet Simulation Efficient and Accurate Ethernet Simulation Jia Wang and Srinivasan Keshav Cornell Network Research Group (C/NRG) Department of Computer Science, Cornell University Ithaca, NY 4853-75 jiawang@cs.cornell.edu,

More information

Net Neutrality and Inflation of Traffic

Net Neutrality and Inflation of Traffic Introduction Net Neutrality and Inflation of Traffic Martin Peitz (MaCCI, University of Mannheim and CERRE) Florian Schuett (TILEC, CentER, Tilburg University) Symposium in Honor of Jean Tirole The Hague,

More information

Implications of Proxy Caching for Provisioning Networks and Servers

Implications of Proxy Caching for Provisioning Networks and Servers Implications of Proxy Caching for Provisioning Networks and Servers Mohammad S. Raunak, Prashant Shenoy, Pawan GoyalÞand Krithi Ramamritham Ý Department of Computer Science, ÞEnsim Corporation, University

More information

Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks

Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks Multiconfiguration Multihop Protocols: A New Class of Protocols for Packet-Switched WDM Optical Networks Jason P. Jue, Member, IEEE, and Biswanath Mukherjee, Member, IEEE Abstract Wavelength-division multiplexing

More information

WarpTCP WHITE PAPER. Technology Overview. networks. -Improving the way the world connects -

WarpTCP WHITE PAPER. Technology Overview. networks. -Improving the way the world connects - WarpTCP WHITE PAPER Technology Overview -Improving the way the world connects - WarpTCP - Attacking the Root Cause TCP throughput reduction is often the bottleneck that causes data to move at slow speed.

More information

Model suitable for virtual circuit networks

Model suitable for virtual circuit networks . The leinrock Independence Approximation We now formulate a framework for approximation of average delay per packet in telecommunications networks. Consider a network of communication links as shown in

More information

Adaptive Linear Prediction of Queues for Reduced Rate Scheduling in Optical Routers

Adaptive Linear Prediction of Queues for Reduced Rate Scheduling in Optical Routers Adaptive Linear Prediction of Queues for Reduced Rate Scheduling in Optical Routers Yang Jiao and Ritesh Madan EE 384Y Final Project Stanford University Abstract This paper describes a switching scheme

More information

Trace Traffic Integration into Model-Driven Simulations

Trace Traffic Integration into Model-Driven Simulations Trace Traffic Integration into Model-Driven Simulations Sponsor: Sprint Kert Mezger David W. Petr Technical Report TISL-10230-10 Telecommunications and Information Sciences Laboratory Department of Electrical

More information

ADQ14-FWATD. User Guide. Author(s): SP Devices Document no.: Classification: Public Revision: PA7 Date:

ADQ14-FWATD. User Guide. Author(s): SP Devices Document no.: Classification: Public Revision: PA7 Date: ADQ14-FWATD User Guide Author(s: SP Devices Document no.: 16-1849 Classification: Revision: Date: 2018-03-02 Contents 1 Introduction 3 1.1 Definitions & Abbreviations...................................

More information

Lecture Outline. Bag of Tricks

Lecture Outline. Bag of Tricks Lecture Outline TELE302 Network Design Lecture 3 - Quality of Service Design 1 Jeremiah Deng Information Science / Telecommunications Programme University of Otago July 15, 2013 2 Jeremiah Deng (Information

More information

What s the magic of real-time video streaming with hyper-low latency?

What s the magic of real-time video streaming with hyper-low latency? What s the magic of real-time video streaming with hyper-low latency? A technical overview about streaming infrastructure solutions and transfer protocols. Development and improvement two big words united

More information

SIMULATING CDPD NETWORKS USING OPNET

SIMULATING CDPD NETWORKS USING OPNET Michael Jiang Stephen Hardy Ljiljana Trajkovic SIMULATING CDPD NETWORKS USING OPNET TM Communication Networks Laboratory School of Engineering Science Simon Fraser University Road Map Introduction Simulation

More information

Efficient Randomized Web-Cache Replacement Schemes Using Samples From Past Eviction Times

Efficient Randomized Web-Cache Replacement Schemes Using Samples From Past Eviction Times IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 4, AUGUST 2002 441 Efficient Randomized Web-Cache Replacement Schemes Using Samples From Past Eviction Times Konstantinos Psounis, Student Member, IEEE,

More information

Computer Networking. Queue Management and Quality of Service (QOS)

Computer Networking. Queue Management and Quality of Service (QOS) Computer Networking Queue Management and Quality of Service (QOS) Outline Previously:TCP flow control Congestion sources and collapse Congestion control basics - Routers 2 Internet Pipes? How should you

More information

Deadlock. Reading. Ensuring Packet Delivery. Overview: The Problem

Deadlock. Reading. Ensuring Packet Delivery. Overview: The Problem Reading W. Dally, C. Seitz, Deadlock-Free Message Routing on Multiprocessor Interconnection Networks,, IEEE TC, May 1987 Deadlock F. Silla, and J. Duato, Improving the Efficiency of Adaptive Routing in

More information

IP Traffic Exchange Market Developments and Policy Challenges

IP Traffic Exchange Market Developments and Policy Challenges IP Traffic Exchange Market Developments and Policy Challenges BEREC/OECD Workshop Brussels, 2 November 2011 Dennis Weller Navigant Economics wellerdennis@mac.com Page 1 Growth of the Internet» Two billion

More information

Congestion Control. Tom Anderson

Congestion Control. Tom Anderson Congestion Control Tom Anderson Bandwidth Allocation How do we efficiently share network resources among billions of hosts? Congestion control Sending too fast causes packet loss inside network -> retransmissions

More information

Modelling a Video-on-Demand Service over an Interconnected LAN and ATM Networks

Modelling a Video-on-Demand Service over an Interconnected LAN and ATM Networks Modelling a Video-on-Demand Service over an Interconnected LAN and ATM Networks Kok Soon Thia and Chen Khong Tham Dept of Electrical Engineering National University of Singapore Tel: (65) 874-5095 Fax:

More information

Lecture 5: Performance Analysis I

Lecture 5: Performance Analysis I CS 6323 : Modeling and Inference Lecture 5: Performance Analysis I Prof. Gregory Provan Department of Computer Science University College Cork Slides: Based on M. Yin (Performability Analysis) Overview

More information

Switched Network Latency Problems Solved

Switched Network Latency Problems Solved 1 Switched Network Latency Problems Solved A Lightfleet Whitepaper by the Lightfleet Technical Staff Overview The biggest limiter to network performance is the control plane the array of processors and

More information

Simulation Studies of the Basic Packet Routing Problem

Simulation Studies of the Basic Packet Routing Problem Simulation Studies of the Basic Packet Routing Problem Author: Elena Sirén 48314u Supervisor: Pasi Lassila February 6, 2001 1 Abstract In this paper the simulation of a basic packet routing problem using

More information

EECS 3214 Midterm Test Winter 2017 March 2, 2017 Instructor: S. Datta. 3. You have 120 minutes to complete the exam. Use your time judiciously.

EECS 3214 Midterm Test Winter 2017 March 2, 2017 Instructor: S. Datta. 3. You have 120 minutes to complete the exam. Use your time judiciously. EECS 3214 Midterm Test Winter 2017 March 2, 2017 Instructor: S. Datta Name (LAST, FIRST): Student number: Instructions: 1. If you have not done so, put away all books, papers, and electronic communication

More information

Why Scale Matters & How the Cloud Really is Different

Why Scale Matters & How the Cloud Really is Different Why Scale Matters & How the Cloud Really is Different James Hamilton, AWS VP & Distinguished Engineer SPOT205: November 23, 2013 2013 Amazon.com, Inc. and its affiliates. All rights reserved. May not be

More information

A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing

A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing Mare Lole and Branko Mikac Department of Telecommunications Faculty of Electrical Engineering and Computing,

More information

SOFTWARE LICENSE LIMITED WARRANTY

SOFTWARE LICENSE LIMITED WARRANTY ANALYTICAL TOOL GUIDE VERSION: 5..0..6 IMPORTANT NOTICE Elitecore has supplied this Information believing it to be accurate and reliable at the time of printing, but is presented without warranty of any

More information

PRESENTED BY SARAH KWAN NETWORK CODING

PRESENTED BY SARAH KWAN NETWORK CODING PRESENTED BY SARAH KWAN NETWORK CODING NETWORK CODING PRESENTATION OUTLINE What is Network Coding? Motivation and Approach Network Coding with Lossless Networks Challenges in Developing Coding Algorithms

More information

Some economical principles

Some economical principles Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Some economical principles Assume users have

More information

Time-Step Network Simulation

Time-Step Network Simulation Time-Step Network Simulation Andrzej Kochut Udaya Shankar University of Maryland, College Park Introduction Goal: Fast accurate performance evaluation tool for computer networks Handles general control

More information

LOAD BALANCING IN CONTENT DISTRIBUTION NETWORKS

LOAD BALANCING IN CONTENT DISTRIBUTION NETWORKS LOAD BALANCING IN CONTENT DISTRIBUTION NETWORKS - Load Balancing Algorithm for Distributed Cloud Data Centers - Paul J. Kühn University of Stuttgart, Germany Institute of Communication Networks and Computer

More information

Mohammad Hossein Manshaei 1393

Mohammad Hossein Manshaei 1393 Mohammad Hossein Manshaei manshaei@gmail.com 1393 Voice and Video over IP Slides derived from those available on the Web site of the book Computer Networking, by Kurose and Ross, PEARSON 2 Multimedia networking:

More information

Overview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services

Overview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services Overview 15-441 15-441 Computer Networking 15-641 Lecture 19 Queue Management and Quality of Service Peter Steenkiste Fall 2016 www.cs.cmu.edu/~prs/15-441-f16 What is QoS? Queuing discipline and scheduling

More information

Request for Comments: 1787 T.J. Watson Research Center, IBM Corp. Category: Informational April 1995

Request for Comments: 1787 T.J. Watson Research Center, IBM Corp. Category: Informational April 1995 Network Working Group Y. Rekhter Request for Comments: 1787 T.J. Watson Research Center, IBM Corp. Category: Informational April 1995 Status of this Memo Routing in a Multi-provider Internet This memo

More information

Analytic Performance Models for Bounded Queueing Systems

Analytic Performance Models for Bounded Queueing Systems Analytic Performance Models for Bounded Queueing Systems Praveen Krishnamurthy Roger D. Chamberlain Praveen Krishnamurthy and Roger D. Chamberlain, Analytic Performance Models for Bounded Queueing Systems,

More information

BEFORE THE PENNSYLVANIA PUBLIC UTILITY COMMISSION PETITION OF PECO ENERGY COMPANY FOR APPROVAL OF ITS SMART METER UNIVERSAL DEPLOYMENT PLAN

BEFORE THE PENNSYLVANIA PUBLIC UTILITY COMMISSION PETITION OF PECO ENERGY COMPANY FOR APPROVAL OF ITS SMART METER UNIVERSAL DEPLOYMENT PLAN PECO ENERGY COMPANY STATEMENT NO. 2 BEFORE THE PENNSYLVANIA PUBLIC UTILITY COMMISSION PETITION OF PECO ENERGY COMPANY FOR APPROVAL OF ITS SMART METER UNIVERSAL DEPLOYMENT PLAN DOCKET NO. M-2009-2123944

More information