Searching for authors named "Christos Gkantsidis" – sorted by Relevance.
15 documents found, showing 1 through 10.
Next 10 →
-
Design and Implementation of IGMPv3 for Linux
- …The purpose of this document is to describe, in as much detail as possible, the implementation of the IGMPv3 protocol which was done at Sprint Labs at Burlingame, CA. It describes also other activities related to this eort. 1 …
- Add To MetaCart
-
Towards Topology Aware Networks
- …Abstract—We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynchronous heuristics that use only local information and local computations. These algorithms are based on distributed …
- Cited by 1 (0 self) – Add To MetaCart
-
Network Coding for Large Scale Content Distribution
- …Abstract — We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduli…
- Cited by 157 (4 self) – Add To MetaCart
-
Hybrid search schemes for unstructured peer-to-peer networks
- …Abstract — We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes combine flooding and random walks, look ahead and replication. We consider both regular topologies and topologies wit…
- Cited by 39 (1 self) – Add To MetaCart
-
An Optimization Framework for Practical Multipath Routing in Wireless Mesh Networks
- …We consider wireless mesh networks, and exploit the inherent broadcast nature of wireless by making use of multipath routing. We present an optimization framework that enables us to derive optimal flow control, routing, scheduling, and rate adaptation schemes, where we use network coding to ease the…
- Add To MetaCart
-
On the semantics of Internet topologies
- …Models for network topology are necessary for simulation-based studies of a variety of networking problems. Increasingly the research community is interested in problems that arise due to the large scale of the Internet (e.g., BGP routing, performance of peer-to-peer systems). For these sorts of pro…
- Cited by 5 (0 self) – Add To MetaCart
-
On the Effect of Large-Scale Deployment of Parallel Downloading
- …1. Introduction The Internet has seen a substantial growth in traffic and pop-ularity. As a result, popular web and ftp sites have to deal with higher loads. On the other hand, users ' expectationshave increased; they want to download the desired information in the shortest possible time.Two main ap…
- Cited by 6 (0 self) – Add To MetaCart
-
Sampling strategies for epidemic-style information dissemination
- …which covers topics from improving the performance of individual computers to designing novel distributed systems that can scale to hundreds of thousands of hosts. Our focus is fundamental research on improving the efficiency of data distribution of all types across networks, and is not limited to c…
- Cited by 1 (0 self) – Add To MetaCart
-
Randomized decentralized broadcasting algorithms
- …Abstract — We consider the problem of broadcasting a live stream of data in an unstructured network. Broadcasting has been studied extensively for networks with capacity constraints at the edges. We give the first completely distributed algorithm that optimally solves the broadcast problem in edge-c…
- Cited by 7 (2 self) – Add To MetaCart
-
Random Walks in Peer-to-Peer Networks
- …We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. For searching, we argue that random walks achieve improvement over flooding in the case of clustered overlay topologies and in the case of re-issuing the same request several tim…
- Cited by 102 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
