Murtaza Motiwala

Towards a cost model for network traffic

By: 
Murtaza Motiwala, Amogh Dhamdhere, Nick Feamster, Anukool Lakhina
Appears in: 
CCR January 2012

We develop a holistic cost model that operators can use to help evaluate the costs of various routing and peering decisions. Using real traffic data from a large carrier network, we show how network operators can use this cost model to significantly reduce the cost of carrying traffic in their networks. We find that adjusting the routing for a small fraction of total flows (and total traffic volume) significantly reduces cost in many cases. We also show how operators can use the cost model both to evaluate potential peering arrangements and for other network operations problems.

Public Review By: 
Augustin Chaintreau

Signal is not information, and however hard we try our networked life is not 100% efficient. In some extreme cases, one might ever wonder if some of these online conversations are worth taking place. One reasurring thought is that, if the value of communication is subject to debate, its cost on the other hand can probably be assessed objectively. No matter how boring is your train neighbor’s cellphone conversation, you can probably infer how much he or she will eventually pay for it. This paper may (or not) surprise you as it asks the apparently simple question “what is the real cost of carrying a given traffic flow?” and it tells that, well, it's perhaps more complicated than we think. As several reviewers pointed out, this is perhaps even more complicated than what a 6 page paper can tell. There are many good reasons (much better than the one I gave above) to compute this cost, primarily for an operator to optimize key decisions like the establishment of peering links. This is where the paper focus and it establishes that it is likely that the cost can be greatly reduce by modifying routes for a small portion of the traffic. Where it differs from traditional traffic engineering is that it does not aim at a previously agreed performance goals, but it uses the same means to minimize the overall cost. Not surprisingly, the cost model turns out to be an essential piece: for substantially the same gain, the fraction of traffic to reroute varies from 10% (for linear cost) to 30% (when a cooperative game theory following Shapley’s fairness axioms are used). This result more generally establishes that cost models matter, and also that they can be useful. One clear merit of this work is to make all of us aware that perhaps our community should be engaging in understanding which cost model can and should be used. Major questions remaining to answer are (1) the impact of the congestion and feedback loop, (2) the roles that content providers and CDNs play in the cost value chain, and (3) how would the rerouting proposed in this article be actually implemented without terribly impacting performances or previously agreed terms of service. This paper will not answer these entirely, but it provides some elements and hopefully you'll think differently about them after you read it.

SwitchBlade: A Platform for Rapid Deployment of Network Protocols on Programmable Hardware

By: 
Muhammad Bilal Anwer, Murtaza Motiwala, Mukarram bin Tariq, and Nick Feamster
Appears in: 
CCR October 2010

We present SwitchBlade, a platform for rapidly deploying custom protocols on programmable hardware. SwitchBlade uses a pipeline-based design that allows individual hardware modules to be enabled or disabled on the fly, integrates software exception handling, and provides support for forwarding based on custom header fields. SwitchBlade's ease of programmability and wire-speed performance enables rapid prototyping of custom data-plane functions that can be directly deployed in a production network.

Path Splicing

By: 
Murtaza Motiwala, Megan Elmore, Nick Feamster, and Santosh Vempala
Appears in: 
CCR October 2008

We present path splicing, a new routing primitive that allows network paths to be constructed by combining multiple routing trees (“slices”) to each destination over a single network topology. Path splicing allows traffic to switch trees at any hop en route to the destination. End systems can change the path on which traffic is forwarded by changing a small number of additional bits in the packet header.

Syndicate content