Searching for authors named "Nikolaos Laoutaris" – sorted by Relevance.
-
Some notes on Markov Decision
- S, P, C#: i# . the set of (or decisions). Following an observation, an taken from the finite action 0, . . . , . A S [0, 1] is transition the P{j|i, k} of observing a transition to taking 3 Observation process can be time. We focus on discrete time
- Add To MetaCart
-
Adaptive Playout Strategies for Packet Video Receivers with Finite Buffer Capacity
- Due to random delay variations in current best effort networks, packet video applications rely on end-system buffering and playout adaptation to reduce the effects of disruptions on the required smooth stream presentation. To study the effect of buffering and playout adaptation, we present an analyt
- Cited by 1 (0 self) – Add To MetaCart
-
Intrastream Synchronization for Continuous Media Streams: A Survey of Playout Schedulers
- The transmission of real-time streams over best-effort networks has been an interesting research area for over a decade. An important objective of the research community has been to devise methods that cope with the variations of the network delay -- also called delay jitter -- that are an inherent
- Cited by 9 (1 self) – Add To MetaCart
-
Local utility aware content replication
- Abstract. A commonly employed abstraction for studying the object placement problem for the purpose of Internet content distribution is that of a distributed replication group. In this work the initial model of distributed replication group of Leff, Wolf, and Yu (IEEE TPDS ’93) is extended to the ca
- Cited by 6 (2 self) – Add To MetaCart
-
The Impact of Replacement Granularity on Video Caching
- In this paper the idea that large objects, such as video files, should not be cached or replaced in their entirety, but rather be partitioned in chunks and replacement decisions be applied at the chunk level is examined. It is shown, that a higher byte hit ratio (BHR) can be achieved through partial
- Cited by 1 (0 self) – Add To MetaCart
-
The LCD interconnection of LRU caches and its analysis
- In a multi-level cache such as those used for web caching, a hit at level l leads to the caching of the requested object in all intermediate caches on the reverse path (levels l − 1,...,1). This paper shows that a simple modification to this de facto behavior, in which only the l − 1 level cache get
- Cited by 3 (1 self) – Add To MetaCart
-
The Cache Inference Problem and its Application to Content and Request Routing (Extended Version
- Abstract — In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanisms they employ. Inference of such details could be instrumental for many other processes. For example, it could be
- Cited by 2 (0 self) – Add To MetaCart
-
Distributed placement of service facilities in largescale networks
- Abstract — The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated k-median
- Cited by 1 (0 self) – Add To MetaCart
-
Mistreatment in distributed caching groups: Causes and implications
- Abstract — Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node’s resources to others. We study
- Cited by 6 (4 self) – Add To MetaCart
-
The EGOIST Overlay Routing System
- A foundational issue underlying many overlay net-work applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e.,folding new arrivals into an existing overlay, and rewiring to cope with changing network conditions. Pre-vious work has considered the proble
- Add To MetaCart

