Concept

Internet traffic

Related publications (25)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A distributed minimum-distortion routing algorithm with in-network data processing

Ramin Khalili

In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g., a capacity constraint) and to increase the utility of data in the output flows given these constraints. In this paper we focus on the special case in wh ...

2008

MFACE: A Multicast Backbone-Assisted Face Traversal Algorithm for Arbitrary Planar Ad Hoc and Sensor Network Topologies

François Ingelrest

Face is a well-known localized routing protocol for ad hoc and sensor networks which guarantees delivery of the message as long as a path exists between the source and the destination. This is achieved by employing a left/right hand rule to route the messa ...

2007

PILOT: ProbabilistIc Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Providing reliable group communication is an ever recurring issue in distributed settings. In mobile ad hoc networks, this issue becomes more significant since all nodes act as peers, while the issue gets even more challenging due to highly dynamic and unp ...

2004

Protocol overheads in networks

Prasenjit Dey

To increase network capacity, it may not be sufficient to just increase the capacity of the networks. It may be necessary to reduce the network overhead bits, to leave more room for the data bits, to increase the network capacity. As network functions beco ...

EPFL2004

Bits of Internet traffic control

Milan Vojnovic

In this work, we consider four problems in the context of Internet traffic control. The first problem is to understand when and why a sender that implements an equation-based rate control would be TCP-friendly, or not—a sender is said to be TCP-friendly if ...

EPFL2003

PILOT: ProbabIlistic Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

2003

Batched Patch Caching for Streaming Media

Pascal Frossard

We elaborate on a scheme that combines batch patching at an origin server and prefix/interval caching at an edge server receiving the clients' requests. We derive a cost function that factors in the aggregate backbone rate, the cache occupancy and the disk ...

2002

Fault location algorithms for optical networks

Today, there is no doubt that optical networks are the solution to the explosion of Internet traffic that two decades ago we only dreamed about. They offer high capacity with the use of Wavelength Division Multiplexing (WDM) techniques among others. Howeve ...

EPFL2000

The Renegotiable Variable Bit Rate Service: Characterisation and prototyping

Jean-Yves Le Boudec

he traffic generated by multimedia applications presents a high degree of burstiness that can hardly be described by a static set of traffic parameters. We present a dynamic QoS negotiation scheme applied to a prototype application that provides temporized ...

1999

The Renegotiable Variable Bit Rate Service: characterisation and prototyping

Jean-Yves Le Boudec

The traffic generated by multimedia applications presents a high degree of burstiness that can be hardly described by a static set of traffic parameters. We present a dynamic QoS negotiation scheme applied to a prototype application that provides temporize ...

1999