Results 1  10
of
321,911
Improving the Average Delay of Sorting
, 2007
"... In previous work we have introduced an averagecase measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the moment when the results are ready at the output gates – and analysed this complexity measure for prefix computations. He ..."
Abstract
 Add to MetaCart
In previous work we have introduced an averagecase measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the moment when the results are ready at the output gates – and analysed this complexity measure for prefix computations
Minimum Average Delay of Routing Trees
, 2016
"... The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T. In the case where the vertices of G are mapped into the leaves of the host tree T the unde ..."
Abstract
 Add to MetaCart
problems. In this report we study the less investigate measure i.e. tree length, which is a representative for average edge dilation (communication delay) measure and also for average edge congestion measure. We show that finding a routing tree T for an arbitrary graph G with minimum tree length is an NP
Fair Efficiency, or Low Average Delay without Starvation
 in Proceedings International Conference on Computer Communications and Networks (ICCCN
, 2007
"... Abstract—File transfer, web download, and many other applications are primarily interested in minimal delay achievable for their messages. In this paper, we investigate allocating the bottleneck link capacity to transmit messages efficiently but fairly. While SRPT (Shortest Remaining Processing Time ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Time) is an optimally efficient algorithm that minimizes average delay of messages, large messages might starve under SRPT in heavy load conditions. PS (Processor Sharing) and ViFi (Virtual Finish Time First) are fair but yield higher average delays than under SRPT. We explore the class of fair
Transmission Policies for Time Varying Channels with Average Delay Constraints
, 1999
"... We consider the problem of transferring data with a fixed level of reliabilityover a discrete time channel whose characteristics vary with time, with a constraint on the average delay suffered by the data and a constraint on peak transmitter power. We assume that the channel state is known to the ..."
Abstract

Cited by 86 (1 self)
 Add to MetaCart
We consider the problem of transferring data with a fixed level of reliabilityover a discrete time channel whose characteristics vary with time, with a constraint on the average delay suffered by the data and a constraint on peak transmitter power. We assume that the channel state is known
Understanding Retiming through Maximum AverageDelay Cycles
 Mathematical Systems Theory
, 1994
"... A synchronous circuit built of functional elements and registers is a simple implementation of the semisystolic model of computation that can be used to design parallel algorithms. Retiming is a wellknown technique that transforms a given circuit into a faster circuit by relocating its registers. W ..."
Abstract

Cited by 38 (9 self)
 Add to MetaCart
. We give tight bounds on the minimum clock period that can be achieved by retiming a synchronous circuit. These bounds are expressed in terms of the maximum delaytoregister ratio of the cycles in the circuit graph and the maximum propagation delay d max of the circuit components. Our bounds do
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1112 (21 self)
 Add to MetaCart
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or
Average delay in queues with nonstationary Poisson arrivals
 J. Appl. Prob
, 1978
"...  iøt.~ ~~~~~~ ~ ~~~~F —~ ~.—. — % _• •) 1~ ~ itø~~~ ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
 iøt.~ ~~~~~~ ~ ~~~~F —~ ~.—. — % _• •) 1~ ~ itø~~~
Random Early Detection Gateways for Congestion Avoidance.
 IEEELACM Transactions on Networking,
, 1993
"... AbstractThis paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract

Cited by 2716 (31 self)
 Add to MetaCart
. However, it would clearly be undesirable to have large queues (possibly on the order of a delay bandwidth product) that were full much of the time; this would significantly increase the average delay in the network. Therefore, with increasingly highspeed networks, it is increasingly important to have
On the Average Delay for Routing Subject to Independent Deflections
"... AbstractConsider a packet walking along a directed graph with each node having two edges directed out. The packet is headed towards one of N destinations, chosen according to a probability distribution p. At each step, the packet is forced to use a nonpreferred edge with some probability q, indepe ..."
Abstract
 Add to MetaCart
AbstractConsider a packet walking along a directed graph with each node having two edges directed out. The packet is headed towards one of N destinations, chosen according to a probability distribution p. At each step, the packet is forced to use a nonpreferred edge with some probability q, independently of past events. Using information theory and sequential analysis, it is shown that the mean number of steps required by the packet to reach the destination is, roughly, at least H ( p ) / ( l h ( q ) ) , where h is the binary entropy function and H ( p ) is the entropy (base two) of p . This lower bound is shown to be asymptotically achievable in the case the packet always begins at a fixed node. Also considered is the maximum, over all pairs of nodes in a graph, of the mean transit time from one node to the other. The work is motivated by the search for graphs which work well in conjunction with deflection routing in communication networks.
Stojmenovic I. On generating Btrees with constant average delay and
 in lexicographic order. Inform Process Lett
, 1994
"... Gupta, Lee and Wong described algorithms for generating 23 trees and Btrees and left as open problems whether algorithms exist that generate them in lexicographic order, and whether it is possible to generate 23 trees or Btrees in constant average delay, exclusive of the output. In this note we ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Gupta, Lee and Wong described algorithms for generating 23 trees and Btrees and left as open problems whether algorithms exist that generate them in lexicographic order, and whether it is possible to generate 23 trees or Btrees in constant average delay, exclusive of the output. In this note we
Results 1  10
of
321,911