Publications related to Load Balancing in Data Networks

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.

On the Capacity of Noncoherent Network Coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We consider the problem of multicasting information from a source to a set of receivers over a network where intermediate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoheren ...

Institute of Electrical and Electronics Engineers2011

Efficient Hashing Using the AES Instruction Set

Joppe Willem Bos, Martijn Stam, Onur Özen

In this work, we provide a software benchmark for a large range of 256-bit blockcipher-based hash functions. We instantiate the underlying blockcipher with AES, which allows us to exploit the recent AES instruction set (AESNI). Since AES itself only output ...

Springer Berlin Heidelberg2011

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Patrick Thiran, Julien Pierre Sacha Herzen

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Self-organized fault-tolerant routing in peer-to-peer overlays

Karl Aberer, Wojciech Galuba, Zoran Despotovic

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

IEEE2009

Ambush avoidance in Vehicle Routing for valuable delivery

Matteo Salani, Gaëtan Duyckaerts, Peter Swartz

In this work we consider route planning for valuable delivery in an urban environment under the threat of ambushes in which a vehicle, starting from a depot, has to serve a set of predetermined destinations during the day. We provide a method to plan for h ...

2009

Circulation of Autonomous Agents in Production and Service Networks

Max-Olivier Hongler, Olivier Gallay

The inherent complexity characterizing the production and/or service networks strongly favors decentralized and self-organizing mechanisms to regulate the flows of matter and information in circulation. This basic observation motivates us to study the flow ...

Elsevier2009

Another Glance at Double-Length Hashing

Martijn Stam, Onur Özen

We propose a novel framework for blockcipher-based double-length hash functions by extending the recent generalization presented by Stam at FSE '09 for single-call hash functions. We focus on compression functions compressing 3n bits to 2n bits that use on ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Load Balancing in Data Networks

Graph Chatbot

Chat with Graph Search

Energy-Proportional and Scalable Networks

On the Capacity of Noncoherent Network Coding

Efficient Hashing Using the AES Instruction Set

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Neighbor discovery with reception status feedback to transmitters

Self-organized fault-tolerant routing in peer-to-peer overlays

Gaussian Diamond Network with Adversarial Jammer

Ambush avoidance in Vehicle Routing for valuable delivery

Circulation of Autonomous Agents in Production and Service Networks

Another Glance at Double-Length Hashing

Neighbor discovery with reception status feedback to transmitters

Energy-Proportional and Scalable Networks

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Ambush avoidance in Vehicle Routing for valuable delivery

Self-organized fault-tolerant routing in peer-to-peer overlays

Another Glance at Double-Length Hashing

On the Capacity of Noncoherent Network Coding

Circulation of Autonomous Agents in Production and Service Networks

Gaussian Diamond Network with Adversarial Jammer

Efficient Hashing Using the AES Instruction Set