4.8k citations · 5.1k across the 59 of their papers we have counts for
19 papers · 1 filter
Distributed Cooperative Caching for VoD with Geographic Constraints
Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci
We consider caching of video streams in a cellular network in which each base station is equipped with a cache. Video streams are partitioned into multiple substreams and the goal…
Multi-Path Alpha-Fair Resource Allocation at Scale in Distributed Software Defined Networks
Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay +1
The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve o…
Lower Bounds for the Fair Resource Allocation Problem
Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay +1
The -fair resource allocation problem has received remarkable attention and has been studied in numerous application fields. Several algorithms have been proposed in the context…
Real-Time Fair Resource Allocation in Distributed Software Defined Networks
Zaid Allybokus, Konstantin Avrachenkov, Jérémie Leguay +1
The performance of computer networks relies on how bandwidth is shared among different flows. Fair resource allocation is a challenging problem particularly when the flows evolve o…
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci
We consider caching in cellular networks in which each base station is equipped with a cache that can store a limited number of files. The popularity of the files is known and the…
Optimization of Caching Devices with Geometric Constraints
Konstantin Avrachenkov, Xinwei Bai, Jasper Goseling
It has been recently advocated that in large communication systems it is beneficial both for the users and for the network as a whole to store content closer to users. One particul…
Infinite Horizon Optimal Impulsive Control Theory with Application to Internet Congestion Control
Konstantin Avrachenkov, Oussama Habachi, Alexei Piunovskiy +1
We develop Bellman equation based approach for infinite time horizon optimal impulsive control problems. Both discounted and time average criteria are considered. We establish very…
Coding for Caches in the Plane
Eitan Altman, Konstantin Avrachenkov, Jasper Goseling
We consider wireless caches located in the plane according to general point process and specialize the results for the homogeneous Poisson process. A large data file is stored at t…
Congestion Control of TCP Flows in Internet Routers by Means of Index Policy
Josu Doncel, Urtzi Ayesta, Konstantine Avrachenkov +1
In this paper we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction betwee…
CCN Interest Forwarding Strategy as Multi-Armed Bandit Model with Delays
Konstantin Avrachenkov, Peter Jacko
We consider Content Centric Network (CCN) interest forwarding problem as a Multi-Armed Bandit (MAB) problem with delays. We investigate the transient behaviour of the $\eps$-greedy…
Optimal Threshold Control by the Robots of Web Search Engines with Obsolescence of Documents
Konstantin Avrachenkov, Alexander Dudin, Valentina Klimenok +2
A typical web search engine consists of three principal parts: crawling engine, indexing engine, and searching engine. The present work aims to optimize the performance of the craw…
Generalized Optimization Framework for Graph-based Semi-supervised Learning
Konstantin Avrachenkov, Paulo Gonçalves, Alexey Mishenin +1
We develop a generalized optimization framework for graph-based semi-supervised learning. The framework gives as particular cases the Standard Laplacian, Normalized Laplacian and P…
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
Konstantin Avrachenkov, Nelly Litvak, Danil A. Nemirovsky +2
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estimati…
Stability Analysis of GI/G/c/K Retrial Queue with Constant Retrial Rate
Konstantin Avrachenkov, Evsey Morozov
We consider a GI/G/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has identical serve…
Distribution of PageRank Mass Among Principle Components of the Web
Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham
We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank…
Quasi-stationary distributions as centrality measures of reducible graphs
Konstantin Avrachenkov, Vivek Borkar, Danil Nemirovsky
Random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visi…
Closed form solutions for symmetric water filling games
Eitan Altman, Konstantin Avrachenkov, Andrey Garnaev
We study power control in optimization and game frameworks. In the optimization framework there is a single decision maker who assigns network resources and in the game framework u…
Optimal Choice of Threshold in Two Level Processor Sharing
Konstantin Avrachenkov, Patrick Brown, Natalia Osipova
We analyze the Two Level Processor Sharing (TLPS) scheduling discipline with the hyper-exponential job size distribution and with the Poisson arrival process. TLPS is a convenient…
Convergence and Optimal Buffer Sizing for Window Based AIMD Congestion Control
Konstantin Avrachenkov, Urtzi Ayesta, Alexei Piunovskiy
We study the interaction between the AIMD (Additive Increase Multiplicative Decrease) congestion control and a bottleneck router with Drop Tail buffer. We consider the problem in t…