552 search results - page 93 / 111 » Routing complexity of faulty networks |
INFOCOM
2003
IEEE
14 years 25 days ago
2003
IEEE
— In [1], [2] it was noticed that sometimes it takes BGP a substantial amount of time and messages to converge and stabilize following the failure of some node in the Internet. I...
NOMS
2010
IEEE
13 years 6 months ago
2010
IEEE
—Application level traffic classification is one of the major issues in network monitoring and traffic engineering. In our previous study, we proposed a new traffic classificatio...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
NOMS
2006
IEEE
14 years 1 months ago
2006
IEEE
— While BGP routing datasets, consisting of raw routing data, are freely available and easy to obtain, extracting any useful information is tedious. Currently, researcher and net...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...