Fairness of optimal routing in virtual circuit data networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 1989, Pages 119-126

  Tsai, Wei K ^a   Cantrell, Pierce E ^a   Goos, Jeffrey ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARPANET; AVERAGE PACKET DELAYS; DATA NETWORK; FAIRNESS MEASURES; INTEGRAL FORM; MULTIPLE-PATH; NUMERICAL STUDIES; OBJECTIVE FUNCTIONS; ONLINE OPTIMIZATION; OPTIMAL ROUTING; OPTIMAL ROUTING ALGORITHM; PACKET DELAY; ROUTINGS; VIRTUAL CIRCUIT;

ALGORITHMS; NETWORK ROUTING; OPTIMIZATION; PACKET NETWORKS; ROUTING ALGORITHMS; DATA TRANSMISSION--PACKET SWITCHING;

INTEGRAL EQUATIONS; COMPUTER NETWORKS;

ARPANET ROUTING ALGORITHM; FAIRNESS MEASURES; ON LINE OPTIMIZATION; OPTIMAL ROUTING FAIRNESS; VIRTUAL CIRCUIT DATA NETWORKS;

EID: 0024646301     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.1989.101444     Document Type: Conference Paper

References (19)

1. A. S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.
2. M. Schwartz, and T. E. Stern, "Routing techniques used in computer communication networks," IEEE Trans. Commun., vol. COM-28, pp. 539-552, Apr. 1980.
3. M. Gerla, and L. Kleinrock, "On the topological design of distributed computer networks," IEEE Trans. Commun., vol. COM-25, pp. 48-60, Jan. 1977.
4. M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis. Reading, MA: Addison-Wesley, 1987.
5. B. Meister, H. R. Müller, and H. R. Rudin, Jr., "New optimization criteria for message-switching networks," IEEE Trans. Commun., vol. COM-19, pp. 256-260, 1971.
6. D. P. Bertsekas, and R. G. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
7. R. G. Gallager, "A minimum delay routing algorithm using distributed computation," IEEE Trans. Commun., vol. COM-25, pp. 73-85, Jan. 1977.
8. L. Kleinrock, Queueing Systems: Volume II, Computer Applications. New York: John Wiley & Sons, 1976.
9. M. Gerla, and L. Kleinrock, "Flow control: a comparative survey," IEEE Trans. Commun., vol. COM-28, pp. 553-774, Apr. 1980.
10. M. Gerla, and M. Staskauskas, "Fairness in flow controlled networks," in Proc. of the IEEE ICC 81, Denver, CO, Jun. 1981, pp. 63.2.1-63.2.5.
11. J. W. Mark, "Fairness issues in computer communication networks," in Proc. of the IEEE ICC 85, Chicago, IL, Jun. 1985, pp. 43.2.1-43.2.5.
12. M. Gerla, H. W. Chan, and J. R. Boisson De Marca, "Fairness in computer networks," in Proc. of the IEEE ICC 85, Chicago, IL, Jun. 1985, pp. 43.5.1-43.5.6.
13. J. W. Wong, J. P. Sauve, and J. A. Field, "A study of fairness in packet-switching networks," IEEE Trans. Commun., vol. COM-30, pp. 346-353, Feb. 1982.
14. M. Gerla, H. W. Chan, and J. R. Boisson De Marca, "Routing, flow control, and fairness in computer networks," in Proc. of the IEEE ICC 84, Amsterdam, Netherlands, May 1984, pp. 1272-1275.
15. K. S. Vastola, "A numerical study of two measures of delay for network routing," M. S. Thesis, Dept. of Electrical Engineering, Univ. of Illinois, 1979.
16. D. P. Bertsekas, B. Gendron, and W. K. Tsai, "Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation," MIT, Laboratory for Information and Decision Systems Report LIDS-P-1364, Feb. 1984.
17. D. P. Bertsekas, "Notes on optimal routing and flow control for communication networks," MIT, Laboratory for Information and Decision Systems Report LIDS-R-1169, Dec. 1981.
18. J. M. McQuillan, I. Richer, and E. C. Rosen, "The new routing algorithm for the ARPANET," IEEE Trans. Commun. vol. COM-28, pp. 711-719, May 1980.
19. L. Kleinrock, Queueing Systems: Volume I, Theory. New York: John Wiley & Sons, 1975.