Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,534
The Duality of Maximum Delay and Maximum Backlog
"... Abstract—In this paper, we will establish a duality be-tween maximum delay and maximum backlog in a single queue network. Min-plus algebra will be employed to devise the duality. In min-plus algebra, the maximum backlog is represented by the scalar projection of ac-cumulated input traffic curve onto ..."
Abstract
- Add to MetaCart
Abstract—In this paper, we will establish a duality be-tween maximum delay and maximum backlog in a single queue network. Min-plus algebra will be employed to devise the duality. In min-plus algebra, the maximum backlog is represented by the scalar projection of ac-cumulated input traffic curve
MAXIMUM DELAYED RESPONSE PERFORMANCE IN SQUIRREL MONKEYS AS A FUNCTION OF DELAY CONDITIONS
"... Maximum delayed response performance in squirrel monkeys as ..."
ASYMPTOTIC BEHAVIOR OF SOLUTIONS TO MINIMUM-MAXIMUM DELAY RECURRENCES OF
"... Abstract. In this paper, we consider asymptotic behavior of solutions to minimum-maximum delay recurrences of higher-order. Some results are proven and open questions posed regarding convergence, in terms of the array of delays. 1. ..."
Abstract
- Add to MetaCart
Abstract. In this paper, we consider asymptotic behavior of solutions to minimum-maximum delay recurrences of higher-order. Some results are proven and open questions posed regarding convergence, in terms of the array of delays. 1.
Online scheduling to minimize the maximum delay factor
- IN SODA 09: PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 2009
"... In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcasting a page can satisfy multiple outstanding requests for that page. We consider online scheduling of requests when they h ..."
Abstract
-
Cited by 12 (4 self)
- Add to MetaCart
they have deadlines. Unlike previous models, which mainly consider the objective of maximizing throughput while respecting deadlines, here we focus on scheduling all the given requests with the goal of minimizing the maximum delay factor. The delay factor of a schedule is defined to be the minimum α ≥ 1
Maximum Delay Computation for Interdomain Path Selection
"... One important problem when deploying interdomain path selec-tion is advertising metrics that hold for a long period of time. In this paper we propose a method to aid interdomain path selection mech-anisms in that sense. We present a means of computing a bound on the end-to-end delay of traversing a ..."
Abstract
- Add to MetaCart
by each AS in the process of interdomain path selection. We show how the maximum delay value is obtained for an interdomain bandwidth demand and we propose an exact method and a numerical approxi-mation method for computing it, neither of which rely on a complex monitoring infrastructure. Simulations
Space-time block codes from orthogonal designs
- IEEE Trans. Inform. Theory
, 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract
-
Cited by 1524 (42 self)
- Add to MetaCart
of the space–time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space–time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple
Topology Control of Multihop Wireless Networks using Transmit Power Adjustment
, 2000
"... We consider the problem of adjusting the transmit powers of nodes in a multihop wireless network (also called an ad hoc network) to create a desired topology. We formulate it as a constrained optimization problem with two constraints- connectivity and biconnectivity, and one optimization objective- ..."
Abstract
-
Cited by 688 (3 self)
- Add to MetaCart
- maximum power used. We present two centralized algorithms for use in static networks, and prove their optimality. For mobile networks, we present two distributed heuristics that adaptively adjust node transmit powers in response to topological changes and attempt to maintain a connected topology using
Random Early Detection Gateways for Congestion Avoidance.
- IEEELACM Transactions on Networking,
, 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched 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
-speed ne!works with connections with large delay bandwidth products. gateways are likely to be designed with correspondingly large maximum queues to acccomodate transient congestion. In the current Internet, the TCP transport protocol detects congestion only after a packet has been dropped al the gateway
Sticky Information versus Sticky Prices: a Proposal to Replace the New Keynesian Phillips Curve
, 2002
"... This paper examines a model of dynamic price adjustment based on the assumption that information disseminates slowly throughout the population. Compared with the commonly used sticky-price model, this sticky-information model displays three related properties that are more consistent with accepted v ..."
Abstract
-
Cited by 489 (25 self)
- Add to MetaCart
views about the effects of monetary policy. First, disinflations are always contractionary (although announced disinflations are less contractionary than surprise ones). Second, monetary policy shocks have their maximum impact on inflation with a substantial delay. Third, the change in inflation
Provision of Maximum Delay Guarantee at Low Energy in a Multi-user Environment
"... Abstract—In this work a simple scheduling scheme is proposed for wireless sensor networks in presence of a maximum tolerable delay constraint. The scheduler performs the dual task of schedul-ing the users experiencing high channel gains to minimize the energy consumption while at the same time, it t ..."
Abstract
- Add to MetaCart
Abstract—In this work a simple scheduling scheme is proposed for wireless sensor networks in presence of a maximum tolerable delay constraint. The scheduler performs the dual task of schedul-ing the users experiencing high channel gains to minimize the energy consumption while at the same time
Results 1 - 10
of
4,534
