Publication

Physics-Inspired Methods for Networking and Communications

Related publications (36)

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.

Mobility in wireless networks: friend or foe

Jun Luo

Wireless networking technologies allow computing devices to move while keeping them online, but the device mobility poses considerable technical challenges. Network designers, on the one hand, consider mobility to be harmful because it leads to dynamic and ...

EPFL2006

Slowing light in optical fibres sees fast progress

Luc Thévenaz

Slowing down light to produce optical delay lines for communication networks has advanced enormously in the last year. Luc Thévenaz and Miguel Gonzalez-Herraez chart this recent progress and describe the new challenges facing developers of practical device ...

IOP Publishing2006

Deux applications de processus ponctuels aux réseaux de communication

Patrick Thiran, Olivier Dousse, Xuan Hung Nguyen

This paper (in Frensh) summarizes recent results obtained by using shot noise processes for two applications in communication networks: first, TCP/IP traffic models for backbone networks; and next the study of connectivity under rate constraints in wireles ...

2005

Towards Flexible Finite-State Machine Based Protocol Composition

André Schiper, Sergio Mena, Nils Richard Ekwall, Stefan Pleisch

Group communication provides primitives that ensure reliable and ordered delivery of messages to a group of destinations. It is an important building block for replicated fault-tolerant applications such as replicated databases. In the past, most group com ...

2004

NASCENT: Network Layer Service for Vicinity Ad-hoc Groups

Jean-Pierre Hubaux, Jun Luo

Many envisioned applications of ad hoc networks involve only small scale networks that we term Vicinity Ad-hoc Groups (VAGs). Distributed coordination services, instead of pairwise communications, are primary requirements of VAGs. Existing designs for dist ...

2004

Consensus with Unknown Participants or Fundamental Self-Organization

André Schiper, David Cavin, Yoav Sasson

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...

2004

NASCENT: Network Layer Service for Vicinity Ad-hoc Groups

Jean-Pierre Hubaux, Jun Luo

Many envisioned applications of ad hoc networks involve only small-scale networks that we term Vicinity Ad-hoc Groups (VAGs). Distributed coordination services, instead of pairwise communications, are the primary requirements of VAGs. Existing designs for ...

2004

Min-plus System Theory Applied to Communication Networks

Jean-Yves Le Boudec, Patrick Thiran

Network Calculus is a set of recent developments, which provide a deep insight into flow problems encountered in networking. It can be viewed as the system theory that applies to computer networks. Contrary to traditional system theory, it relies on max-pl ...

2002

Network Calculus

Jean-Yves Le Boudec, Patrick Thiran

Network Calculus is a collection of results based on Min-Plus algebra, which applies to deterministic queuing systems found in communication networks. It can be used for example to understand - the computations for delays used in the IETF guaranteed servic ...

Springer Verlag2001

Self Organized Terminode Routing - Version 2

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a wide area mobile ad hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage; seco ...

2001