Sciweavers

846 search results - page 125 / 170
» Agent network topology and complexity
Sort
View
APLAS
2007
ACM
15 years 1 months ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...
MOBIHOC
2006
ACM
15 years 9 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
CONEXT
2009
ACM
14 years 10 months ago
MDCube: a high performance network structure for modular data center interconnection
Shipping-container-based data centers have been introduced as building blocks for constructing mega-data centers. However, it is a challenge on how to interconnect those container...
Haitao Wu, Guohan Lu, Dan Li, Chuanxiong Guo, Yong...
MOBIHOC
2008
ACM
15 years 9 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
SIGMETRICS
2004
ACM
105views Hardware» more  SIGMETRICS 2004»
15 years 3 months ago
A model of BGP routing for network engineering
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
Nick Feamster, Jared Winick, Jennifer Rexford