Results 1  10
of
163,453
Approximation Algorithms for Maximum Latency and Partial Cycle Cover
, 2008
"... We present approximation algorithms for four variations of the maximum latency problem. We consider symmetric graphs and asymmetric graphs and both with general edge weights or weights satisfying the triangle inequality. Moreover, in each variation the starting point of the tour may either be given ..."
Abstract
 Add to MetaCart
We present approximation algorithms for four variations of the maximum latency problem. We consider symmetric graphs and asymmetric graphs and both with general edge weights or weights satisfying the triangle inequality. Moreover, in each variation the starting point of the tour may either be given
Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem
 In Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO
, 2004
"... We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NPhard, even when all arc latency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a desira ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NPhard, even when all arc latency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a
Computing Alternate Multicast Trees with Maximum Latency Guarantee
"... Abstract—The growing demand for online media content delivery and multiplayer gaming is expected to increase the amount of multicast service requests in both public and private networks. Careful traffic engineering of multicast service requests is becoming increasingly essential, as establishing th ..."
Abstract
 Add to MetaCart
approach is the timely construction of the set of alternate trees for every given root and destination set. An algorithm is proposed to compute multiple suboptimal tree candidates with a guaranteed upper bound on the maximum endtoend transmission latency. The algorithm builds on the widely used K
Online detection of vocal listener responses with maximum latency constraints
 In Proceedings ICASSP 2011
, 2011
"... When human listeners utter Listener Responses (e.g. backchannels or acknowledgments) such as ‘yeah ’ and ‘mmhmm’, interlocutors commonly continue to speak or resume their speech even before the listener has finished his/her response. This type of speech interactivity results in frequent speech over ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
as Listener Responses. We show that it is possible to detect vocal Listener Responses using maximum latency thresholds of 100500 ms, thereby obtaining equal error rates ranging from 34% to 28 % by using an energy based voice activity detector. Index Terms — Speech processing, speech analysis 1.
Stronger Bounds on Braess’s Paradox and the Maximum Latency of Selfish Routing
, 2009
"... We give several new upper and lower bounds on the worstcase severity of Braess’s Paradox and the price of anarchy of selfish routing with respect to the maximum latency objective. In singlecommodity networks with unrestricted latency functions, we prove that this worstcase price of anarchy is exa ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We give several new upper and lower bounds on the worstcase severity of Braess’s Paradox and the price of anarchy of selfish routing with respect to the maximum latency objective. In singlecommodity networks with unrestricted latency functions, we prove that this worstcase price of anarchy
Scalable Application Layer Multicast
, 2002
"... We describe a new scalable applicationlayer multicast protocol, specifically designed for lowbandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the applicationlayer multicast peers and can support a number of different data deliv ..."
Abstract

Cited by 719 (21 self)
 Add to MetaCart
sites. In our experiments, averagegroup members established and maintained lowlatency paths and incurred a maximum packet loss rate of less than 1 % as members randomly joined and left the multicast group. The average control overhead during our experiments was less than 1 Kbps for groups of size 100.
CostAware WWW Proxy Caching Algorithms
 IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and nonparameterized fash ..."
Abstract

Cited by 544 (6 self)
 Add to MetaCart
Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non
UNet: A UserLevel Network Interface for Parallel and Distributed Computing
 In Fifteenth ACM Symposium on Operating System Principles
, 1995
"... The UNet communication architecture provides processes with a virtual view of a network interface to enable userlevel access to highspeed communication devices. The architecture, implemented on standard workstations using offtheshelf ATM communication hardware, removes the kernel from the communi ..."
Abstract

Cited by 596 (17 self)
 Add to MetaCart
, as well as novel abstractions like Active Messages can be implemented efficiently. A UNet prototype on an 8node ATM cluster of standard workstations offers 65 microseconds roundtrip latency and 15 Mbytes/sec bandwidth. It achieves TCP performance at maximum network bandwidth and demonstrates
Memory Consistency and Event Ordering in Scalable SharedMemory Multiprocessors
 In Proceedings of the 17th Annual International Symposium on Computer Architecture
, 1990
"... Scalable sharedmemory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory and the f ..."
Abstract

Cited by 735 (18 self)
 Add to MetaCart
Scalable sharedmemory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory
Vivaldi: A Decentralized Network Coordinate System
 In SIGCOMM
, 2004
"... Largescale Internet applications can benefit from an ability to predict roundtrip times to other hosts without having to contact them first. Explicit measurements are often unattractive because the cost of measurement can outweigh the benefits of exploiting proximity information. Vivaldi is a simp ..."
Abstract

Cited by 593 (5 self)
 Add to MetaCart
simple, lightweight algorithm that assigns synthetic coordinates to hosts such that the distance between the coordinates of two hosts accurately predicts the communication latency between the hosts.
Results 1  10
of
163,453