On a theory of network equivalence

We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can be met on the given network if and only if it can be met on another network where each noisy link is replaced by a nois...

Full description

Saved in:
Bibliographic Details
Published in2009 IEEE Information Theory Workshop on Networking and Information Theory pp. 326 - 330
Main Authors Koetter, R., Effros, M., Medard, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2009
Subjects
Online AccessGet full text
ISBN1424445353
9781424445356
DOI10.1109/ITWNIT.2009.5158596

Cover

Abstract We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can be met on the given network if and only if it can be met on another network where each noisy link is replaced by a noiseless bit pipe with throughput equal to the noisy link capacity. This result was previously known only for multicast connections.
AbstractList We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a collection of demands can be met on the given network if and only if it can be met on another network where each noisy link is replaced by a noiseless bit pipe with throughput equal to the noisy link capacity. This result was previously known only for multicast connections.
Author Koetter, R.
Effros, M.
Medard, M.
Author_xml – sequence: 1
  givenname: R.
  surname: Koetter
  fullname: Koetter, R.
– sequence: 2
  givenname: M.
  surname: Effros
  fullname: Effros, M.
– sequence: 3
  givenname: M.
  surname: Medard
  fullname: Medard, M.
BookMark eNo1j09Lw0AUxJ9oQVPzCXpZvCfuZv_lHaVoDRR7iXgsu8lbjNaNJlHpt7dincsw8JuBSeAs9pEAFoLnQnC8ruqnh6rOC84x10KXGs0JpGhLoQqllJZGnkLyH7ScQfLLIpclt-eQjuMLP0gfmlZcwNUmMsemZ-qHPesDizR998Mro4_P7svtKDZ0CbPgdiOlR5_D491tvbzP1ptVtbxZZ52wespsEbQQwkjjnOKl8ca2CpvgnFeGtJVNMBJ9g-SQvCIMobGcGy1966lFOYfF325HRNv3oXtzw357_Ch_AKMRRF8
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ITWNIT.2009.5158596
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781424445363
1424445361
EndPage 330
ExternalDocumentID 5158596
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIE
RIL
ID FETCH-LOGICAL-i175t-72f5111636aa4086b67d49cfaab46e573cf639bc9ea9eb4e9ffc700653bdbed93
IEDL.DBID RIE
ISBN 1424445353
9781424445356
IngestDate Wed Aug 27 02:04:36 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
LCCN 2009903807
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-72f5111636aa4086b67d49cfaab46e573cf639bc9ea9eb4e9ffc700653bdbed93
PageCount 5
ParticipantIDs ieee_primary_5158596
PublicationCentury 2000
PublicationDate 2009-June
PublicationDateYYYYMMDD 2009-06-01
PublicationDate_xml – month: 06
  year: 2009
  text: 2009-June
PublicationDecade 2000
PublicationTitle 2009 IEEE Information Theory Workshop on Networking and Information Theory
PublicationTitleAbbrev ITWNIT
PublicationYear 2009
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558571
Score 1.4878852
Snippet We describe an equivalence result for network capacity. Roughly, our main result is as follows. Given a network of noisy, independent, memoryless links, a...
SourceID ieee
SourceType Publisher
StartPage 326
SubjectTerms Complexity theory
Heart
Information theory
Multicast algorithms
Network coding
Routing
Signal analysis
Signal to noise ratio
Throughput
Unicast
Title On a theory of network equivalence
URI https://ieeexplore.ieee.org/document/5158596
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEA5tT55UWvFNEI-mzXbz2JzF0gqtHlrsrWSyEyjCVmX3UH-92UcrigdveZCQIYFvMpnvCyG3XihELjwTEQ6ZwCEwAzxhjjtrQCcxYHlRnM7UeCEel3LZInd7LgwiVsln2C-L1Vt-unFFGSobBOxNpFFt0g7HrOZq7eMpXIY-He24W0LGMt5JOjV11agORdwMJvOX2WRe61U20_74X6WCl9Ehme4WVmeVvPaLHPru85dm439XfkR630Q--ryHqGPSwqxLbp4yamnFYNzSjadZnQlO8b1Yh3NXDuqRxehhfj9mzVcJbB3wP2d66IPnFHwrZa0ItxRQOhXGeWshbIbUsfPBFQFn0BoEgcZ7pytdWkgBUxOfkE62yfCUUA4KjUQdeVDC89RGKrFGRzbVwoGNz0i3tG_1VqthrBrTzv9uviAH9ftLGbe4JJ38o8CrAOM5XFf79wXY05jb
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEB5qPehJpRXfLuLRbXe7eWzOYmm1rR5a7K1kshMowlZl96C_3uyjFcWDtzxIyJDAN5nM9wXg2jJBFDDrs5B6PqMe-gqD2DeB0QplHCEVF8XxRAxm7H7O5w242XBhiKhMPqNOUSzf8pOVyYtQWddhb8yV2IJth_uMV2ytTUQl4K5Xhmv2FuMRj9aiTnVd1LpDYaC6w-nzZDitFCvriX_8sFICTH8PxuulVXklL508w475_KXa-N-170P7m8rnPW1A6gAalLbg6jH1tFdyGD-8lfXSKhfco7d86U5eMagNs_7d9Hbg158l-EvnAWS-7FnnOznvSmjN3D0FhUyYMlZrdNvBZWSsc0bQKNKKkJGy1shSmRYTpERFh9BMVykdgRegIMVJhhYFs0GiQxFrJUOdSGZQR8fQKuxbvFZ6GIvatJO_my9hZzAdjxaj4eThFHar15giinEGzew9p3MH6hlelHv5BRMXnCg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+IEEE+Information+Theory+Workshop+on+Networking+and+Information+Theory&rft.atitle=On+a+theory+of+network+equivalence&rft.au=Koetter%2C+R.&rft.au=Effros%2C+M.&rft.au=Medard%2C+M.&rft.date=2009-06-01&rft.pub=IEEE&rft.isbn=9781424445356&rft.spage=326&rft.epage=330&rft_id=info:doi/10.1109%2FITWNIT.2009.5158596&rft.externalDocID=5158596
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424445356/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424445356/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781424445356/sc.gif&client=summon&freeimage=true