Pitfalls in the design of distributed routing algorithms
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Introduction to algorithms
Design of inter-administrative domain routing protocols
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Incremental algorithms for minimal length paths
Journal of Algorithms
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Dynamic algorithms for shortest paths in planar graphs
Theoretical Computer Science
Routing in the Internet
Routing in communications networks
Routing in communications networks
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
Fully dynamic output bounded single source shortest path problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Incremental Algorithms for the Single-Source Shortest Path Problem
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Routing in multihop packet switching networks: Gb/s challenge
IEEE Network: The Magazine of Global Internetworking
New dynamic SPT algorithm based on a ball-and-string model
IEEE/ACM Transactions on Networking (TON)
BANANAS: an evolutionary framework for explicit and multipath routing in the internet
FDNA '03 Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture
Experimental analysis of dynamic all pairs shortest path algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Artificial Intelligence
Analysis of blocking probability for distributed lightpath establishment in WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Algorithms for precomputing constrained widest paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Incremental Nonlinear Dimensionality Reduction by Manifold Learning
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Efficient Dynamic Algorithm for Maintaining All-Pairs Shortest Paths in Stochastic Networks
IEEE Transactions on Computers
Incremental computation of shortest paths in semi-dynamic graphs using software components
Proceedings of the 44th annual Southeast regional conference
Experimental analysis of dynamic all pairs shortest path algorithms
ACM Transactions on Algorithms (TALG)
Anticipatory distributed packet filter configurations for carrier-grade IP networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Interface split routing for finer-grained traffic engineering
Performance Evaluation
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Computing all the best swap edges distributively
Journal of Parallel and Distributed Computing
Dynamic SPT update for multiple link state decrements in network routing
The Journal of Supercomputing
Adaptive Processing for Multi-user Stream Service over Web-Based Broadcasting Stream
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
Multiple path routing algorithm for IP networks
Computer Communications
Monitoring minimum cost paths on road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks
Engineering Applications of Artificial Intelligence
Novel topological framework for adaptive routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A low complexity shortest path tree restoration scheme for IP networks
IEEE Communications Letters
An efficient algorithm to enable path diversity in link state routing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed computation for swapping a failing edge
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Anticipatory distributed packet filter configuration for carrier-grade IP-Networks
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Computing all the best swap edges distributively
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Fast restoring gigabit wireless networks using a directional mesh architecture
Computer Communications
A novel neural network method for shortest path tree computation
Applied Soft Computing
Parallel dynamic spt update algorithm in OSPF
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
A loop-free shortest-path routing algorithm for dynamic networks
Theoretical Computer Science
| Hi-index | 0.01 |