Sciweavers

615 search results - page 61 / 123
» Relatively inertial delays
Sort
View
QUESTA
2008
96views more  QUESTA 2008»
14 years 11 months ago
Reduction of a polling network to a single node
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
Paul Beekhuizen, Dee Denteneer, Jacques Resing
INFOCOM
2010
IEEE
14 years 10 months ago
Two Samples are Enough: Opportunistic Flow-level Latency Estimation using NetFlow
—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the ...
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
FORMATS
2010
Springer
14 years 10 months ago
Expected Reachability-Time Games
In an expected reachability-time game (ERTG) two players, Min and Max, move a token along the transitions of a probabilistic timed automaton, so as to minimise and maximise, respec...
Vojtech Forejt, Marta Z. Kwiatkowska, Gethin Norma...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 9 months ago
Load Aware Broadcast in Mobile Ad Hoc Networks
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
Md. Tanvir Al Amin, Sukarna Barua, Sudip Vhaduri, ...
ISQED
2011
IEEE
309views Hardware» more  ISQED 2011»
14 years 3 months ago
Modeling and analyzing NBTI in the presence of Process Variation
With continuous scaling of transistors in each technology generation, NBTI and Process Variation (PV) have become very important silicon reliability problems for the microprocesso...
Taniya Siddiqua, Sudhanva Gurumurthi, Mircea R. St...