File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: OPTIMAL TWO-COPY ROUTING SCHEME IN A COMMUNICATION WORK.

TitleOPTIMAL TWO-COPY ROUTING SCHEME IN A COMMUNICATION WORK.
Authors
Issue Date1988
PublisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/
Citation
Proceedings - Ieee Infocom, 1988, p. 288-297 How to Cite?
AbstractThe authors consider a static routing problem in a network with failure-prone links. Two copies of each externally generated message are sent from the source to the destination along two disjoint paths with the objective of reducing the delay resulting from retransmissions of unsuccessful packets. They formulate an optimal-routing problem using a suitable delay function. This results in a nonlinear programming problem of minimizing the delay over routing assignment under certain constraints. Specifically, they impose a disjoint-path constraint on the route assignment. This nonlinear program is solved by an iteration method incorporating a combinatorial algorithm. The solution converges to the global minimum for a convex objective function over a convex feasible region.
Persistent Identifierhttp://hdl.handle.net/10722/158033
ISSN

 

DC FieldValueLanguage
dc.contributor.authorChiou, ShenNengen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:57:48Z-
dc.date.available2012-08-08T08:57:48Z-
dc.date.issued1988en_US
dc.identifier.citationProceedings - Ieee Infocom, 1988, p. 288-297en_US
dc.identifier.issn0743-166Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/158033-
dc.description.abstractThe authors consider a static routing problem in a network with failure-prone links. Two copies of each externally generated message are sent from the source to the destination along two disjoint paths with the objective of reducing the delay resulting from retransmissions of unsuccessful packets. They formulate an optimal-routing problem using a suitable delay function. This results in a nonlinear programming problem of minimizing the delay over routing assignment under certain constraints. Specifically, they impose a disjoint-path constraint on the route assignment. This nonlinear program is solved by an iteration method incorporating a combinatorial algorithm. The solution converges to the global minimum for a convex objective function over a convex feasible region.en_US
dc.languageengen_US
dc.publisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/en_US
dc.relation.ispartofProceedings - IEEE INFOCOMen_US
dc.titleOPTIMAL TWO-COPY ROUTING SCHEME IN A COMMUNICATION WORK.en_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_US
dc.identifier.authorityLi, Victor OK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0023867845en_US
dc.identifier.spage288en_US
dc.identifier.epage297en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridChiou, ShenNeng=7201580477en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats