File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Optimal rate allocation in overlay content distribution

TitleOptimal rate allocation in overlay content distribution
Authors
KeywordsOptimization
Overlay network
Rate allocation
Issue Date2007
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Lecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2007, v. 4479 LNCS, p. 678-690 How to Cite?
AbstractThis paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of optimal rate allocation strategies by dividing our discussions into four typical scenarios. Based on application-specific requirements, these scenarios reflect the contrast between elastic and streaming content distribution, with either per-link or per-node capacity constraints. In each scenario, we show that the optimal rate allocation problem can be formulated as a linear optimization problem, which can be solved efficiently in a fully distributed fashion. In simulations, we investigate the convergence of our distributed algorithms in both static and dynamic networks, and demonstrate their efficiency. © IFIP International Federation for Information Processing 2007.
Persistent Identifierhttp://hdl.handle.net/10722/92663
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorWu, Cen_HK
dc.contributor.authorLi, Ben_HK
dc.date.accessioned2010-09-17T10:53:24Z-
dc.date.available2010-09-17T10:53:24Z-
dc.date.issued2007en_HK
dc.identifier.citationLecture Notes In Computer Science (Including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics), 2007, v. 4479 LNCS, p. 678-690en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/92663-
dc.description.abstractThis paper addresses the optimal rate allocation problem in overlay content distribution for efficient utilization of limited bandwidths. We systematically present a series of optimal rate allocation strategies by dividing our discussions into four typical scenarios. Based on application-specific requirements, these scenarios reflect the contrast between elastic and streaming content distribution, with either per-link or per-node capacity constraints. In each scenario, we show that the optimal rate allocation problem can be formulated as a linear optimization problem, which can be solved efficiently in a fully distributed fashion. In simulations, we investigate the convergence of our distributed algorithms in both static and dynamic networks, and demonstrate their efficiency. © IFIP International Federation for Information Processing 2007.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_HK
dc.subjectOptimizationen_HK
dc.subjectOverlay networken_HK
dc.subjectRate allocationen_HK
dc.titleOptimal rate allocation in overlay content distributionen_HK
dc.typeArticleen_HK
dc.identifier.emailWu, C:cwu@cs.hku.hken_HK
dc.identifier.authorityWu, C=rp01397en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-37249052792en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-37249052792&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume4479 LNCSen_HK
dc.identifier.spage678en_HK
dc.identifier.epage690en_HK
dc.identifier.eissn1611-3349-
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridWu, C=15836048100en_HK
dc.identifier.scopusauthoridLi, B=23467418800en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats