000 03816nam a22005655i 4500
001 978-3-031-79272-4
003 DE-He213
005 20240730165247.0
007 cr nn 008mamaa
008 220601s2017 sz | s |||| 0|eng d
020 _a9783031792724
_9978-3-031-79272-4
024 7 _a10.1007/978-3-031-79272-4
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
100 1 _aJi, Bo.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_988102
245 1 0 _aAdvances in Multi-Channel Resource Allocation
_h[electronic resource] :
_bThroughput, Delay, and Complexity /
_cby Bo Ji, Xiaojun Lin, Ness B. Shroff.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXIV, 116 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Learning, Networks, and Algorithms,
_x2690-4314
505 0 _aPreface -- Overview -- Intra-Cell Scheduling -- Network-Wide Scheduling -- Bibliography -- Authors' Biographies .
520 _aThe last decade has seen an unprecedented growth in the demand for wireless services. These services are fueled by applications that often require not only high data rates, but also very low latency to function as desired. However, as wireless networks grow and support increasingly large numbers of users, these control algorithms must also incur only low complexity in order to be implemented in practice. Therefore, there is a pressing need to develop wireless control algorithms that can achieve both high throughput and low delay, but with low-complexity operations. While these three performance metrics, i.e., throughput, delay, and complexity, are widely acknowledged as being among the most important for modern wireless networks, existing approaches often have had to sacrifice a subset of them in order to optimize the others, leading to wireless resource allocation algorithms that either suffer poor performance or are difficult to implement. In contrast, the recent results presented inthis book demonstrate that, by cleverly taking advantage of multiple physical or virtual channels, one can develop new low-complexity algorithms that attain both provably high throughput and provably low delay. The book covers both the intra-cell and network-wide settings. In each case, after the pitfalls of existing approaches are examined, new systematic methodologies are provided to develop algorithms that perform provably well in all three dimensions.
650 0 _aArtificial intelligence.
_93407
650 0 _aCooperating objects (Computer systems).
_96195
650 0 _aProgramming languages (Electronic computers).
_97503
650 0 _aTelecommunication.
_910437
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aCyber-Physical Systems.
_932475
650 2 4 _aProgramming Language.
_939403
650 2 4 _aCommunications Engineering, Networks.
_931570
700 1 _aLin, Xiaojun.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_988105
700 1 _aShroff, Ness B.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_988107
710 2 _aSpringerLink (Online service)
_988109
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031792717
776 0 8 _iPrinted edition:
_z9783031792731
830 0 _aSynthesis Lectures on Learning, Networks, and Algorithms,
_x2690-4314
_988111
856 4 0 _uhttps://doi.org/10.1007/978-3-031-79272-4
912 _aZDB-2-SXSC
942 _cEBK
999 _c86202
_d86202