552 search results - page 40 / 111 » Routing complexity of faulty networks |
GECCO
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
ISCAPDCS
2003
13 years 9 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Signi cant eort has been invested recently to accelerate handover operations in a next generation mobile Internet. Corresponding works for developing e cient mobile multicast man...
JSAC
2006
13 years 7 months ago
2006
A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new con...
PDP
2008
IEEE
14 years 2 months ago
2008
IEEE
The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic...