Concept

Link-state routing protocol

Publications associées (140)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Energy-Proportional and Scalable Networks

Nedeljko Vasic

The power consumption of the Internet and datacenter networks is already significant due to a large degree of redundancy and high idle power consumption of the network elements. Therefore, dynamically matching network resources to the actual load is highly ...

EPFL2011

Valuable Detours: Least-Cost Anypath Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

2011

Signaling and Reciprocity

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

A network coding approach to the shipper detection problem

Christina Fragouli, Lorenzo Keller, Abdulkadir Karaagaç

This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance im ...

2011

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

Agent-Based Routing in Queueing Systems

Olivier Gallay

Waiting time in any network is often a costly and hence a bad experience. Therefore, to avoid jamming regions becomes essential in the optimization of traffic flows. In this regard, the conception and the control of complex networks supporting flows of uni ...

EPFL2010

Cross-Layer Based Analysis of Multi-Hop Wireless Networks

Tarik Tabet

In this work, we revisit classical packet radio networks with a modern treatment of physical-layer (PHY) procedures, medium-access (MAC) and geographic channel-driven routing protocols. Our network model assumes that nodes are randomly distributed on the p ...

2010

Collaborative routing in mobile partitioned networks

Natasa Sarafijanovic-Djukic

Embedded wireless networks find a broad spectrum of applications in transportation, environmental monitoring, logistics, supply chain management, and "pocketswitched" communication. The node mobility patterns in these applications tend to give rise to spat ...

EPFL2010

A Provably Starvation-Free Distributed Directory Protocol

Vincent Gramoli, Hagit Albo Attiya

This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests, allowing to write the object locally, as well as lookup requests, providing a read-on ...

Springer-Verlag2010

COMBINE: An Improved Directory-Based Consistency Protocol

Vincent Gramoli, Hagit Albo Attiya

This paper presents COMBINE, a directory-based consistency protocol for shared objects, designed for large-scale distributed systems with unreliable links. Directory-based consistency protocols support move requests, allowing to write the object locally, a ...

2010