Asymmetric communication protocols via hotlink assignments

DOI10.1007/S00224-003-1126-2MaRDI QIDQ1762995zbMATH OpenOpenAlexFDO

Authors Prosenjit Bose, D. Krizanc, Stefan Langerman, Pat Morin

Publication date 11 February 2005

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-003-1126-2

Mathematics Subject Classification ID

Network protocols (68M12)

Review text

We exhibit a relationship between the asymmetric communication problem of Adler and Maggs and the hotlink assignment problem of Bose et al. By generalizing previous results on the hotlink problem and then exploiting this relationship we present a new asymmetric communication protocol with different performance bounds than previous protocols.

Recommendations

• On asymmetric communication protocols
• Dynamic Asymmetric Communication
• Improved bounds for asymmetric communication protocols.
• Dynamic asymmetric communication
• How to compress asymmetric communication

Cited in

(6)

• Approximation algorithm for hotlink assignment in the greedy model
• Approximate hotlink assignment
• On the complexity of optimal hotlink assignment
• Dynamic hotlinks
• Near-entropy hotlink assignments
• Dynamic asymmetric communication

This page was built for publication: Asymmetric communication protocols via hotlink assignments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762995)