Using destination set grouping to improve the performance of window-controlled multipoint connections

Computer Communications

Volumn 19, Issue 8, 1996, Pages 723-736

  Cheung, Shun Yan ^a   Ammar, Mostafa H ^b  

^a EMORY UNIVERSITY   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Destination set grouping; Multicast communication; Multipoint connection

Indexed keywords

COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; NETWORK PROTOCOLS;

DESTINATION SET GROUPING; MULTICAST COMMUNICATION; MULTIPOINT CONNECTION; STATIC GROUPING HEURISTIC;

CONGESTION CONTROL (COMMUNICATION);

EID: 0030197753     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(96)01117-6     Document Type: Article

References (13)

1. J.L. Grange and M. Gien, Experiments in congestion control techniques, in Flow Control in Computer Networks, IFIP, North-Holland Company, 1979, pp. 211-234.
2. K.K. Ramakrishnan and R. Jain, A binary feedback scheme for congestion avoidance in computer networks, ACM Trans. Comp. Syst. 8 (May 1990) 158-181.
3. R. Jain, A timeout-based congestion control scheme for window flow-controlled networks, IEEE J. on Selected Areas in Communication, SAC-4 (October 1986) 1162-1167.
4. W. Bux and D. Grillo, Flow control in local-area networks of interconnected token rings, IEEE Trans. Commun. 33 (October 1985) 1058-1066.
5. R. Jain, A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks, Comp. Commun. Rev., 19 (October 1989) 56-71.
6. M.H. Ammar and L.R. Wu, Improving the throughput of point-to-multipoint ARQ protocols through destination set splitting, in IEEE INFOCOM'92, IEEE Communications Society, 1993, pp. 262-271.
7. F.K. Hwang and D.S. Richards, Steiner tree problems, Networks, 22 (January 1992) 55-89.
8. M.H. Ammar, S.Y. Cheung and C. Scoglio, Routing multipoint connections using virtual paths in an ATM network, Proc. INFO-COM'93, March 1993, IEEE Communications Society, pp. 98-105.
9. L. Kleinrock, Power and deterministic rules of thumb for probabilistic problems in computer communications, in Proc. Int. Conf. on Communications, June 1979, pp. 43.1.1-43.1.10.
10. R. Jain and K.K. Ramakrishnan, Congestion avoidance in computer networks with a connectionless network layer: Concepts, goals and methodology, in Proc. Computer Networking Symp., April 1988, pp. 134-143.
11. M.H. Ammar and S.B. Gershwin, Equivalence relations in queueing models of fork/join networks with blocking, Performance Evaluation, 10 (December 1989) 233-245.
12. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw Hill, 1968.
13. D.-M. Chiu and R. Jain, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks, Computer Networks and ISDN Systems, 17 (1989) 1-14.