• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access:
    • free (7)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 7 of 7 1 Layered Bandwidth Allocation for Multicasting of Hierarchically Encoded Sources Saswati Sarkar; Leandros Tassiulas In: http://www.ee.umd.edu/~leandros/papers/mfdton.ps (2000) BASE Show details 2 Fair Allocation of Discrete Bandwidth Layers in Multicast Networks Saswati Sarkar; Leandros Tassiulas; Ros Tassiulas In: http://www.ieee-infocom.org/2000/papers/458.ps (2000) BASE Show details 3 Fair Allocation of Discrete Bandwidth Layers in Multicast Networks Saswati Sarkar; Leandros Tassiulas In: http://www.seas.upenn.edu:8080/~swati/mfdshort.ps (2000) BASE Show details 4 Fair Allocation of Utilities in Multirate Multicast Networks Saswati Sarkar; Leandros Tassiulas; Ros Tassiulas In: http://www.ee.umd.edu/~leandros/papers/allerton99a.ps (1999) BASE Show details 5 Fair Allocation of Discrete Bandwidth Layers in Multicast Networks Saswati Sarkar; Leandros Tassiulas; Ros Tassiulas In: http://www.isr.umd.edu/TechReports/ISR/1999/TR_99-43/TR_99-43.pdf (1999) Abstract: We study fairness when receivers in a multicast network can not subscribe to fractional layers. This case arises when the source hierarchically encodes its signal and the hierarchical structure is predetermined. Unlike the case of the fractional layer allocation, which has been studied extensively in [29], bandwidth can be allocated in discrete chunks only. Fairness issues become vastly di#erent. Computation of lexicographically optimal rate allocation becomes NP-hard in this case, while lexicographically optimal rate allocation is polynomial complexity computable when fractional layers can be allocated. Furthermore, maxmin fair rate vector may not exist in this case. We introduce a new notion of fairness, maximal fairness. We propose a polynomial complexity algorithm for computation of maximally fair rates allocated to various source-destination pairs. Even though, maximal fairness is a weaker notion of fairness, it coincides with lexicographic optimality and maxmin fair. URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4734 http://www.isr.umd.edu/TechReports/ISR/1999/TR_99-43/TR_99-43.pdf BASE Hide details 6 Fair Allocation of Utilities in Multirate Multicast Networks Saswati Sarkar; Leandros Tassiulas In: http://www.seas.upenn.edu:8080/~swati/allerton.ps (1999) BASE Show details 7 Optimal Overload Response in Sensor Networks Leonidas Georgiadis; Leandros Tassiulas In: http://genesis.ee.auth.gr/georgiadis/english/Publications/JournalPapers/BalancedOverload_IT.pdf BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik IDS Mannheim OLC Linguistik UB Frankfurt Retrokatalog DNB Subject Category Language Institut für Empirische Sprachwissenschaft Leibniz-Centre General Linguistics (ZAS) Bibliographies BLLDB BDSL IDS Bibliografie zur deutschen Grammatik IDS Bibliografie zur Gesprächsforschung IDS Konnektoren im Deutschen IDS Präpositionen im Deutschen IDS OBELEX meta MPI-SHH Linguistics Collection MPI for Psycholinguistics Linked Open Data catalogues Annohub Online resources Link directory Journal directory Database directory Dictionary directory Open access documents BASE 7 Linguistik-Repository IDS Publikationsserver Online dissertations Language Description Heritage