A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Study of interoperability between EFCI and ER switch mechanisms for ABR traffic in an ATM network
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Time scale analysis of explicit rate allocation in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
| Hi-index | 0.00 |
We study both the correctness and performance of the source/destination protocol of the available bit rate (ABR) service in asynchronous transfer mode (ATM) networks. Although the basic source/destination protocol for congestion management is relatively simple, the protocol specification has to cope with several "real-world" cases such as failures and delayed/lost feedback which may introduce complexity. Rigorous proofs of the correct functioning of the protocol based on a formal specification is necessary. We use a formal extended finite state machine (EFSM) model to show that the ABR source/destination protocol is free of live-locks, so that under all conditions both resource management (RM) and data cells will be transmitted. We also show that the network options of explicit forward congestion indication (EFCI) and explicit rate (ER) interoperate correctly. We use the understanding of the informal English description of the source/destination behavior and of our EFSM model to derive conditions that ensure that the source transmission rate is stable in the presence of delayed or lost feedback RM cells, especially under the operation of a source rule that requires the reduction of the source rate under these conditions. We arrive at bounds on the number of consecutive RM cell losses tolerated while the rate remains stable. We also provide a worst-case analysis of the delay in turning around RM cells at the destination station and the worst-case inter-departure time of forward RM cells from the source.