File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Stochastically guaranteed routing for additive link metrics with unknown distributions

TitleStochastically guaranteed routing for additive link metrics with unknown distributions
Authors
Issue Date2008
Citation
Ieee International Workshop On Quality Of Service, Iwqos, 2008, p. 199-203 How to Cite?
AbstractNetwork applications that are in need of some level of guarantees from the network to operate, such as multimedia programs, are not well served with the conventional best-effort service of the IP-based networks. The difficulty of finding preferential paths for those applications is compounded by the intrinsic inaccuracies of the network state information maintained by the nodes that have to make such decisions. We use a probabilistic modeling and a framework to select paths for applications that want more cooperation from the network to operate satisfactorily. The links are associated with additive link metrics. We represent the stochasticity of links by means of a new composite metric composed of an interval with a lower and upper bound and an associated probability. The interpretation and relevance of our metric is such that in the next decision time period the expected value of the resource is between the upper and the lower bound with the associated probability. Three simple and straightforward methods of computing our composite metric are presented. An algorithm, called Augmented-Dijkstra Additive Metric (ADAM), with the same complexity as the standard Dijkstra algorithm, provides an effective solution for statistical additive link metric (such as delay) guarantees. Simulation results conducted in ns2 evaluate and confirm the effectiveness of our approach. ©2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158547
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorUludag, Sen_US
dc.contributor.authorUludag, ZEen_US
dc.contributor.authorHowell, Aen_US
dc.contributor.authorBaker, Fen_US
dc.contributor.authorLui, KSen_US
dc.date.accessioned2012-08-08T09:00:12Z-
dc.date.available2012-08-08T09:00:12Z-
dc.date.issued2008en_US
dc.identifier.citationIeee International Workshop On Quality Of Service, Iwqos, 2008, p. 199-203en_US
dc.identifier.issn1548-615Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/158547-
dc.description.abstractNetwork applications that are in need of some level of guarantees from the network to operate, such as multimedia programs, are not well served with the conventional best-effort service of the IP-based networks. The difficulty of finding preferential paths for those applications is compounded by the intrinsic inaccuracies of the network state information maintained by the nodes that have to make such decisions. We use a probabilistic modeling and a framework to select paths for applications that want more cooperation from the network to operate satisfactorily. The links are associated with additive link metrics. We represent the stochasticity of links by means of a new composite metric composed of an interval with a lower and upper bound and an associated probability. The interpretation and relevance of our metric is such that in the next decision time period the expected value of the resource is between the upper and the lower bound with the associated probability. Three simple and straightforward methods of computing our composite metric are presented. An algorithm, called Augmented-Dijkstra Additive Metric (ADAM), with the same complexity as the standard Dijkstra algorithm, provides an effective solution for statistical additive link metric (such as delay) guarantees. Simulation results conducted in ns2 evaluate and confirm the effectiveness of our approach. ©2008 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE International Workshop on Quality of Service, IWQoSen_US
dc.titleStochastically guaranteed routing for additive link metrics with unknown distributionsen_US
dc.typeConference_Paperen_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/IWQOS.2008.28en_US
dc.identifier.scopuseid_2-s2.0-50649104824en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-50649104824&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage199en_US
dc.identifier.epage203en_US
dc.identifier.scopusauthoridUludag, S=21740315500en_US
dc.identifier.scopusauthoridUludag, ZE=24823345300en_US
dc.identifier.scopusauthoridHowell, A=24821617000en_US
dc.identifier.scopusauthoridBaker, F=35316712100en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats