Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
SIAM Journal on Discrete Mathematics
The Case for Resilient Overlay Networks
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Stability of multi-path dual congestion control algorithms
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Stability of multi-path dual congestion control algorithms
IEEE/ACM Transactions on Networking (TON)
Transport-independent fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We prove a global stability result for a fluid approximation of a class of Internet-like communications networks operating a form of congestion control with routing. The network consists of an arbitrary interconnection of sources and links with negligible propagation delays. The model here allows for arbitrary strictly concave utility functions and the presence of dynamics at both sources and links.