Absorbing lexicographic products in metarouting

Simple item page
dc.contributor.authorParsonage, E.
dc.contributor.authorNguyen, H.
dc.contributor.authorRoughan, M.
dc.contributor.conference1st International Workshop on Rigorous Protocol Engineering (17 Oct 2011 - 17 Oct 2011 : Vancouver, Canada)
dc.date.issued2011
dc.description.abstractModern treatments of routing protocols use algebraic techniques to derive the protocol’s properties, permitting a semantic richness more flexible than simple numerical “shortest paths”. Many such routing protocols make preference decisions based on multiple criteria. This fits well with an algebraic formulation with each strata in the decision process modeled as an algebraic structure, that are combined to create the full routing protocol. Routing protocols constructed in this manner are the focus of this paper. To implement such a routing protocol we must understand the properties needed on each of the algebraic formulations representing a strata. In this paper we examine a stratified routing algebra based on a recently suggested absorbing product and provide the necessary and sufficient conditions required by each of the operands to guarantee that such a routing language ensures globally optimal paths will be found.
dc.description.statementofresponsibilityEric Parsonage, Hung X. Nguyen, Matthew Roughan
dc.identifier.citationProceedings of 1st International Workshop on Rigorous Protocol Engineering (WRiPE) 2011, 2011, pp.1-6
dc.identifier.orcidNguyen, H. [0000-0003-1028-920X]
dc.identifier.orcidRoughan, M. [0000-0002-7882-7329]
dc.identifier.urihttp://hdl.handle.net/2440/88264
dc.language.isoen
dc.rightsCopyright status unknown
dc.source.urihttp://wripe11.cis.upenn.edu/program/papers/wripe11-paper4.pdf
dc.titleAbsorbing lexicographic products in metarouting
dc.typeConference paper
pubs.publication-statusPublished

Files

Collections

Mathematical Sciences publications