Sciweavers

5056 search results - page 652 / 1012
» Network Coding Theory
Sort
View
TASE
2008
IEEE
15 years 6 months ago
Modeling and Supervisory Control of Railway Networks Using Petri Nets
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
Alessandro Giua, Carla Seatzu
IOR
2007
89views more  IOR 2007»
15 years 6 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
COMCOM
1998
102views more  COMCOM 1998»
15 years 6 months ago
Preferred link based delay-constrained least-cost routing in wide area networks
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
INFOCOM
2010
IEEE
15 years 5 months ago
Maximum Damage Malware Attack in Mobile Wireless Networks
—Malware attacks constitute a serious security risk that threatens to slow down the large scale proliferation of wireless applications. As a first step towards thwarting this se...
M. H. R. Khouzani, Saswati Sarkar, Eitan Altman
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
13 years 9 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield