Path selection in networks with non-deterministic information

E. Korach, R. Ohayon

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations

Abstract

We investigate the problem of path selection under multiple QoS constraints, when the information available for making routing decisions is non-deterministic. The goal of the path selection process is to identify a feasible path while minimizing the overall setup time required for establishing a successful connection. We assume that a list of candidate paths already exists and, under some practical assumptions, we show how to find an optimal order of the given paths in order to achieve the goal.

Original languageEnglish
Pages (from-to)2227-2231
Number of pages5
JournalConference Record - International Conference on Communications
Volume4
StatePublished - 1 Jan 2002
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: 28 Apr 20022 May 2002

Fingerprint

Dive into the research topics of 'Path selection in networks with non-deterministic information'. Together they form a unique fingerprint.

Cite this