Performance optimization technologies for software defined industrial networks:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Passau
[2021]
|
| Schlagworte: | |
| Online-Zugang: | kostenfrei kostenfrei Inhaltsverzeichnis |
| Beschreibung: | xxi, 173 Seiten Illustrationen, Diagramme |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV047295854 | ||
| 003 | DE-604 | ||
| 005 | 20210621 | ||
| 007 | t | ||
| 008 | 210525s2021 a||| m||| 00||| eng d | ||
| 035 | |a (OCoLC)1256407369 | ||
| 035 | |a (DE-599)BVBBV047295854 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-473 |a DE-703 |a DE-1051 |a DE-824 |a DE-29 |a DE-12 |a DE-91 |a DE-19 |a DE-1049 |a DE-92 |a DE-739 |a DE-898 |a DE-355 |a DE-706 |a DE-20 |a DE-1102 |a DE-860 |a DE-2174 | ||
| 084 | |a ST 237 |0 (DE-625)143623: |2 rvk | ||
| 100 | 1 | |a Ansah, Frimpong |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Performance optimization technologies for software defined industrial networks |c Frimpong Ansah |
| 264 | 1 | |a Passau |c [2021] | |
| 264 | 4 | |c ©2021 | |
| 300 | |a xxi, 173 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |b Dissertation |c Universität Passau |d 2021 | ||
| 650 | 0 | 7 | |a Petri-Netz |0 (DE-588)4045388-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Planbarkeitsanalyse |0 (DE-588)4740360-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangennetz |0 (DE-588)4225823-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Planbarkeitsanalyse |0 (DE-588)4740360-3 |D s |
| 689 | 0 | 1 | |a Warteschlangennetz |0 (DE-588)4225823-6 |D s |
| 689 | 0 | 2 | |a Petri-Netz |0 (DE-588)4045388-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |o urn:nbn:de:bvb:739-opus4-9002 |
| 856 | 4 | 1 | |u https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/900 |x Verlag |z kostenfrei |3 Volltext |
| 856 | 4 | 1 | |u https://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-9002 |x Resolving-System |z kostenfrei |3 Volltext |
| 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=032699145&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032699145 | ||
Datensatz im Suchindex
| _version_ | 1804182472225718272 |
|---|---|
| adam_text | CONTENTS LISTINGS xiv List of Figures...................................................................... xv List of Tables........................................................................... xvii ACRONYMS xviii 1 2 INTRODUCTION I 1.1 Thesis contribution ...................................................... 1.1.1 Network programmability................................. 1.1.2 QoS guarantee in SDIN...................................... 1.1.3 Deployment architectures................................... 1.2 Structure of thesis......................................................... շ 3 4 5 5 INDUSTRIAL CONCERNS AND NETWORKPROGRAMMA BILITY 2.1 Industrial networks...................................................... 2.2 Background, requirements and concerns...................... 2.3 Evolvability concerns.................................................... 2.4 Key to evolution of industrial networks........................ 2.4.1 Basic principles of programmable networks ... 2.5 Control and forwarding function separation................ 2.5.1 Principles of ForCES.................................... 18 2.5.2 Principles of SDN .............................................. 2.6 Comparison of SDN and ForCES principles................ 2.6.1 Principle of control/forwarding function Separation 2.6.2 Concept of shared resource......................... 24 2.6.3 Abstraction and virtualization.................... 25 2.6.4 Service creation............................................ 25 2.6.5 Evolvability/ adaptability............................ 27 2.6.6 Long-term capital
expenditure.................... 29 2.7 SDN-enabled industrial networks................................. 2.8 Summary and bibliographic comments........................ 2.8.1 Bibliographic comments............................... 31 2.8.2 Chapter summary....................................... 32 3 9 10 11 14 15 17 17 21 23 23 29 31 SDIN‘.SERVICE PROVISIONING ENABLERS 33 3.1 Network slicing and the VNE problem........................ 3.1.1 Basic concept of the VNE problem............... 35 3.1.2 Formulation of VNE problem....................... 36 3.1.3 VNE application domains............................ 37 3.1.4 FSFD and ARFEVLiM use-case in SDN............ 3.2 Deploying VNE in production-grade SDIN ................ 3.2.1 Designing online QoS-aware VLiM problem ... 3.2.2 Resource, attributes and constraint relation in VNE problem........................................................ 41 3.3 Designing QoS-aware VLiM algorithms ...................... 34 38 39 40 42 xi
ХІІ CONTENTS 3.3.1 Efficiency or efficacy ............................................. 3.3.2 Time Complexities of VNE algorithms............... 3.4 Accuracy of solutions produced by VNE algorithms . . 3.4.1 Worst-case delay computation for VLiM problem 3.4.2 Trajectory approach to Worst-case delay analysis 3.5 Summary of chapter and bibliographic comments ... 3.5.1 Bibliographic comments.......................................... 3.5.2 Chapter summary................................................... 4 MODELING DELAY IN TSN-ENABLED INFRASTRUCTURE 4.1 Use-case: TSN-enabled SDIN................................................ 4.2 Mathematical model of TSN nodes.................................... 4.2.1 Behavioral analysis of TSN forwarding mechanisms 4.3 Modeling the delay of deterministic services..................... 4.3.1 Trajectory approach................................................... 4.3.2 Tandem composition for converged ОТ and IT . 4.4 Slicing for deterministic applications................................. 4.4.1 Network slice creation process................................. 4.4.2 TSN substrate network model................................. 4.4.3 Role of decision functions in embedding process 4.5 Summary of chapter and bibliographiccomments ... 4.5.1 Bibliographic comments............................................. 4.5.2 Summary of chapter.................................................. 5 DESIGNING VNE ALGORITHMS FOR SDIN-ENABLED TSN 5.1 Algorithms for multi-constrained VLiM problem .... 5.1.1 Shortest path first
approach....................................... 5.1.2 Demand-based approach.......................................... 5.1.3 Designing DBA algorithm for online VLiM prob lem ................................................................................ 5.2 Application topology-aware VNE....................................... 5.2.1 Application and Communication Relation .... 5.2.2 Tree mapping algorithm............................................. 5.3 Overview of time-aware scheduling inTSN...................... 5.4 Slicing with Time-Scheduling in Focus.............................. 5.4.1 TAS terminologies and formal scheduling con straints .......................................................................... 5.4.2 Scheduling problem definition and network models 5.4.3 Schedulability analysis and verification algorithms 5.4.4 Utilization condition................................................... 5.4.5 Verifying the schedulability of the scheduling sys tem ................................................................................ 5.4.6 Schedule-aware VN mapping.................................... 5.5 GCL event computation......................................................... 5.6 Summary of chapter and bibliographiccomments ... 5.6.1 Bibliographic comments . . . .................................... 5.6.2 Summary of chapter................................................... 6 EVALUATION OF VNE ALGORITHMS IN SDIN 43 43 44 45 46 48 48 50 51 51 52 53 56 56 60 62 63 64 65 65 65 67 69 69 70 72 73 75 75 76 77 79 79 81 82 83 84 86 87 93 93 93 95
CONTENTS 6.1 Evaluation of VLiM algorithms................................... 95 6.1.1 Evaluation environment and ALEVIN extension 96 6.2 Evaluation of demand-based mapping algorithms ... 96 6.2.1 FSFD use-case for VLiM...................................... 96 6.2.2 Analysis of results.............................................. 99 6.3 Evaluation of delay admission constraint...................... 103 6.3.1 Simulation and analysis of delay verification models 103 6.3.2 Analysis of results.............................................. 105 6.4 Evaluation of tree mapping algorithms......................... 108 6.5 Evaluation of time-aware slicing algorithms................ 110 6.5.1 Evaluating schedulability algorithm ................ 110 6.5.2 Complexity analysis of time schedule computa tion algorithm...................................................... 111 7 PERFORMANCE ANALYSIS OF SDIN-ENABLED TSN DE PLOYMENT ИЗ 7.1 Overview of TSN deployment and challenges.............. 113 7.1.1 Fully decentralized deployment........................ 113 7.1.2 Fully centralized deployment.............................. 116 7.1.3 Hybrid deployment............................................ 116 7.1.4 SDIN: hybrid deployment model ...................... 117 7.2 Qualitative performance analysis of TSN deployment models............................................................................ 121 7.2.1 Benefits and deficiencies of DRM ...................... 121 7.2.2 Merits and deficiencies of SDIN-enabled HRM . 121 7.3 Quantitative performance analysis of DRM and
SDINHRM............................................................................... 122 7.3.1 Performance theory construction........................ 122 7.4 Modeling methodology and DRM/SDIN-HRM models 123 7.4.1 Petri-Nets analysis.............................................. 124 7.4.2 Queuing network analysis ................................. 125 7.5 Performance workflow and analysis.............................. 126 7.5.1 Design of PN-QN performance models.............. 128 7.5.2 Modeling DRM.................................................... 128 7.5.3 Modeling SDIN-HRM......................................... 131 7.6 Evaluation of DRM/SDIN-HRM PN-QN models .... 132 7.6.1 Evaluation Metrics.............................................. 132 7.6.2 Evaluation Environment...................................... 133 7.7 Results analysis and validation ................................... 134 7.7.1 Result validation................................................. 140 7.8 Summary of chapter and bibliographic comments . . . 141 7.8.1 Bibliographic Comments................................... 141 7.8.2 Summary of chapter........................................... 143 8 conclusions 145 8.1 Summary of thesis......................................................... 145 8.2 Lessons learned and impact......................................... 146 8.2.1 Analysis of programmable networks ............... 147 xiii
xiv CONTENTS 8.2.2 QoS provisioning and the VNE problem........... 147 8.2.3 Flexible deployment of TSN infrastructure .... 148 8.3 Outlook......................................................................... 148 A APPENDIX A.i ForCES Requirements................................................... 151 Requirement of Fp.............................................. 151 a. 1.2 Requirement of FE and FE models...................... 151 TSN Standards and key features................................... 152 Substrate Network and Slice Request models............. 153 MSRP and SDIN-HRM Data Models.......................... 154 A.1.1 A.2 A.3 A.4 I5I
|
| adam_txt |
CONTENTS LISTINGS xiv List of Figures. xv List of Tables. xvii ACRONYMS xviii 1 2 INTRODUCTION I 1.1 Thesis contribution . 1.1.1 Network programmability. 1.1.2 QoS guarantee in SDIN. 1.1.3 Deployment architectures. 1.2 Structure of thesis. շ 3 4 5 5 INDUSTRIAL CONCERNS AND NETWORKPROGRAMMA BILITY 2.1 Industrial networks. 2.2 Background, requirements and concerns. 2.3 Evolvability concerns. 2.4 Key to evolution of industrial networks. 2.4.1 Basic principles of programmable networks . 2.5 Control and forwarding function separation. 2.5.1 Principles of ForCES. 18 2.5.2 Principles of SDN . 2.6 Comparison of SDN and ForCES principles. 2.6.1 Principle of control/forwarding function Separation 2.6.2 Concept of shared resource. 24 2.6.3 Abstraction and virtualization. 25 2.6.4 Service creation. 25 2.6.5 Evolvability/ adaptability. 27 2.6.6 Long-term capital
expenditure. 29 2.7 SDN-enabled industrial networks. 2.8 Summary and bibliographic comments. 2.8.1 Bibliographic comments. 31 2.8.2 Chapter summary. 32 3 9 10 11 14 15 17 17 21 23 23 29 31 SDIN‘.SERVICE PROVISIONING ENABLERS 33 3.1 Network slicing and the VNE problem. 3.1.1 Basic concept of the VNE problem. 35 3.1.2 Formulation of VNE problem. 36 3.1.3 VNE application domains. 37 3.1.4 FSFD and ARFEVLiM use-case in SDN. 3.2 Deploying VNE in production-grade SDIN . 3.2.1 Designing online QoS-aware VLiM problem . 3.2.2 Resource, attributes and constraint relation in VNE problem. 41 3.3 Designing QoS-aware VLiM algorithms . 34 38 39 40 42 xi
ХІІ CONTENTS 3.3.1 Efficiency or efficacy . 3.3.2 Time Complexities of VNE algorithms. 3.4 Accuracy of solutions produced by VNE algorithms . . 3.4.1 Worst-case delay computation for VLiM problem 3.4.2 Trajectory approach to Worst-case delay analysis 3.5 Summary of chapter and bibliographic comments . 3.5.1 Bibliographic comments. 3.5.2 Chapter summary. 4 MODELING DELAY IN TSN-ENABLED INFRASTRUCTURE 4.1 Use-case: TSN-enabled SDIN. 4.2 Mathematical model of TSN nodes. 4.2.1 Behavioral analysis of TSN forwarding mechanisms 4.3 Modeling the delay of deterministic services. 4.3.1 Trajectory approach. 4.3.2 Tandem composition for converged ОТ and IT . 4.4 Slicing for deterministic applications. 4.4.1 Network slice creation process. 4.4.2 TSN substrate network model. 4.4.3 Role of decision functions in embedding process 4.5 Summary of chapter and bibliographiccomments . 4.5.1 Bibliographic comments. 4.5.2 Summary of chapter. 5 DESIGNING VNE ALGORITHMS FOR SDIN-ENABLED TSN 5.1 Algorithms for multi-constrained VLiM problem . 5.1.1 Shortest path first
approach. 5.1.2 Demand-based approach. 5.1.3 Designing DBA algorithm for online VLiM prob lem . 5.2 Application topology-aware VNE. 5.2.1 Application and Communication Relation . 5.2.2 Tree mapping algorithm. 5.3 Overview of time-aware scheduling inTSN. 5.4 Slicing with Time-Scheduling in Focus. 5.4.1 TAS terminologies and formal scheduling con straints . 5.4.2 Scheduling problem definition and network models 5.4.3 Schedulability analysis and verification algorithms 5.4.4 Utilization condition. 5.4.5 Verifying the schedulability of the scheduling sys tem . 5.4.6 Schedule-aware VN mapping. 5.5 GCL event computation. 5.6 Summary of chapter and bibliographiccomments . 5.6.1 Bibliographic comments . . . . 5.6.2 Summary of chapter. 6 EVALUATION OF VNE ALGORITHMS IN SDIN 43 43 44 45 46 48 48 50 51 51 52 53 56 56 60 62 63 64 65 65 65 67 69 69 70 72 73 75 75 76 77 79 79 81 82 83 84 86 87 93 93 93 95
CONTENTS 6.1 Evaluation of VLiM algorithms. 95 6.1.1 Evaluation environment and ALEVIN extension 96 6.2 Evaluation of demand-based mapping algorithms . 96 6.2.1 FSFD use-case for VLiM. 96 6.2.2 Analysis of results. 99 6.3 Evaluation of delay admission constraint. 103 6.3.1 Simulation and analysis of delay verification models 103 6.3.2 Analysis of results. 105 6.4 Evaluation of tree mapping algorithms. 108 6.5 Evaluation of time-aware slicing algorithms. 110 6.5.1 Evaluating schedulability algorithm . 110 6.5.2 Complexity analysis of time schedule computa tion algorithm. 111 7 PERFORMANCE ANALYSIS OF SDIN-ENABLED TSN DE PLOYMENT ИЗ 7.1 Overview of TSN deployment and challenges. 113 7.1.1 Fully decentralized deployment. 113 7.1.2 Fully centralized deployment. 116 7.1.3 Hybrid deployment. 116 7.1.4 SDIN: hybrid deployment model . 117 7.2 Qualitative performance analysis of TSN deployment models. 121 7.2.1 Benefits and deficiencies of DRM . 121 7.2.2 Merits and deficiencies of SDIN-enabled HRM . 121 7.3 Quantitative performance analysis of DRM and
SDINHRM. 122 7.3.1 Performance theory construction. 122 7.4 Modeling methodology and DRM/SDIN-HRM models 123 7.4.1 Petri-Nets analysis. 124 7.4.2 Queuing network analysis . 125 7.5 Performance workflow and analysis. 126 7.5.1 Design of PN-QN performance models. 128 7.5.2 Modeling DRM. 128 7.5.3 Modeling SDIN-HRM. 131 7.6 Evaluation of DRM/SDIN-HRM PN-QN models . 132 7.6.1 Evaluation Metrics. 132 7.6.2 Evaluation Environment. 133 7.7 Results analysis and validation . 134 7.7.1 Result validation. 140 7.8 Summary of chapter and bibliographic comments . . . 141 7.8.1 Bibliographic Comments. 141 7.8.2 Summary of chapter. 143 8 conclusions 145 8.1 Summary of thesis. 145 8.2 Lessons learned and impact. 146 8.2.1 Analysis of programmable networks . 147 xiii
xiv CONTENTS 8.2.2 QoS provisioning and the VNE problem. 147 8.2.3 Flexible deployment of TSN infrastructure . 148 8.3 Outlook. 148 A APPENDIX A.i ForCES Requirements. 151 Requirement of Fp. 151 a. 1.2 Requirement of FE and FE models. 151 TSN Standards and key features. 152 Substrate Network and Slice Request models. 153 MSRP and SDIN-HRM Data Models. 154 A.1.1 A.2 A.3 A.4 I5I |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Ansah, Frimpong |
| author_facet | Ansah, Frimpong |
| author_role | aut |
| author_sort | Ansah, Frimpong |
| author_variant | f a fa |
| building | Verbundindex |
| bvnumber | BV047295854 |
| classification_rvk | ST 237 |
| collection | ebook |
| ctrlnum | (OCoLC)1256407369 (DE-599)BVBBV047295854 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02037nam a2200433 c 4500</leader><controlfield tag="001">BV047295854</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210621 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">210525s2021 a||| m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1256407369</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047295854</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-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-1102</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-2174</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 237</subfield><subfield code="0">(DE-625)143623:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ansah, Frimpong</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance optimization technologies for software defined industrial networks</subfield><subfield code="c">Frimpong Ansah</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Passau</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxi, 173 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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Universität Passau</subfield><subfield code="d">2021</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Planbarkeitsanalyse</subfield><subfield code="0">(DE-588)4740360-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</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">Planbarkeitsanalyse</subfield><subfield code="0">(DE-588)4740360-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="o">urn:nbn:de:bvb:739-opus4-9002</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/900</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-9002</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</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=032699145&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032699145</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV047295854 |
| illustrated | Illustrated |
| index_date | 2024-07-03T17:21:51Z |
| indexdate | 2024-07-10T09:08:05Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032699145 |
| oclc_num | 1256407369 |
| open_access_boolean | 1 |
| owner | DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-706 DE-20 DE-1102 DE-860 DE-2174 |
| owner_facet | DE-384 DE-473 DE-BY-UBG DE-703 DE-1051 DE-824 DE-29 DE-12 DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-1049 DE-92 DE-739 DE-898 DE-BY-UBR DE-355 DE-BY-UBR DE-706 DE-20 DE-1102 DE-860 DE-2174 |
| physical | xxi, 173 Seiten Illustrationen, Diagramme |
| psigel | ebook |
| publishDate | 2021 |
| publishDateSearch | 2021 |
| publishDateSort | 2021 |
| record_format | marc |
| spelling | Ansah, Frimpong Verfasser aut Performance optimization technologies for software defined industrial networks Frimpong Ansah Passau [2021] ©2021 xxi, 173 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Dissertation Universität Passau 2021 Petri-Netz (DE-588)4045388-1 gnd rswk-swf Planbarkeitsanalyse (DE-588)4740360-3 gnd rswk-swf Warteschlangennetz (DE-588)4225823-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Planbarkeitsanalyse (DE-588)4740360-3 s Warteschlangennetz (DE-588)4225823-6 s Petri-Netz (DE-588)4045388-1 s DE-604 Erscheint auch als Online-Ausgabe urn:nbn:de:bvb:739-opus4-9002 https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/900 Verlag kostenfrei Volltext https://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-9002 Resolving-System kostenfrei Volltext 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=032699145&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Ansah, Frimpong Performance optimization technologies for software defined industrial networks Petri-Netz (DE-588)4045388-1 gnd Planbarkeitsanalyse (DE-588)4740360-3 gnd Warteschlangennetz (DE-588)4225823-6 gnd |
| subject_GND | (DE-588)4045388-1 (DE-588)4740360-3 (DE-588)4225823-6 (DE-588)4113937-9 |
| title | Performance optimization technologies for software defined industrial networks |
| title_auth | Performance optimization technologies for software defined industrial networks |
| title_exact_search | Performance optimization technologies for software defined industrial networks |
| title_exact_search_txtP | Performance optimization technologies for software defined industrial networks |
| title_full | Performance optimization technologies for software defined industrial networks Frimpong Ansah |
| title_fullStr | Performance optimization technologies for software defined industrial networks Frimpong Ansah |
| title_full_unstemmed | Performance optimization technologies for software defined industrial networks Frimpong Ansah |
| title_short | Performance optimization technologies for software defined industrial networks |
| title_sort | performance optimization technologies for software defined industrial networks |
| topic | Petri-Netz (DE-588)4045388-1 gnd Planbarkeitsanalyse (DE-588)4740360-3 gnd Warteschlangennetz (DE-588)4225823-6 gnd |
| topic_facet | Petri-Netz Planbarkeitsanalyse Warteschlangennetz Hochschulschrift |
| url | https://opus4.kobv.de/opus4-uni-passau/frontdoor/index/index/docId/900 https://nbn-resolving.de/urn:nbn:de:bvb:739-opus4-9002 http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032699145&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT ansahfrimpong performanceoptimizationtechnologiesforsoftwaredefinedindustrialnetworks |