Lattice Networks: Capacity Limits, Optimal Routing and Queueing Behavior
Related publications (50)
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.
The Short Messaging Service(SMS) which has become very popular in cellular networks is very highly priced. We show in this paper how self-organizing ad-hoc networks can be used to provide the short messaging service, at a much lower price. We propose a rou ...
Compared to wired networks, sensor networks pose two additional challenges for monitoring functions: they support much less probing traffic, and they change their routing topologies much more frequently. We propose therefore to use only end-to-end applicat ...
A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...
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 ...
The analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson’s Theorem that give ...
Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create ...
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of reque ...
Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile or frequently dis ...
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failures) and the dynamic case (node failures). For static networks, we derive upp ...
Identification is an essential building block for many services in distributed information systems. The quality and purpose of identification may differ, but the basic underlying problem is always to bind a set of attributes to an identifier in a unique an ...