File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: DIVERSITY TRANSMISSIONS IN A COMMUNICATION NETWORK WITH UNRELIABLE COMPONENTS.

TitleDIVERSITY TRANSMISSIONS IN A COMMUNICATION NETWORK WITH UNRELIABLE COMPONENTS.
Authors
Issue Date1987
Citation
Conference Record - International Conference On Communications, 1987, p. 968-973 How to Cite?
AbstractThe effect of sending redundant copies of each message in a point-to-point communication network with unreliable components is studied. To increase the probability of success, it is desirable to send the copies along link-disjoint or vertex-disjoint paths. The mean network delay is used as the basis of comparison of a two-copy scheme with a single-copy scheme. The effects of network routing and retransmission due to failures are analyzed. The environment in which the two-copy scheme achieves smaller network delay is discussed. The loop-freedom property of memoryless routing is briefly discussed. For the optimal two-copy scheme which minimizes the mean network delay, one solution that does not satisfy the constaint of sending along vertex-disjoint paths is found. Some heuristics to find two-copy routing schemes that satisfy this constraint are proposed.
Persistent Identifierhttp://hdl.handle.net/10722/158028
ISSN

 

DC FieldValueLanguage
dc.contributor.authorChiou, ShenNengen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:57:46Z-
dc.date.available2012-08-08T08:57:46Z-
dc.date.issued1987en_US
dc.identifier.citationConference Record - International Conference On Communications, 1987, p. 968-973en_US
dc.identifier.issn0536-1486en_US
dc.identifier.urihttp://hdl.handle.net/10722/158028-
dc.description.abstractThe effect of sending redundant copies of each message in a point-to-point communication network with unreliable components is studied. To increase the probability of success, it is desirable to send the copies along link-disjoint or vertex-disjoint paths. The mean network delay is used as the basis of comparison of a two-copy scheme with a single-copy scheme. The effects of network routing and retransmission due to failures are analyzed. The environment in which the two-copy scheme achieves smaller network delay is discussed. The loop-freedom property of memoryless routing is briefly discussed. For the optimal two-copy scheme which minimizes the mean network delay, one solution that does not satisfy the constaint of sending along vertex-disjoint paths is found. Some heuristics to find two-copy routing schemes that satisfy this constraint are proposed.en_US
dc.languageengen_US
dc.relation.ispartofConference Record - International Conference on Communicationsen_US
dc.titleDIVERSITY TRANSMISSIONS IN A COMMUNICATION NETWORK WITH UNRELIABLE COMPONENTS.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-0023589994en_US
dc.identifier.spage968en_US
dc.identifier.epage973en_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