478 search results - page 52 / 96 » Diameter and Center Computations in Networks |
109
click to vote
PCRCW
1997
Springer
15 years 4 months ago
1997
Springer
In recent years, theChaos Project at theUniversityofWashingtonhas analyzed and simulated a dozen routing algorithms. Three new routing algorithms have been invented; of these, the...
121
click to vote
POLICY
2004
Springer
15 years 5 months ago
2004
Springer
As a consequence of the current trend towards consolidating computing, storage and networking infrastructures into large centralized data centers, applications compete for shared ...
MOBIHOC
2003
ACM
15 years 11 months ago
2003
ACM
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...
102
click to vote
WISEC
2010
ACM
15 years 6 months ago
2010
ACM
As privacy moves to the center of attention in networked systems, and the need for trust remains a necessity, an important question arises: How do we reconcile the two seemingly c...
ICAISC
2004
Springer
15 years 5 months ago
2004
Springer
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...