Age of information: a new metric for information freshness
Information usually has the highest value when it is fresh. For example, real-time knowledge about the location, orientation, and speed of motor vehicles is imperative in autonomous driving, and the access to timely information about stock prices and interest rate movements is essential for developi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
[San Rafael, California]
Morgan & Claypool
[2020]
|
| Series: | Synthesis lectures on communication networks
23 |
| Subjects: | |
| Online Access: | FHI01 Inhaltsverzeichnis |
| Summary: | Information usually has the highest value when it is fresh. For example, real-time knowledge about the location, orientation, and speed of motor vehicles is imperative in autonomous driving, and the access to timely information about stock prices and interest rate movements is essential for developing trading strategies on the stock market. The Age of Information (AoI) concept, together with its recent extensions, provides a means of quantifying the freshness of information and an opportunity to improve the performance of real-time systems and networks. Recent research advances on AoI suggest that many well-known design principles of traditional data networks (for, e.g., providing high throughput and low delay) need to be re-examined for enhancing information freshness in rapidly emerging real-time applications. This book provides a suite of analytical tools and insightful results on the generation of information-update packets at the source nodes and the design of network protocols forwarding the packets to their destinations. The book also points out interesting connections between AoI concept and information theory, signal processing, and control theory, which are worthy of future investigation.--Provided by publisher |
| Item Description: | Part of: Synthesis digital library of engineering and computer science |
| Physical Description: | xx, 204 Seiten Illustrationen 24 cm |
| ISBN: | 9781681736785 1681736780 9781681736808 1681736802 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV046417559 | ||
| 003 | DE-604 | ||
| 005 | 20230412 | ||
| 007 | t | ||
| 008 | 200211s2020 a||| b||| 00||| eng d | ||
| 020 | |a 9781681736785 |9 978-1-68173-678-5 | ||
| 020 | |a 1681736780 |9 1-68173-678-0 | ||
| 020 | |a 9781681736808 |9 978-1-68173-680-8 | ||
| 020 | |a 1681736802 |9 1-68173-680-2 | ||
| 024 | 7 | |a 10.2200/S00954ED2V01Y201909CNT023 |2 doi | |
| 035 | |a (OCoLC)1164656893 | ||
| 035 | |a (DE-599)BVBBV046417559 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-573 | ||
| 084 | |a ST 132 |0 (DE-625)143589: |2 rvk | ||
| 100 | 1 | |a Sun, Yin |d ca. 20./21. Jd. |e Verfasser |0 (DE-588)1210076020 |4 aut | |
| 245 | 1 | 0 | |a Age of information |b a new metric for information freshness |c Yin Sun, Igor Kadota, Rajat Talak, Eytan Modiano |
| 264 | 1 | |a [San Rafael, California] |b Morgan & Claypool |c [2020] | |
| 300 | |a xx, 204 Seiten |b Illustrationen |c 24 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Synthesis lectures on communication networks |v 23 | |
| 500 | |a Part of: Synthesis digital library of engineering and computer science | ||
| 505 | 8 | |a 1. Introduction -- 2. Age of information in queueing networks -- 3. Age of information in broadcast wireless networks -- 4. Age of information in general wireless networks -- 5. Age of information and sampling | |
| 520 | 3 | |a Information usually has the highest value when it is fresh. For example, real-time knowledge about the location, orientation, and speed of motor vehicles is imperative in autonomous driving, and the access to timely information about stock prices and interest rate movements is essential for developing trading strategies on the stock market. The Age of Information (AoI) concept, together with its recent extensions, provides a means of quantifying the freshness of information and an opportunity to improve the performance of real-time systems and networks. Recent research advances on AoI suggest that many well-known design principles of traditional data networks (for, e.g., providing high throughput and low delay) need to be re-examined for enhancing information freshness in rapidly emerging real-time applications. This book provides a suite of analytical tools and insightful results on the generation of information-update packets at the source nodes and the design of network protocols forwarding the packets to their destinations. The book also points out interesting connections between AoI concept and information theory, signal processing, and control theory, which are worthy of future investigation.--Provided by publisher | |
| 650 | 0 | 7 | |a Echtzeit |0 (DE-588)1041838212 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informationstheorie |0 (DE-588)4026927-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Metrik |0 (DE-588)4039002-0 |2 gnd |9 rswk-swf |
| 653 | 0 | |a Real-time data processing | |
| 653 | 0 | |a Information theory | |
| 653 | 0 | |a Information theory | |
| 653 | 0 | |a Real-time data processing | |
| 689 | 0 | 0 | |a Metrik |0 (DE-588)4039002-0 |D s |
| 689 | 0 | 1 | |a Informationstheorie |0 (DE-588)4026927-9 |D s |
| 689 | 0 | 2 | |a Echtzeit |0 (DE-588)1041838212 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Kadota, Igor |e Sonstige |0 (DE-588)1210076160 |4 oth | |
| 700 | 1 | |a Talak, Rajat |d 19XX- |e Sonstige |0 (DE-588)1210076357 |4 oth | |
| 700 | 1 | |a Modiano, Eytan |e Sonstige |0 (DE-588)1030406421 |4 oth | |
| 830 | 0 | |a Synthesis lectures on communication networks |v 23 |w (DE-604)BV042174944 |9 23 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031830048&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031830048 | ||
| 966 | e | |u https://ieeexplore.ieee.org/servlet/opac?bknumber=8940930 |l FHI01 |p ZDB-105-MCS |x Aggregator |3 Volltext | |
Record in the Search Index
| _version_ | 1804180960944586752 |
|---|---|
| adam_text | їх I List of Figures......................................................................................................... xiii List of Tables...........................................................................................................xvii Preface...................................................................................................................... xix 1 2 Introduction............................................................................................................... 1 1.1 Background...............................................................................................................2 1.2 Overview of Manuscript........................................................................................ 4 Age of Information in Queueing Networks............................................................ 7 2.1 Introduction............................................................................................................. 7 2.2 Single-Hop Queueing Networks............................................................................ 7 2.2.1 Useful Notations and Definitions..............................................................7 2.2.2 Queueing Network Model........................................................................ 8 2.2.3 Age of Information Metrics......................................................................9 2.2.4 Age Optimality Results .......................................................................... 11 Multihop Queueing
Networks.............................................................................. 16 2.3.1 Queueing Network Model...................................................................... 16 2.3.2 Age Optimality Results .......................................................................... 17 Multi-Flow, Single-Hop Queueing Networks................................................... 21 2.4.1 Queueing Network Model......................................................................21 2.4.2 Age of Information Metrics....................................................................22 2.4.3 Age Optimality Results ..........................................................................23 Summary ...............................................................................................................26 Appendices............................................................................................................. 26 2.6.1 Proof of Theorem 2.6.............................................................................. 26 2.6.2 Proof of Theorem 2.9 .............................................................................. 31 2.3 2.4 2.5 2.6 3 Age of Information in Broadcast Wireless Networks..........................................35 3.1 System Model.......................................................................................................... 36 3.1.1 Dynamic Programming Formulation.......................................................38
3.2 3.3 3.4 4 Scheduling Algorithms .........................................................................................40 3.2.1 Universal Lower Bound.......................................................................... 41 3.2.2 Maximum Age First Policy...................................................................... 44 3.2.3 Stationary Randomized Policy................................................................ 52 3.2.4 Max-Weight Policy...................................................................................54 3.2.5 Whittle’s Index Policy.............................................................................. 57 3.2.6 Simulation Results ...................................................................................60 3.2.7 Summary................................................................................................... 62 Throughput Constrained Aol Optimization........................................................63 3.3.1 Problem Formulation...............................................................................64 3.3.2 Universal Lower Bound.......................................................................... 65 3.3.3 Stationary Randomized Policy................................................................ 66 3.3.4 Drift-Plus-Penalty Policy.........................................................................71 3.3.5 Summary................................................................................................... 73 Aol in Wireless Networks with Stochastic
Arrivals............................................73 3.4.1 Problem Formulation...............................................................................75 3.4.2 Universal Lower Bound...........................................................................79 3.4.3 Stationary Randomized Policies.............................................................. 82 3.4.4 Max-Weight Policies.................................................................................90 3.4.5 Simulation Results ...................................................................................92 3.4.6 Summary................................................................................................... 94 Age of Information in General Wireless Networks............................................. 95 4.1 4.2 4.3 4.4 Introduction........................................................................................................... 95 4.1.1 Overview................................................................................................... 96 System Model......................................................................................................... 97 Distributed Scheduling Policies.............................................................................98 4.3.1 Optimal Policy.........................................................................................99 4.3.2 Distributed Computation of the Optimal Policy................................. 102 4.3.3 Summary.................................................................................................
104 Centralized Scheduling Policies...........................................................................104 4.4.1 Randomized Stationary Policies............................................................ 105 4.4.2 Active Sources......................................................................................... 106 4.4.3 Buffered Sources.....................................................................................Ill 4.4.4 Separation Principle Policy.................................................................... 114 4.4.5 Numerical-Results................................................................................... 115 4.4.6 Summary................................................................................................. 118
Xl 4.5 4.6 5 Scheduling with Channel State Information ....................................................119 4.5.1 Usefulness of Channel State Information........................................... 120 4.5.2 Some Age Identities.............................................................................. 122 4.5.3 Virtual Queue-Based Policy.................................................................. 125 4.5.4 Age-Based Policy.................................................................................. 128 4.5.5 Numerical Results.................................................................................. 130 4.5.6 Summary................................................................................................. 134 Appendix............................................................................................................. 134 4.6.1 Proof of Lemma 4.1.............................................................................. 134 4.6.2 Proof of Theorem 4.2............................................................................ 135 4.6.3 Proof of Theorem 4.3............................................................................ 135 4.6.4 Proof of Theorem 4.5 ............................................................................ 137 4.6.5 Proof of Theorem 4.6............................................................................ 138 4.6.6 Proof of Lemma 4.8.............................................................................. 139 4.6.7 Proof of Theorem
4.10.......................................................................... 139 4.6.8 Proof of Lemma 4.13............................................................................ 140 4.6.9 Derivation of the Peak Age Minimization Problem........................... 142 4.6.10 Proof of Theorem 4.19.......................................................................... 142 4.6.11 Proof of Theorem 4.20.......................................................................... 143 4.6.12 Proof of Theorem 4.22 .......................................................................... 146 Age of Information and Sampling........................................................................ 149 5.1 5.2 5.3 5.4 Introduction......................................................................................................... 149 Data Freshness Measures for Status Update......................................................149 5.2.1 A Model for Status Update Systems....................................................149 5.2.2 A Survey on Nonlinear Age Functions and their Applications........ 151 5.2.3 When to Take a Sample? A Counter-Intuitive Example...................155 Optimal Sampling Strategies.............................................................................. 156 5.3.1 Formulation of Optimal Sampling Problems....................................... 156 5.3.2 Continuous-Time Sampling without Rate Constraint....................... 157 5.3.3 Continuous-Time Sampling with Rate Constraint............................. 160 5.3.4 Discrete-Time
Sampling........................................................................ 163 5.3.5 An Example: Mutual Information Maximization............................... 165 5.3.6 Equivalent Expressions of the Ihreshold Sampling Policy.................166 5.3.7 Numerical Results...................................................................................167 Proofs of Age-Optimal Sampling Results..........................................................170 5.4.1 Suspend Sampling when the Server is Busy.......................................... 170
5.5 5.6 5.7 5.4.2 Problem Reformulation ........................................................................ 172 5.4.3 Lagrangian Dual Problem .................................................................... 172 5.4.4 Optimal Dual Solution.......................................................................... 173 5.4.5 Zero Duality Gap and Optimal Primal Solution................................. 174 5.4.6 Proofs of Continuous-Time Sampling Results ................................... 175 5.4.7 Proofs of Discrete-Time Sampling Results..........................................175 Extension: Signal Sampling and Estimation...................................................... 176 5.5.1 Formulation of Signal Sampling Problem............................................176 5.5.2 Optimal Signal Sampling Strategies ....................................................178 5.5.3 Signal-Aware Samplingvs. Signal-Ignorant Sampling........................180 Summary ............................................................................................................. 181 Appendices........................................................................................................... 181 5.7.1 Proof of Lemma 5.1...............................................................................181 5.7.2 Proof of Lemma 5.14.............................................................................181 5.7.3 Proof of Theorem 5.16...........................................................................183 5.7.4 Proof of Corollary
5.3.............................................................................185 5.7.5 Proof of Corollary 5.4.............................................................................185 5.7.6 Proof of Lemma 5.17.............................................................................186 Bibliography..........................................................................................................187 Authors’ Biographies............................................................................................203
|
| any_adam_object | 1 |
| author | Sun, Yin ca. 20./21. Jd |
| author_GND | (DE-588)1210076020 (DE-588)1210076160 (DE-588)1210076357 (DE-588)1030406421 |
| author_facet | Sun, Yin ca. 20./21. Jd |
| author_role | aut |
| author_sort | Sun, Yin ca. 20./21. Jd |
| author_variant | y s ys |
| building | Verbundindex |
| bvnumber | BV046417559 |
| classification_rvk | ST 132 |
| contents | 1. Introduction -- 2. Age of information in queueing networks -- 3. Age of information in broadcast wireless networks -- 4. Age of information in general wireless networks -- 5. Age of information and sampling |
| ctrlnum | (OCoLC)1164656893 (DE-599)BVBBV046417559 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03910nam a2200565 cb4500</leader><controlfield tag="001">BV046417559</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20230412 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">200211s2020 a||| b||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781681736785</subfield><subfield code="9">978-1-68173-678-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1681736780</subfield><subfield code="9">1-68173-678-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781681736808</subfield><subfield code="9">978-1-68173-680-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1681736802</subfield><subfield code="9">1-68173-680-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2200/S00954ED2V01Y201909CNT023</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1164656893</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046417559</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-573</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 132</subfield><subfield code="0">(DE-625)143589:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sun, Yin</subfield><subfield code="d">ca. 20./21. Jd.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1210076020</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Age of information</subfield><subfield code="b">a new metric for information freshness</subfield><subfield code="c">Yin Sun, Igor Kadota, Rajat Talak, Eytan Modiano</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[San Rafael, California]</subfield><subfield code="b">Morgan & Claypool</subfield><subfield code="c">[2020]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xx, 204 Seiten</subfield><subfield code="b">Illustrationen</subfield><subfield code="c">24 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Synthesis lectures on communication networks</subfield><subfield code="v">23</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Part of: Synthesis digital library of engineering and computer science</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1. Introduction -- 2. Age of information in queueing networks -- 3. Age of information in broadcast wireless networks -- 4. Age of information in general wireless networks -- 5. Age of information and sampling</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Information usually has the highest value when it is fresh. For example, real-time knowledge about the location, orientation, and speed of motor vehicles is imperative in autonomous driving, and the access to timely information about stock prices and interest rate movements is essential for developing trading strategies on the stock market. The Age of Information (AoI) concept, together with its recent extensions, provides a means of quantifying the freshness of information and an opportunity to improve the performance of real-time systems and networks. Recent research advances on AoI suggest that many well-known design principles of traditional data networks (for, e.g., providing high throughput and low delay) need to be re-examined for enhancing information freshness in rapidly emerging real-time applications. This book provides a suite of analytical tools and insightful results on the generation of information-update packets at the source nodes and the design of network protocols forwarding the packets to their destinations. The book also points out interesting connections between AoI concept and information theory, signal processing, and control theory, which are worthy of future investigation.--Provided by publisher</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Echtzeit</subfield><subfield code="0">(DE-588)1041838212</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Metrik</subfield><subfield code="0">(DE-588)4039002-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information theory</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Information theory</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Metrik</subfield><subfield code="0">(DE-588)4039002-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informationstheorie</subfield><subfield code="0">(DE-588)4026927-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Echtzeit</subfield><subfield code="0">(DE-588)1041838212</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kadota, Igor</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1210076160</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Talak, Rajat</subfield><subfield code="d">19XX-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1210076357</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Modiano, Eytan</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1030406421</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Synthesis lectures on communication networks</subfield><subfield code="v">23</subfield><subfield code="w">(DE-604)BV042174944</subfield><subfield code="9">23</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031830048&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031830048</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ieeexplore.ieee.org/servlet/opac?bknumber=8940930</subfield><subfield code="l">FHI01</subfield><subfield code="p">ZDB-105-MCS</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046417559 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:44:04Z |
| institution | BVB |
| isbn | 9781681736785 1681736780 9781681736808 1681736802 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031830048 |
| oclc_num | 1164656893 |
| open_access_boolean | |
| owner | DE-739 DE-573 |
| owner_facet | DE-739 DE-573 |
| physical | xx, 204 Seiten Illustrationen 24 cm |
| psigel | ZDB-105-MCS |
| publishDate | 2020 |
| publishDateSearch | 2020 |
| publishDateSort | 2020 |
| publisher | Morgan & Claypool |
| record_format | marc |
| series | Synthesis lectures on communication networks |
| series2 | Synthesis lectures on communication networks |
| spelling | Sun, Yin ca. 20./21. Jd. Verfasser (DE-588)1210076020 aut Age of information a new metric for information freshness Yin Sun, Igor Kadota, Rajat Talak, Eytan Modiano [San Rafael, California] Morgan & Claypool [2020] xx, 204 Seiten Illustrationen 24 cm txt rdacontent n rdamedia nc rdacarrier Synthesis lectures on communication networks 23 Part of: Synthesis digital library of engineering and computer science 1. Introduction -- 2. Age of information in queueing networks -- 3. Age of information in broadcast wireless networks -- 4. Age of information in general wireless networks -- 5. Age of information and sampling Information usually has the highest value when it is fresh. For example, real-time knowledge about the location, orientation, and speed of motor vehicles is imperative in autonomous driving, and the access to timely information about stock prices and interest rate movements is essential for developing trading strategies on the stock market. The Age of Information (AoI) concept, together with its recent extensions, provides a means of quantifying the freshness of information and an opportunity to improve the performance of real-time systems and networks. Recent research advances on AoI suggest that many well-known design principles of traditional data networks (for, e.g., providing high throughput and low delay) need to be re-examined for enhancing information freshness in rapidly emerging real-time applications. This book provides a suite of analytical tools and insightful results on the generation of information-update packets at the source nodes and the design of network protocols forwarding the packets to their destinations. The book also points out interesting connections between AoI concept and information theory, signal processing, and control theory, which are worthy of future investigation.--Provided by publisher Echtzeit (DE-588)1041838212 gnd rswk-swf Informationstheorie (DE-588)4026927-9 gnd rswk-swf Metrik (DE-588)4039002-0 gnd rswk-swf Real-time data processing Information theory Metrik (DE-588)4039002-0 s Informationstheorie (DE-588)4026927-9 s Echtzeit (DE-588)1041838212 s DE-604 Kadota, Igor Sonstige (DE-588)1210076160 oth Talak, Rajat 19XX- Sonstige (DE-588)1210076357 oth Modiano, Eytan Sonstige (DE-588)1030406421 oth Synthesis lectures on communication networks 23 (DE-604)BV042174944 23 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031830048&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Sun, Yin ca. 20./21. Jd Age of information a new metric for information freshness Synthesis lectures on communication networks 1. Introduction -- 2. Age of information in queueing networks -- 3. Age of information in broadcast wireless networks -- 4. Age of information in general wireless networks -- 5. Age of information and sampling Echtzeit (DE-588)1041838212 gnd Informationstheorie (DE-588)4026927-9 gnd Metrik (DE-588)4039002-0 gnd |
| subject_GND | (DE-588)1041838212 (DE-588)4026927-9 (DE-588)4039002-0 |
| title | Age of information a new metric for information freshness |
| title_auth | Age of information a new metric for information freshness |
| title_exact_search | Age of information a new metric for information freshness |
| title_full | Age of information a new metric for information freshness Yin Sun, Igor Kadota, Rajat Talak, Eytan Modiano |
| title_fullStr | Age of information a new metric for information freshness Yin Sun, Igor Kadota, Rajat Talak, Eytan Modiano |
| title_full_unstemmed | Age of information a new metric for information freshness Yin Sun, Igor Kadota, Rajat Talak, Eytan Modiano |
| title_short | Age of information |
| title_sort | age of information a new metric for information freshness |
| title_sub | a new metric for information freshness |
| topic | Echtzeit (DE-588)1041838212 gnd Informationstheorie (DE-588)4026927-9 gnd Metrik (DE-588)4039002-0 gnd |
| topic_facet | Echtzeit Informationstheorie Metrik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031830048&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV042174944 |
| work_keys_str_mv | AT sunyin ageofinformationanewmetricforinformationfreshness AT kadotaigor ageofinformationanewmetricforinformationfreshness AT talakrajat ageofinformationanewmetricforinformationfreshness AT modianoeytan ageofinformationanewmetricforinformationfreshness |