QoS protocol and algorithm join forces

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

27 Downloads (Pure)

Abstract

In general, routing is subdivided into two functionalities: routing protocols that keep the network state information up to date and routing algorithms that compute paths based on the information provided by the routing protocols. An excessive overhead prevents the distribution of all resource changes across the network, leadign to stale link-state information. Besides inaccurate information, researchers have also resorted to inexact algorithms, because the general QoS path selection problem is NP-hard. Researchers have strived to optimize on either the two can benefit form eachother. In this paper we combine QoS protocol algorithm. Our solution guarantees a tunable bouned error margin on the link-state information and provides an exact polynomial-time algorithm for the selection of (mulit-constrained) paths.
Original languageUndefined/Unknown
Title of host publicationChinacom 2006; First international conference on communications and networking in chin
Editors s.n.
Place of Publications.l.
PublisherIEEE Society
Pages1-5
Number of pages5
ISBN (Print)1424404630
DOIs
Publication statusPublished - 2006
EventConferentie, Beijing, PR China - s.l.
Duration: 25 Oct 200627 Oct 2006

Publication series

Name
PublisherIEEE

Conference

ConferenceConferentie, Beijing, PR China
Period25/10/0627/10/06

Keywords

  • conference contrib. refereed
  • Conf.proc. > 3 pag

Cite this