Results 1  10
of
1,563,610
How bad is selfish routing?
 JOURNAL OF THE ACM
, 2002
"... We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route t ..."
Abstract

Cited by 652 (27 self)
 Add to MetaCart
. In this article, we quantify the degradation in network performance due to unregulated traffic. We prove that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject
A HighThroughput Path Metric for MultiHop Wireless Routing
, 2003
"... This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination. The E ..."
Abstract

Cited by 1080 (5 self)
 Add to MetaCart
This paper presents the expected transmission count metric (ETX), which finds highthroughput paths on multihop wireless networks. ETX minimizes the expected total number of packet transmissions (including retransmissions) required to successfully deliver a packet to the ultimate destination
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 374 (3 self)
 Add to MetaCart
 E lgV) algorithm for determining an equivalent retimed circuit with the smallest possible clock period. We show that the problem of determining an equivalent retimed circuit with minimum state (total number of registers) is polynomialtime solvable. This result yields a polynomialtime optimal
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Latency
, 2009
"... Duration analysis is an analytical tool for timetoevent data that has been borrowed from medicine and engineering to be applied by econometricians to investigate typical economic and finance problems. In applications to credit data, time to the predetermined maturity events have been treated as c ..."
Abstract
 Add to MetaCart
as censored observations for the events with stochastic latency. A methodology, motivated by the cure rate model framework, is developed in this paper to appropriately analyse a set of mutually exclusive terminal events where at least one event may have a predetermined latency. The methodology is applied to a
Minimum Latency Submodular Cover∗
, 2013
"... We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric (V, d) with source r ∈ V and m monotone submodular functions f1, f2,..., fm: 2V → [0, 1]. The goal is to find a path originating at r that minimizes the total cover time of all functions. This generalizes wells ..."
Abstract
 Add to MetaCart
We study the Minimum Latency Submodular Cover problem (MLSC), which consists of a metric (V, d) with source r ∈ V and m monotone submodular functions f1, f2,..., fm: 2V → [0, 1]. The goal is to find a path originating at r that minimizes the total cover time of all functions. This generalizes well
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
A Variation of Minimum Latency Problem
"... In this paper we study the variation of the minimum latency problem(MLP) [2]. The MLP is to find a walk tour on the graph G(V, E) with a distance matrix di,j. Where di,j indicate the distance between vi and vj. Let ℓ(vi) is the latency length of vi, defined to be the distance traveled before first v ..."
Abstract
 Add to MetaCart
In this paper we study the variation of the minimum latency problem(MLP) [2]. The MLP is to find a walk tour on the graph G(V, E) with a distance matrix di,j. Where di,j indicate the distance between vi and vj. Let ℓ(vi) is the latency length of vi, defined to be the distance traveled before first
The price of anarchy is independent of the network topology
 JOURNAL OF COMPUTER AND SYSTEM SCIENCES
, 2002
"... We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experienced by network traffic on an edge of the network is a function of the edge congestion, and network users are assumed to ..."
Abstract

Cited by 213 (16 self)
 Add to MetaCart
network performance. We quantify this degradation in network performance via the price of anarchy, the worstpossible ratio between the total latency of a Nash equilibrium and of an optimal routing of the traffic. We show the price of anarchy is determined only by the simplest of networks. Specifically
An Improved Approximation Ratio for the Minimum Latency Problem
 Mathematical Programming
, 1996
"... Given a tour visiting n points in a metric space, the latency of one of these points p is the distance traveled in the tour before reaching p. The minimum latency problem asks for a tour passing through n given points for which the total latency of the n points is minimum; in effect, we are seekin ..."
Abstract

Cited by 88 (2 self)
 Add to MetaCart
Given a tour visiting n points in a metric space, the latency of one of these points p is the distance traveled in the tour before reaching p. The minimum latency problem asks for a tour passing through n given points for which the total latency of the n points is minimum; in effect, we
Results 1  10
of
1,563,610