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...
—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...
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...
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, ...
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...