File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A laplace transform-based method to stochastic path finding

TitleA laplace transform-based method to stochastic path finding
Authors
Issue Date2009
Citation
Ieee International Conference On Communications, 2009 How to Cite?
AbstractFinding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probability distributions is NP-Hard [1]. We transform the probability distributions into the Laplace domain, find the Laplace Transform of their convolutions and numerically inverse to find the distribution function in the time domain. Picard's iterative method of successive approximations is used to find the solution. To the best of our knowledge, ours is the first to propose a transform-based approach for the QoS routing problem of finding the most likely path. Simulations show that our stochastic approach (1) Selects correct paths more frequently, (2) Incurs less overhead with respect to the dissemination and processing of state information, and (3) Reduces the churn by selecting more stable paths. ©2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158603
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorUludag, Sen_US
dc.contributor.authorUludag, ZEen_US
dc.contributor.authorNahrstedt, Ken_US
dc.contributor.authorLui, KSen_US
dc.contributor.authorBaker, Fen_US
dc.date.accessioned2012-08-08T09:00:27Z-
dc.date.available2012-08-08T09:00:27Z-
dc.date.issued2009en_US
dc.identifier.citationIeee International Conference On Communications, 2009en_US
dc.identifier.issn0536-1486en_US
dc.identifier.urihttp://hdl.handle.net/10722/158603-
dc.description.abstractFinding the most likely path satisfying a requested additive Quality-of-Service (QoS) value, such as delay, when link metrics are defined as random variables by known probability distributions is NP-Hard [1]. We transform the probability distributions into the Laplace domain, find the Laplace Transform of their convolutions and numerically inverse to find the distribution function in the time domain. Picard's iterative method of successive approximations is used to find the solution. To the best of our knowledge, ours is the first to propose a transform-based approach for the QoS routing problem of finding the most likely path. Simulations show that our stochastic approach (1) Selects correct paths more frequently, (2) Incurs less overhead with respect to the dissemination and processing of state information, and (3) Reduces the churn by selecting more stable paths. ©2009 IEEE.en_US
dc.languageengen_US
dc.relation.ispartofIEEE International Conference on Communicationsen_US
dc.titleA laplace transform-based method to stochastic path findingen_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/ICC.2009.5198619en_US
dc.identifier.scopuseid_2-s2.0-70449489420en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-70449489420&selection=ref&src=s&origin=recordpageen_US
dc.identifier.scopusauthoridUludag, S=21740315500en_US
dc.identifier.scopusauthoridUludag, ZE=24823345300en_US
dc.identifier.scopusauthoridNahrstedt, K=7006456800en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US
dc.identifier.scopusauthoridBaker, F=35316712100en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats