CaltechAUTHORS
  A Caltech Library Service

Finding the best path in a binary Block Interference network

Soedarmadji, Edwin and McEliece, Robert J. (2008) Finding the best path in a binary Block Interference network. In: 2008 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 335-338. ISBN 978-1-4244-2571-6. http://resolver.caltech.edu/CaltechAUTHORS:20190304-090608519

[img] PDF - Published Version
See Usage Policy.

230Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20190304-090608519

Abstract

A binary block interference channel (BIC) is model of binary channels with memory that allows for a mathematically tractable computation of channel capacity. One can easily imagine interconnecting such channels into a network that allows point-to-point communication between any two nodes in the network. Given a pair of network nodes, finding the path with the highest capacity is quite trivial if we can assume that all participating nodes in any path connecting the two nodes can perform coding at arbitrary complexity such that at each link capacity is achieved. However, even if the complexity assumption is not taken into account, in most real-life networks (such as the current Internet), only a minimum amount of coding is performed at the link layer. In most networks, coding is performed five or six layers up in the OSI network model, i.e., on either the presentation or the application layer. Under such realistic circumstances, finding the path with the highest capacity is no longer trivial. In this paper, we propose a solution based on a modified version of the Dijkstrapsilas Algorithm.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ISIT.2008.4595003DOIArticle
Additional Information:© 2008 IEEE. This work was supported by the Caltech Lee Center for Advanced Networking and NSF Grant No. CCF-0514881.
Funders:
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
NSFCCF-0514881
Record Number:CaltechAUTHORS:20190304-090608519
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20190304-090608519
Official Citation:E. Soedarmadji and R. J. McEliece, "Finding the best path in a binary Block Interference network," 2008 IEEE International Symposium on Information Theory, Toronto, ON, 2008, pp. 335-338. doi: 10.1109/ISIT.2008.4595003
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93421
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:04 Mar 2019 17:10
Last Modified:04 Mar 2019 17:10

Repository Staff Only: item control page