Routing in virtual path based ATM networks

Sanjay Gupta; Keith W. Ross; Magda El Zarki

doi:10.1109/GLOCOM.1992.276450

Routing in virtual path based ATM networks

Sanjay Gupta, Keith W. Ross, Magda El Zarki

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.

Original language	English (US)
Title of host publication	GLOBECOM 1992 - Communication for Global Users
Subtitle of host publication	IEEE Global Telecommunications Conference
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	571-575
Number of pages	5
ISBN (Electronic)	0780306082, 9780780306080
DOIs	https://doi.org/10.1109/GLOCOM.1992.276450
State	Published - 1992
Event	1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992 - Orlando, United States Duration: Dec 6 1992 → Dec 9 1992

Publication series

Name	GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference

Conference

Conference	1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992
Country/Territory	United States
City	Orlando
Period	12/6/92 → 12/9/92

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Information Systems
Information Systems and Management
Safety, Risk, Reliability and Quality

Access to Document

10.1109/GLOCOM.1992.276450

Cite this

Gupta, S., Ross, K. W., & El Zarki, M. (1992). Routing in virtual path based ATM networks. In GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference (pp. 571-575). [276450] (GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.1992.276450

Routing in virtual path based ATM networks. / Gupta, Sanjay; Ross, Keith W.; El Zarki, Magda.

GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers Inc., 1992. p. 571-575 276450 (GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gupta, S, Ross, KW & El Zarki, M 1992, Routing in virtual path based ATM networks. in GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference., 276450, GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference, Institute of Electrical and Electronics Engineers Inc., pp. 571-575, 1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992, Orlando, United States, 12/6/92. https://doi.org/10.1109/GLOCOM.1992.276450

Gupta S, Ross KW, El Zarki M. Routing in virtual path based ATM networks. In GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers Inc. 1992. p. 571-575. 276450. (GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.1992.276450

@inproceedings{e5376ba175f64f3cb0c86c06b0acba92,

title = "Routing in virtual path based ATM networks",

abstract = "We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.",

author = "Sanjay Gupta and Ross, {Keith W.} and {El Zarki}, Magda",

note = "Funding Information: 'Supported patidly though NSF grant NCR-891.147 and AT&T grant 5-23690 Publisher Copyright: {\textcopyright} 1992 IEEE.; 1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992 ; Conference date: 06-12-1992 Through 09-12-1992",

year = "1992",

doi = "10.1109/GLOCOM.1992.276450",

language = "English (US)",

series = "GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "571--575",

booktitle = "GLOBECOM 1992 - Communication for Global Users",

}

TY - GEN

T1 - Routing in virtual path based ATM networks

AU - Gupta, Sanjay

AU - Ross, Keith W.

AU - El Zarki, Magda

PY - 1992

Y1 - 1992

N2 - We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.

AB - We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.

UR - http://www.scopus.com/inward/record.url?scp=85027182755&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027182755&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.1992.276450

DO - 10.1109/GLOCOM.1992.276450

M3 - Conference contribution

AN - SCOPUS:85027182755

T3 - GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference

SP - 571

EP - 575

BT - GLOBECOM 1992 - Communication for Global Users

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992

Y2 - 6 December 1992 through 9 December 1992

ER -

Routing in virtual path based ATM networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this