A Hierarchical Routing and Flow Control Policy (HRFC) for Packet Switched Networks
IEEE Transactions on Computers
A new probabilistic routing algorithm for packet-switched computer networks
AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
Multiple allocation hub-and-spoke network design under hub congestion
Computers and Operations Research
An analytic modelling approach for network routing algorithms that use "ant-like" mobile agents
Computer Networks: The International Journal of Computer and Telecommunications Networking
Do next generation networks need path diversity?
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Demand-oblivious routing: distributed vs. centralized approaches
INFOCOM'10 Proceedings of the 29th conference on Information communications
A parallel algorithm for nonlinear multi-commodity network flow problem
ICS'06 Proceedings of the 10th WSEAS international conference on Systems
Analysis of application-aware on-chip routing under traffic uncertainty
NOCS '11 Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip
A Unifying Polyhedral Approximation Framework for Convex Optimization
SIAM Journal on Optimization
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Uniqueness of the solution for optimal static routing in open BCMP queueing networks
Mathematical and Computer Modelling: An International Journal
Performance: Traffic routing in a computer network
Computer Communications
A neural network method for minimum delay routing in packet-switched networks
Computer Communications
Finiteness in restricted simplicial decomposition
Operations Research Letters
| Hi-index | 14.98 |
The problem of finding optimal routes in a packet-switched computer network can be formulated as a nonlinear multicommodity flow problem.