Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A versatile model for predicting the performance of deflection-routing networks
Performance Evaluation - Special issue on performance modeling of high speed telecommunication systems
Analytical evaluation of improved access techniques in deflection routing networks
IEEE/ACM Transactions on Networking (TON)
Iterative approach to optimizing convergence routing priorities
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Bounds on Maximum Delay in Networks with Deflection Routing
IEEE Transactions on Parallel and Distributed Systems
A Mixed Deflection and Convergence Routing Algorithm: Design and Performance
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Local fairness in general-topology networks with convergence routing
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
| Hi-index | 0.00 |
Routing in all optical networks is an important issue. Deflection routing provides a high throughput but suffers from unbounded transportation time. Convergence routing provides ending guarantee to packets entering the network. We focus on the Eulerian routing technique (convergence routing based on an Eulerian directed cycle), and several improvements which increase the throughput. In this paper, we show that these routing algorithms are very unstable when the traffic occurs by bursts. Thus an admission control is needed to maintain a high throughput.