Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Stuttgart
Universität Stuttgart, Institut für Kommunikationsnetze und Rechnersysteme
2019
|
| Schriftenreihe: | Communication networks and computer engineering report
no. 118 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | xxii, 198 Seiten Illustrationen, Diagramme |
| ISBN: | 9783938965290 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV046244875 | ||
| 003 | DE-604 | ||
| 005 | 20200831 | ||
| 007 | t | ||
| 008 | 191108s2019 a||| m||| 00||| eng d | ||
| 020 | |a 9783938965290 |9 978-3-938965-29-0 | ||
| 035 | |a (OCoLC)1127296030 | ||
| 035 | |a (DE-599)KXP1677906197 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-634 |a DE-739 | ||
| 084 | |a ZN 6230 |0 (DE-625)157531: |2 rvk | ||
| 100 | 1 | |a Wagner, David |e Verfasser |0 (DE-588)1196031304 |4 aut | |
| 245 | 1 | 0 | |a Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control |c David Wagner |
| 264 | 1 | |a Stuttgart |b Universität Stuttgart, Institut für Kommunikationsnetze und Rechnersysteme |c 2019 | |
| 300 | |a xxii, 198 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Communication networks and computer engineering report |v no. 118 | |
| 502 | |b Dissertation |c Universität Stuttgart |d 2019 | ||
| 650 | 0 | 7 | |a Paketvermittlung |0 (DE-588)4173101-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Überlastkontrolle |0 (DE-588)4521193-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Paketvermittlungsnetz |0 (DE-588)4173102-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | 1 | |a Überlastkontrolle |0 (DE-588)4521193-0 |D s |
| 689 | 0 | 2 | |a Paketvermittlung |0 (DE-588)4173101-3 |D s |
| 689 | 0 | 3 | |a Paketvermittlungsnetz |0 (DE-588)4173102-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 751 | |a Stuttgart |0 (DE-588)4058282-6 |2 gnd |4 uvp | ||
| 830 | 0 | |a Communication networks and computer engineering report |v no. 118 |w (DE-604)BV021539246 |9 118 | |
| 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=031623212&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031623212 | ||
Datensatz im Suchindex
| _version_ | 1804180666398539776 |
|---|---|
| adam_text | Contents Summary Kurzfassung Contents List of Figures iii v vii x List of Tables xiii List of Abbreviations xiv List of Symbols xxi 1 Introduction 1.1 Contributions.......................................................................................................... 1.2 Outline .................................................................................................................... 1 3 4 2 Background 2.1 Wired Broadband Internet Access ........................................................................ 2.1.1 Topologies and Architectures of Internet Service Provider Networks . . 2.1.2 Wired Access Technologies and their Impact onTopologies ................. 2.1.3 Traffic Patternsand Link Dimensioning in Wired AccessNetworks . . 2.2 Packet Scheduling.................................................................................................... 2.2.1 Introduction and Definitions..................................................................... 2.2.2 Packet Scheduling Evolution..................................................................... 2.2.3 Delay Relative to the Perfect Schedule and Fairness of Scheduling Algo rithms .......................................................................................................... 2.2.4 Complexity of Scheduling Algorithms..................................................... 2.2.5 Hierarchical Schedulers ........................................................................... 2.2.6 Rate Limiting Schedulers........................................................................... 2.2.7 Packet
Scheduling of Multi-Class Traffic ............................................... 2.2.8 Best Effort Packet Scheduling at the Edge of Access Networks............. 2.3 Congestion in the Internet........................................................................................ 2.3.1 Introduction to Congestion........................................................................ 2.3.2 General Congestion Control..................................................................... 2.3.3 Prevalenceof Protocol-basedCongestion Controlin the Internet .... 5 5 5 8 10 12 12 17 19 23 24 25 26 27 29 29 31 33 ѴІІ
viii CONTENTS 2.4 Transport Layer Congestion Control..................................................................... 2.4.1 General Principles of Transport Layer Congestion Control Algorithms . 2.4.2 Bandwidth Allocation: Fairness Challenge and Opportunity for Prioritization............................ 2.4.3 Selected Congestion Control Algorithms ............................................... 2.4.4 Relation to Buffer Sizing........................................................................... 3 36 37 40 44 52 Rate Adaptation Considering Traffic Differentiation by Congestion Control during Overload 55 3.1 Motivation................................................................................................................ 55 3.2 Problem Statement................................................................................................. 57 3.3 Concept of Rate Adaptation Considering Traffic Differentiation by Congestion Control during Overload....................................................................................... 57 3.4 Objectives of Rate Adaptation Considering Traffic Differentiation by Congestion Control during Overload....................................................................................... 58 3.4.1 Qualitative Objectives.............................................................................. 59 3.4.2 Quantitative Objectives.............................................................................. 60 3.5 Related Work on Peak- and Overload Management............................................ 63 3.5.1
Definitions................................................................................................. 63 3.5.2 Context of Overload Management.................. 64 3.5.3 Comcast’s Protocol-Agnostic Congestion Management System............. 65 3.5.4 Traffic Management based on Deep Packet Inspection ......................... 66 3.5.5 Congestion Policing based on Congestion Exposure ............................ 68 3.5.6 Congestion Policing Queues..................................................................... 70 3.6 Assumptions and Prerequisites.............................................................................. 72 3.6.1 Regional Access Network Properties........................................................ 72 3.6.2 Packet Scheduler....................................................................................... 74 3.6.3 Traffic Differentiation by Congestion Control......................................... 76 3.6.4 Incentives for Using Background Congestion Control Algorithms ... 77 3.6.5 Information of Subscribers........................................................................ 80 3.7 Algorithm Description .......................................................................................... 80 3.7.1 Definitions................................................................................................. 80 3.7.2 Execution Overview................................................................................. 82 3.7.3 Definition of Load States and Operating Modes...................................... 84 3.7.4 Traffic Type
Recognition........................................................................... 85 3.7.5 State Calculation for Leaf Nodes.............................................................. 87 3.7.6 State Calculations for Inner Nodes........................................................... 88 3.7.7 Calculation of Effective Rates.................................................................. 92 3.8 Rationales for Core Design Decisions.................................................................. 95 3.8.1 Granularity of Operation........................................................................... 96 3.8.2 Extent of State Updates.............................................................................. 97 3.8.3 Filling Up the Rates of Background Traffic............................................ 97 3.8.4 Calculation of Target Rates of Background Leaf Nodes......................... 99 3.8.5 Traffic Type Recognition.............................................................................. 102 3.8.6 Initial Traffic Type........................................................................................108 4 Evaluation 111
CONTENTS 4.1 4.2 4.3 4.4 4.5 4.6 4.7 4.8 5 ix Evaluation of Qualitative Objectives......................................................................... Ill 4.1.1 Network Neutrality........................................................................................ Ill 4.1.2 Sufficient Efficiency.....................................................................................112 4.1.3 Smooth Rate Allocations for ForegroundTraffic ....................................... 113 Performance Evaluation Approach........................................................................... 114 4.2.1 Simulation Utilizing Wide-spread Congestion Control Implementations 115 4.2.2 Simulation Topologies..................................................................................117 4.2.3 Scaling Load................................................................................................. 122 4.2.4 Traffic Models.............................................................................................. 125 4.2.5 Model Parameterization and General Simulation Parameters................... 130 4.2.6 Algorithmic Parameters ...............................................................................131 4.2.7 Reference Scheduler Implementation .........................................................131 Performance Metrics..................................................................................................131 4.3.1 Improved Quality of Service for Foreground Traffic...................................132 4.3.2 Bottleneck Utilization
................................................................................. 132 4.3.3 Fairness of Bandwidth Allocation............................................................... 133 4.3.4 Correct Subscriber Recognition..................................................................134 Performance for Software Updates Traffic...............................................................135 4.4.1 Transfer Times of Foreground Traffic.........................................................136 4.4.2 Bottleneck Utilization ..................................................................................139 4.4.3 Fairness among Foreground Subscribers......................................................143 4.4.4 Fairness among Background Subscribers .................................................. 143 4.4.5 Correct Recognition of Foreground Traffic ............................................... 146 4.4.6 Correct Recognition of Background Traffic............................................... 147 4.4.7 Scenario Conclusion.....................................................................................148 Performance for Video on Demand Streaming Traffic............................................ 149 4.5.1 Transfer Times of Foreground Traffic.........................................................149 4.5.2 Bottleneck Utilization ................................................................................. 152 4.5.3 Scenario conclusion .....................................................................................155 Performance for Web Browsing
Traffic..................................................................... 155 4.6.1 Transfer Times of Foreground Traffic.........................................................155 4.6.2 Bottleneck Utilization ..................................................................................157 4.6.3 Scenario Conclusion.....................................................................................158 Performance for Otherwise Rate-limited GreedyTraffic.......................................... 159 4.7.1 Phases of Constant Recognition.................................................................. 160 4.7.2 Waiting Time................................................................. 161 4.7.3 Bandwidth Allocation ..................................................................................166 4.7.4 Scenario Conclusion..................................................................................... 167 Evaluation Summary................................................................................................. 167 Conclusion and Outlook 171 Bibliography 175 A Acknowledgments 197
|
| any_adam_object | 1 |
| author | Wagner, David |
| author_GND | (DE-588)1196031304 |
| author_facet | Wagner, David |
| author_role | aut |
| author_sort | Wagner, David |
| author_variant | d w dw |
| building | Verbundindex |
| bvnumber | BV046244875 |
| classification_rvk | ZN 6230 |
| ctrlnum | (OCoLC)1127296030 (DE-599)KXP1677906197 |
| discipline | Elektrotechnik / Elektronik / Nachrichtentechnik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02103nam a2200445 cb4500</leader><controlfield tag="001">BV046244875</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200831 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">191108s2019 a||| m||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783938965290</subfield><subfield code="9">978-3-938965-29-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1127296030</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KXP1677906197</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-703</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZN 6230</subfield><subfield code="0">(DE-625)157531:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wagner, David</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1196031304</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control</subfield><subfield code="c">David Wagner</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stuttgart</subfield><subfield code="b">Universität Stuttgart, Institut für Kommunikationsnetze und Rechnersysteme</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxii, 198 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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">Communication networks and computer engineering report</subfield><subfield code="v">no. 118</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Universität Stuttgart</subfield><subfield code="d">2019</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paketvermittlung</subfield><subfield code="0">(DE-588)4173101-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Überlastkontrolle</subfield><subfield code="0">(DE-588)4521193-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Paketvermittlungsnetz</subfield><subfield code="0">(DE-588)4173102-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Überlastkontrolle</subfield><subfield code="0">(DE-588)4521193-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Paketvermittlung</subfield><subfield code="0">(DE-588)4173101-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Paketvermittlungsnetz</subfield><subfield code="0">(DE-588)4173102-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="751" ind1=" " ind2=" "><subfield code="a">Stuttgart</subfield><subfield code="0">(DE-588)4058282-6</subfield><subfield code="2">gnd</subfield><subfield code="4">uvp</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Communication networks and computer engineering report</subfield><subfield code="v">no. 118</subfield><subfield code="w">(DE-604)BV021539246</subfield><subfield code="9">118</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=031623212&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-031623212</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV046244875 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:39:23Z |
| institution | BVB |
| isbn | 9783938965290 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031623212 |
| oclc_num | 1127296030 |
| open_access_boolean | |
| owner | DE-703 DE-634 DE-739 |
| owner_facet | DE-703 DE-634 DE-739 |
| physical | xxii, 198 Seiten Illustrationen, Diagramme |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Universität Stuttgart, Institut für Kommunikationsnetze und Rechnersysteme |
| record_format | marc |
| series | Communication networks and computer engineering report |
| series2 | Communication networks and computer engineering report |
| spelling | Wagner, David Verfasser (DE-588)1196031304 aut Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control David Wagner Stuttgart Universität Stuttgart, Institut für Kommunikationsnetze und Rechnersysteme 2019 xxii, 198 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Communication networks and computer engineering report no. 118 Dissertation Universität Stuttgart 2019 Paketvermittlung (DE-588)4173101-3 gnd rswk-swf Überlastkontrolle (DE-588)4521193-0 gnd rswk-swf Paketvermittlungsnetz (DE-588)4173102-5 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Rechnernetz (DE-588)4070085-9 s Überlastkontrolle (DE-588)4521193-0 s Paketvermittlung (DE-588)4173101-3 s Paketvermittlungsnetz (DE-588)4173102-5 s DE-604 Stuttgart (DE-588)4058282-6 gnd uvp Communication networks and computer engineering report no. 118 (DE-604)BV021539246 118 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=031623212&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Wagner, David Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control Communication networks and computer engineering report Paketvermittlung (DE-588)4173101-3 gnd Überlastkontrolle (DE-588)4521193-0 gnd Paketvermittlungsnetz (DE-588)4173102-5 gnd Rechnernetz (DE-588)4070085-9 gnd |
| subject_GND | (DE-588)4173101-3 (DE-588)4521193-0 (DE-588)4173102-5 (DE-588)4070085-9 (DE-588)4113937-9 |
| title | Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control |
| title_auth | Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control |
| title_exact_search | Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control |
| title_full | Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control David Wagner |
| title_fullStr | Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control David Wagner |
| title_full_unstemmed | Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control David Wagner |
| title_short | Rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control |
| title_sort | rate adaptation for hierarchical packet schedulers considering traffic differentiation by congestion control |
| topic | Paketvermittlung (DE-588)4173101-3 gnd Überlastkontrolle (DE-588)4521193-0 gnd Paketvermittlungsnetz (DE-588)4173102-5 gnd Rechnernetz (DE-588)4070085-9 gnd |
| topic_facet | Paketvermittlung Überlastkontrolle Paketvermittlungsnetz Rechnernetz Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=031623212&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV021539246 |
| work_keys_str_mv | AT wagnerdavid rateadaptationforhierarchicalpacketschedulersconsideringtrafficdifferentiationbycongestioncontrol |