Searching for authors named "Aleksandrs Slivkins" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
Towards Fast Decentralized Construction of Locality-Aware Overlay Networks
- …We consider a large overlay network where any two nodes can communicate directly via the underlying Internet as long as the sender knows the recipient’s ip-address. Due to the scalability requirement, the overlay network must be sparse: a given node can store at most a polylogarithmic number of ipad…
- Cited by 1 (0 self) – Add To MetaCart
-
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
- …Given a graph and pairs s i t i of terminals, the edge-disjoint paths problem is to determine whether there exist s i t i paths that do not share any edges. We consider this problem on acyclic digraphs. It is known to be NP-complete and solvable in time n where k is the number of paths. It has …
- Cited by 10 (1 self) – Add To MetaCart
-
Distributed Approaches to Triangulation and Embedding
- …A number of recent papers in the networking community study the distance matrix defined by the node-to-node latencies in the Internet and, in particular, provide a number of quite successful distributed approaches that embed this distance into a low-dimensional Euclidean space. In such algorithms it…
- Cited by 23 (4 self) – Add To MetaCart
-
Distance Estimation and Object Location via Rings of Neighbors
- …We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routing schemes [47], distance labeling [24], searchable small worlds [30], and triangulation-based distance estimation [33]. Fo…
- Cited by 37 (2 self) – Add To MetaCart
-
On Fixed-Parameter Tractability of Some Routing Problems (Extended Version)
- …Disjoint Paths is the problem of finding paths between given pairs of terminals in a graph such that no vertices are shared between paths. We analyze fixed-parameter tractability of several new Disjoint Paths-like routing problems motivated by congestion control in computer networks.…
- Add To MetaCart
-
Interleaving Schemes on Circulant Graphs
- …Interleaving schemes are used for error-correcting on a noisy channel. We consider interleaving schemes on infinite circulant graphs with two offsets 1 and d, with a goal to minimize the interleaving degree. Our constructions are minimal covers of the graph by copies of some subgraph S that can b…
- Cited by 1 (0 self) – Add To MetaCart
-
Oscillations with TCP-like Flow Control in Networks of Queues
- …We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the servers on the flow's path are empty and decreases the injection rate when some server is congested. We show that if each server…
- Cited by 6 (2 self) – Add To MetaCart
-
ABSTRACT Multi-Armed Bandits in Metric Spaces
- …In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is quite well understood, bandit problems with larg…
- Cited by 2 (0 self) – Add To MetaCart
-
Interleaving Schemes on Circulant Graphs with Two Offsets
- …Interleaving is used for error-correcting on a bursty noisy channel. Given a graph G describing the topology of the channel, we label the vertices of G so that each label-set is sufficiently sparse.…
- Add To MetaCart
-
Network Failure Detection and Graph Connectivity
- …1…
- Cited by 9 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
