Sciweavers

597 search results - page 66 / 120
» Homomorphisms of random paths
Sort
View
BIOADIT
2006
Springer
14 years 1 months ago
Resilient Multi-path Routing Based on a Biological Attractor Selection Scheme
In this paper we propose a resilient scheme for multi-path routing using a biologically-inspired attractor selection method. The main advantage of this approach is that it is highl...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
LCN
2000
IEEE
14 years 1 months ago
Load-Balanced Routing and Scheduling for Real-Time Traffic in Packet-Switch Networks
Future computer networks are expected to carry bursty real-time traffic with stringent time-delay requirements. Popular shortest-path routing protocols have the disadvantage of ca...
Sangman Bak, Albert Mo Kim Cheng, Jorge Arturo Cob...
WSC
1997
13 years 11 months ago
On the Efficiency of the Splitting and Roulette Approach for Sensitivity Analysis
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
Viatcheslav B. Melas
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 10 months ago
A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications
Abstract—In wireless networks with random node distribution, the underlying point process model and the channel fading process are usually considered separately. A unified frame...
Martin Haenggi
IPPS
2008
IEEE
14 years 4 months ago
On performance bottleneck of anonymous communication networks
Although a significant amount of effort has been directed at discovering attacks against anonymity communication networks and developing countermeasures to those attacks, there i...
Ryan Pries, Wei Yu, Steve Graham, Xinwen Fu