Sciweavers

2497 search results - page 65 / 500
» Requirements for models of achievable routing
Sort
View
IAT
2005
IEEE
15 years 7 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
15 years 5 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
ANCS
2011
ACM
14 years 1 months ago
A Scalability Study of Enterprise Network Architectures
The largest enterprise networks already contain hundreds of thousands of hosts. Enterprise networks are composed of Ethernet subnets interconnected by IP routers. These routers re...
Brent Stephens, Alan L. Cox, Scott Rixner, T. S. E...
DAC
1997
ACM
15 years 5 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao
TMC
2008
138views more  TMC 2008»
15 years 1 months ago
A Self-Repairing Tree Topology Enabling Content-Based Routing in Mobile Ad Hoc Networks
Content-based routing (CBR) provides a powerful and flexible foundation for distributed applications. Its communication model, based on implicit addressing, fosters decoupling amon...
Luca Mottola, Gianpaolo Cugola, Gian Pietro Picco