Publication

Processing along the way: forwarding vs. coding

Publications associées (51)

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

Subspace properties of randomized network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

Randomized network coding has network nodes randomly combine and exchange linear combinations of the source packets. A header appended to the packet, called coding vector, specifies the exact linear combination that each packet carries. The main contributi ...

2007

Distributed and Component Oriented Tools for Communication Networks Using Web Services

Sébastien Rumley, Christian Gaumier, Christophe Trefois

Modern communication networks are reaching a high level of complexity. As their global dimensioning and performance evaluation are very hard tasks, a multi-layer approach is generally applied to divide them in smaller problems easier to tackle. Within this ...

ARGESIM2007

MAC layer functions for SLEF

Alaeddine El Fawal, Lorenzo Keller

We develop three functions around the MAC layer: (1) Pseudo broadcast is a technique used to improve throughput of broadcast transmissions in case of congested networks. The mechanism consists in sending a packet in unicast to a station using RTS/CTS. Othe ...

2006

Node Cooperation in Hybrid Ad hoc Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

A hybrid ad hoc network is a structure-based network that is extended using multi-hop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station t ...

2006

Fast Dimensioning of Packet-Switched All-Optical Networks

This paper addresses the basic concepts of the packet switching in the optical domain and describes an analytical approach to evaluate the end-to-end performance of networks employing slotted (fixed length) optical packets. Thus, for a given topology and t ...

Springer2006

On Correctness of Dynamic Protocol Update

Olivier Rütti

Replacing or adding network protocols at runtime is problematic – it must involve synchronization of the protocol switch with ongoing local and network communication. We define a formal mathematical model of dynamic protocol update (DPU) and use it to defi ...

2005

Method of detecting anomalous behaviour in a computer network

Boi Faltings, Pedro Bados

Method of detecting anomalous behaviour in a computer network comprising the steps of - monitoring network traffic flowing in a computer network system, - authenticating users to which network packets of the network traffic are associated, - extracting par ...

2005

Performance analysis of packet switched all-optical networks

All-optical packet switching has been intensively investigated in recent years as an alternative to static, crossconnect based networks. Several switch architectures have been proposed, all of them using buffers made of fibre delay lines. The paper address ...

IEEE2003

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