Network topology aware scheduling of collective communications
Related publications (39)
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.
Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be s ...
Institute of Electrical and Electronics Engineers2010
Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...
The throughput of wireless networks is known to scale poorly when the number of users grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero as the number of users tends to infinity, under various assumptions. One of them ...
State-of-the-art BFT protocols remain far from the maximum theoretical throughput. Based on exhaustive eval- uation and monitoring of existing BFT protocols, we highlight few impediments to their scaling. These include the use of IP multicast, the presence ...
The main objectives pursued by parallelism in communications are network capacity enhancement and fault-tolerance. Efficiently enhancing the capacity of a network by parallel communications is a non-trivial task. Some applications may also allow one to spl ...
We address the problem of delay-constrained streaming of multimedia packets over dynamic bandwidth channels. Efficient streaming solutions generally rely on the knowledge of the channel bandwidth, in order to select the media packets to be transmitted, acc ...
A system for sender-driven video streaming from multiple servers to a single receiver is considered in this paper. The receiver monitors incoming packets on each network path and returns, to the senders, estimates of the available bandwidth on all the netw ...
In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g., a capacity constraint) and to increase the utility of data in the output flows given these constraints. In this paper we focus on the special case in wh ...
Packet detection and timing acquisition for IR-UWB networks such as 802.15.4a relies on the presence of an acquisition sequence (or preamble) at the beginning of each packet. A simple network design choice is to use a common acquisition sequence for the wh ...
Packet detection and timing acquisition for IR-UWB networks such as 802.15.4a relies on the presence of an acquisition sequence (or preamble) at the beginning of each packet. A simple network design choice is to use a common acquisition sequence for the wh ...