Sciweavers

806 search results - page 71 / 162
» Lower Bounds on Correction Networks
Sort
View
CCS
2008
ACM
15 years 8 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
157
Voted
JPDC
2007
173views more  JPDC 2007»
15 years 6 months ago
Probabilistic analysis on mesh network fault tolerance
Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of wor...
Jianer Chen, Gaocai Wang, Chuang Lin, Tao Wang, Gu...
INFOCOM
2008
IEEE
16 years 15 days ago
Maximizing Restorable Throughput in MPLS Networks
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
Reuven Cohen, Gabi Nakibly
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 6 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 3 months ago
Two-Way Transmission Capacity of Wireless Ad-hoc Networks
The transmission capacity of an ad-hoc network is the maximum density of active transmitters in an unit area, given an outage constraint at each receiver for a fixed rate of transm...
Rahul Vaze, Kien T. Truong, Steven Weber, Robert W...