1815 search results - page 58 / 363 » Path Planning for Network Performance |
INFOCOM
2000
IEEE
15 years 2 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...
102
click to vote
CLADE
2004
IEEE
15 years 1 months ago
2004
IEEE
Different schemes for large scale networks hosting distributed applications have been recently adopted for network path marking based on adaptive behavior of swarm-based agents. T...
LCN
2006
IEEE
15 years 3 months ago
2006
IEEE
Today’s intra-domain protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path vectors. Taking adva...
COMCOM
2007
14 years 9 months ago
2007
Minimum interference routing schemes are good options for achieving fewer working-path request rejections. They improve the vast majority of the current QoS routing proposals. How...
JNW
2006
14 years 9 months ago
2006
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...