Deterministic algorithm for VP assignment in ATM networks

Computer Communications

Volumn 19, Issue 13, 1996, Pages 1036-1050

  Aydemir, Metin ^a   Viniotis, Yannis ^a  

^a North Carolina State University   (United States)

Author keywords

ATM networks; Deterministic algorithm; Virtual path assignment

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; TELECOMMUNICATION CONTROL; TELECOMMUNICATION TRAFFIC; VOICE/DATA COMMUNICATION SYSTEMS;

BLOCKING PROBABILITY; DETERMINISTIC ALGORITHM; MULTI RATE LOSS NETWORK; NETWORK THROUGHPUT; OBJECTIVE FUNCTION; QUALITY OF SERVICE; STATIC CONNECTION ROUTING; VIRTUAL PATH ASSIGNMENT;

ASYNCHRONOUS TRANSFER MODE;

EID: 0030285109     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(97)84934-1     Document Type: Article

References (21)

1. T. Kanada, K. Sato and T. Tsuboi, An ATM based transport network architecture, IEEE COMSOC Int. Workshop on Future Prospects of Burst/Packetized Multimedia Communications, Osala, Japan, 1987.
2. I. Tokizawa, T. Kanada and K. Sato, A new transport network architecture based on asynchronous transfer mode techniques, Proc. ISSLS'88, Boston, MA, 1988, 11.2.1-5.
3. G. Addie, J. Burgin and S.L Sutherland. B-ISDN Protocol architecture, Proc. IEEE GLOBECOM, 22.6.1, Hollywood, FL., 1988.
4. K.-I. Sato, S. Ohta and I. Tokizawa, Broadband ATM network architecture based on virtual paths, IEEE Trans. Comm., 39 (8) (1990) 1212-1222.
5. J. Burgin and D. Dorman, Broadband ISDN resource management: the role of virtual paths, IEEE Comm. Magazine (1991) 44-48.
6. I. Chlamtac, A. Faragó and T. Zhang, How to establish and utilize virtual paths in ATM networks, Conference Record of the IEEE International Conf. on Communications (ICC), Geneva, Switzerland, 1993, pp. 1368-1372.
7. I. Clhamtac, A. Faragó and T. Zhang, Optimizing the system of virtual paths, IEEE/ACM Trans. Networking, 2 (6) 1994 581-587.
8. F.Y.-S. Lin and K.-T. Cheng, Virtual path assignment and virtual circuit routing in ATM networks, Proc. IEEE GLOBECOM, Houston, TX, 1993, pp. 436-441.
9. K.-T. Cheng and F.Y.-S. Lin, On the joint virtual path assignment and virtual circuit routing in ATM networks, Proc. IEEE GLOBECOM, 1994, pp. 777-782.
10. O. Gerstel and S. Zaks, The virtual path layout problem in fast networks, 13th ACM Symposium on Principles of Distributed Computing, Los Angeles, CA, 1994 pp. 235-243.
11. S. Ahn, R.P. Tsang, S.-R. Tong and D.H.C. Du. Virtual path layout design on ATM networks, IEEE INFOCOM, 1994, 192-200.
12. M. Aydemir, Virtual Path Assignment in ATM Networks, PhD Thesis, ECE Dept., North Carolina State University, Raleigh, NC, 1996.
13. S.-P. Chung and K.W. Ross, Reduced load approximations for multirate loss networks, IEEE Trans. Comm., 41 (8) (1993) 1222-1231.
14. F.P. Kelly, Blocking probabilities in large circuit-switched networks, Advances in Applied Probability, 18 (1986) 473-505.
15. F. Baskett, K.M. Chandy, R.R. Muntz and F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. ACM, 22 (1975) 248-260.
16. S.S. Lam, Queueing networks with population size constraints, IBM J. Research and Development (July 1977) 370-378.
17. W. Whitt, Blocking when service is required from several facilities simultaneously, AT&T Technical J., 64 (8) (1985) 1807-1856.
18. J.S. Kaufman, Blocking in a shared resource environment, IEEE Trans. Comm., 29 (10) (1981) 1474-1481.
19. M. Aydemir and Viniotis Yannis, Virtual path assignment in ATM networks, Sixth IFIP Conf. on Performance of Computer Networks (PCN'95), Istanbul, Turkey, 1995.
20. P.J.M. Van Laarhoven and E.H.L. Aarts, Simulated Annealing: Theory and Applications, Reidel, 1988.
21. D. Bertsekas and R. Gallager, Data Networks, 2nd Edition, Prentice Hall, 1992, pp. 524-528.