Sciweavers

1691 search results - page 36 / 339
» The Delayed k-Server Problem
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Feedforward SDL Constructions of Output-Buffered Multiplexers and Switches with Variable Length Bursts
Abstract— In this paper, we study the problem of exact emulation of two types of optical queues: (i) N-to-1 output-buffered multiplexers with variable length bursts, and (ii) N Ã...
Yi-Ting Chen, Cheng-Shang Chang, Jay Cheng, Duan-S...
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
14 years 29 days ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
ENTCS
2008
115views more  ENTCS 2008»
13 years 8 months ago
Time Separation of Events: An Inverse Method
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
Emmanuelle Encrenaz, Laurent Fribourg
JSAC
2011
83views more  JSAC 2011»
12 years 11 months ago
Trading Rate for Balanced Queue Lengths for Network Delay Minimization
—We consider a communication channel with two transmitters and one receiver, with an underlying rate region which is approximated as a general pentagon. Different from the Gaussi...
Jing Yang, Sennur Ulukus
ACSAC
2007
IEEE
14 years 24 days ago
Efficient Detection of Delay-Constrained Relay Nodes
Relay nodes are a potential threat to networks since they are used in many malicious situations like stepping stone attacks, botnet communication, peer-to-peer streaming etc. Quic...
Baris Coskun, Nasir D. Memon