Universal routing strategies:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
1996
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 202 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011735506 | ||
| 003 | DE-604 | ||
| 005 | 19980519 | ||
| 007 | t | ||
| 008 | 980127s1996 m||| 00||| engod | ||
| 016 | 7 | |a 953115151 |2 DE-101 | |
| 035 | |a (OCoLC)245656348 | ||
| 035 | |a (DE-599)BVBBV011735506 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-355 |a DE-634 |a DE-11 | ||
| 084 | |a DAT 252d |2 stub | ||
| 084 | |a DAT 258d |2 stub | ||
| 100 | 1 | |a Scheideler, Christian |d 1968- |e Verfasser |0 (DE-588)122498909 |4 aut | |
| 245 | 1 | 0 | |a Universal routing strategies |c von Christian Scheideler |
| 264 | 1 | |c 1996 | |
| 300 | |a X, 202 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Paderborn, Univ.-Gesamthochsch., Diss., 1996 | ||
| 650 | 4 | |a Routing | |
| 650 | 0 | 7 | |a Routing |0 (DE-588)4269073-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Routing |0 (DE-588)4269073-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007916644&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007916644 | ||
Datensatz im Suchindex
| _version_ | 1804126276455235584 |
|---|---|
| adam_text | Titel: Universal routing strategies
Autor: Scheideler, Christian
Jahr: 1996
Contents
1 Introduction 1
1.1 The Emergence of Parallel Systems 1
1.2 Theoretical Research in Parallel Computing 2
1.3 History of Routing 3
1.4 Research Areas related to Routing 6
1.4.1 Parallel Sorting 6
1.4.2 Shop Scheduling 7
1.4.3 Multicommodity Flow 8
1.4.4 Network Emulations 8
1.4.5 Shared Memory Simulations 9
1.4.6 Load Balancing 10
1.5 Main Contributions of this Book 11
2 Communication Mechanisms used in Practice 13
2.1 Multiplexing 13
2.2 Switching Elements 14
2.2.1 Circuit Switches 14
2.2.2 Packet Switches 14
2.3 Local Area Networks (LAN) 15
2.3.1 The Ethernet 16
2.3.2 The Fibre Distributed Data Interface (FDDI) 16
2.4 Wide Area Networks (WAN) 17
2.4.1 The Synchronous Digital Hierarchy (SDH) 17
2.4.2 The Asynchronous Transfer Mode (ATM! 18
2.5 Communication Systems for Parallel Computers 19
2.5.1 Non-Scalable Parallel Computers 19
2.5.2 Scalable Parallel Computers 20
2.6 The OSI Model 20
3 Terminology 23
3.1 Basic Definitions and Inequalities 23
3.2 Basic Definitions in Probability Theory 24
3.3 Basic Definitions in Graph Theory 25
3.4 Basic Definitions in Routing Theory 26
3.4.1 The Hardware Model 26
3.4.2 The Routing Problem 29
3.4.3 Message Passing Models 30
3.4.4 Routing Strategies 31
vii
viii CONTENTS
114.5 Space-Efficient Routing 32
4 Introduction to Store-and-Forward Routing 35
4.1 History of Store-and-Forward Routing 35
4.1.1 Routing in Specific Networks 35
4.1.2 Universal Routing 37
4.2 Optimal Networks for Permutation Routing 38
4.2.1 Optimal Networks for Randomized Routing 38
4.2.2 Optimal Networks for Deterministic Routing 39
5 The Routing Number 41
5.1 Existence of Efficient Path Systems 42
5.2 Valiant s Trick 43
5.3 The Routing Number of Specific Networks 45
5.4 Routing Number vs. Expansion 45
5.5 Computing Efficient Path Systems 46
5.5.1 An Algorithm for Arbitrary Networks 47
5.5.2 An Algorithm for Node-Symmetric Networks 47
5.6 Summary of Main Results 48
6 Offline Routing Protocols 49
6.1 Keeping the Routing Time Low 49
6.2 Keeping the Buffer Size Low 53
6.3 Applications 57
6.3.1 Network Emulations using 1-1 Embeddings 57
6.3.2 Network Emulations using 1-Many Embeddings 58
6.4 Summary of Main Results 60
7 Oblivious Routing Protocols 63
7.1 The Random Rank Protocol 63
7.1.1 Description of the Protocol 63
7.1.2 Applications 65
7.1.3 Limitations 67
7.2 Ranade s Protocol 69
7.2.1 Description of the Protocol 69
7.2.2 Applications 70
7.2.3 Limitations 70
7.3 The Growing Rank Protocol 71
7.3.1 Description of the Protocol 71
7.3.2 Applications 75
7.3.3 Limitations 76
7.4 The Extended Growing Rank Protocol 76
7.4.1 Description of the Protocol 77
7.4.2 Applications 80
7.4.3 Limitations 82
7.5 The Trial-and-Failure Protocol 82
7.5.1 Description of the Protocol 83
7.5.2 Applications 85
7.5.3 Limitations 86
CONTENTS ix
7.G The Duplication Protocol 86
7.6.1 Description of the Protocol 86
7.6.2 Applications 89
7.6.3 Limitations 89
7.7 The. Protocol by Rabani and Tardos 89
7.7.1 Description of the Protocol 90
7.7.2 Applications 93
7.7.3 Limitations 93
7.S The Protocol by Ostrovsky and Rabani 93
7.8.1 Description of the Protocol 93
7.8.2 Applications 94
7.8.3 Limitations 94
7.9 Summary of Main Results 94
8 Adaptive Routing Protocols 97
8.1 Deterministic Routing in Multibutterfties 98
8.1.1 The r-replicated s-ary Multibutterfly 98
8.1.2 Description of the Simple Protocol 99
8.1.3 Analysis of the Simple Protocol 99
8.1.4 Description of the Global Protocol 109
8.1.5 Analysis of the Global Protocol 110
8.2 Universal Adaptive Routing Strategies 113
8.2.1 Greedy Routing Strategies 113
8.2.2 Routing via Sorting 113
8.2.3 Routing via Simulation 114
8.3 Summary of Main Results 116
9 Compact Routing Protocols 117
9.1 History of Compact Routing 117
9.1.1 Relationship between Space, and Stretch Factor 117
9.1.2 Relationship between Space and Slowdown 119
9.2 The Routing via Simulation Strategy 120
9.2.1 Selecting Suitable Routing Structures 121
9.2.2 Space-Efficient Perfect Hashing 122
9.2.3 Design of Compact Routing Tables 122
9.3 Randomized Compact Routing 124
9.3.1 The ( . rf. A-)-Butterfiy 124
9.3.2 The Simulation Strategy 124
9.3.3 Bounding the Congestion and Dilation 128
9.3.4 Applications 130
9.4 Deterministic Compact Routing 131
9.4.1 The Simulation Strategy 132
9.4.2 Applications 134
9.5 Summary of Main Results 134
x CONTENTS
10 Introduction to Wormhole Routing 137
10.1 History of Wormhole Routing 137
10.1.1 Routing in Specific Networks 138
10.1.2 Universal Routing 139
10.2 Upper and Lower Bounds 139
11 Oblivious Routing Protocols 141
11.1 The Trial-and-Failtire Protocol 141
11.1.1 Wormhole Routing in Meshes and Tori 142
11.1.2 Wormhole Routing in Butterflies 143
11.1.3 Further Applications 148
11.2 The Duplication Protocol 149
11.3 Summary of Main Results 150
12 Protocols for All-Optical Networks 151
12.1 An All-Optical Hardware Model 151
12.2 Overview on All-Optical Routing 152
12.3 A Simple, Efficient Protocol 154
12.3.1 Applications 156
12.4 Proof of Theorems 12.1 and 12.3 157
12.4.1 The Upper Bound 157
12.4.2 The Lower Bound 163
12.5 Proof of Theorem 12.2 170
12.5.1 The Upper Bound 170
12.5.2 The Lower Bound 175
13 Summary and Future Directions 177
13.1 Sfore-and-Forward Routing 177
13.1.1 Path Selection 178
13.1.2 Offline Routing 178
13.1.3 Oblivious Routing 178
13.1.4 Adaptive Routing 179
13.1.5 Compact Routing 180
13.2 Wormhole Routing 180
13.3 Future Directions 181
13.3.1 Dynamic Routing 181
13.3.2 Routing in Faulty and Dynamic Networks 183
13.3.3 Scheduling .. ..... 184
Bibliography 187
|
| any_adam_object | 1 |
| author | Scheideler, Christian 1968- |
| author_GND | (DE-588)122498909 |
| author_facet | Scheideler, Christian 1968- |
| author_role | aut |
| author_sort | Scheideler, Christian 1968- |
| author_variant | c s cs |
| building | Verbundindex |
| bvnumber | BV011735506 |
| classification_tum | DAT 252d DAT 258d |
| ctrlnum | (OCoLC)245656348 (DE-599)BVBBV011735506 |
| discipline | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01298nam a2200361 c 4500</leader><controlfield tag="001">BV011735506</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980519 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980127s1996 m||| 00||| engod</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">953115151</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)245656348</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011735506</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 252d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 258d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Scheideler, Christian</subfield><subfield code="d">1968-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122498909</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Universal routing strategies</subfield><subfield code="c">von Christian Scheideler</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 202 S.</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="502" ind1=" " ind2=" "><subfield code="a">Paderborn, Univ.-Gesamthochsch., Diss., 1996</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Routing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Routing</subfield><subfield code="0">(DE-588)4269073-0</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">Routing</subfield><subfield code="0">(DE-588)4269073-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</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=007916644&sequence=000002&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-007916644</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV011735506 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:14:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007916644 |
| oclc_num | 245656348 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-355 DE-BY-UBR DE-634 DE-11 |
| owner_facet | DE-91 DE-BY-TUM DE-355 DE-BY-UBR DE-634 DE-11 |
| physical | X, 202 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| spelling | Scheideler, Christian 1968- Verfasser (DE-588)122498909 aut Universal routing strategies von Christian Scheideler 1996 X, 202 S. txt rdacontent n rdamedia nc rdacarrier Paderborn, Univ.-Gesamthochsch., Diss., 1996 Routing Routing (DE-588)4269073-0 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Routing (DE-588)4269073-0 s DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007916644&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Scheideler, Christian 1968- Universal routing strategies Routing Routing (DE-588)4269073-0 gnd |
| subject_GND | (DE-588)4269073-0 (DE-588)4113937-9 |
| title | Universal routing strategies |
| title_auth | Universal routing strategies |
| title_exact_search | Universal routing strategies |
| title_full | Universal routing strategies von Christian Scheideler |
| title_fullStr | Universal routing strategies von Christian Scheideler |
| title_full_unstemmed | Universal routing strategies von Christian Scheideler |
| title_short | Universal routing strategies |
| title_sort | universal routing strategies |
| topic | Routing Routing (DE-588)4269073-0 gnd |
| topic_facet | Routing Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007916644&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT scheidelerchristian universalroutingstrategies |