Muutke küpsiste eelistusi

E-raamat: Oblivious Network Routing: Algorithms and Applications

(Florida International University), (Florida International University)
  • Formaat - PDF+DRM
  • Hind: 99,84 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Our increasingly integrated world relies on networks both physical and virtual to transfer goods and information. The Internet is a network of networks that connects people around the world in a real-time manner, but it can be disrupted by massive data flows, diverse traffic patterns, inadequate infrastructure, and even natural disasters and political conflict. Similar challenges exist for transportation and energy distribution networks. There is an urgent need for intelligent and adaptable routing of network flows, and a rich literature has evolved that treats "oblivious network design." This book offers novel computational schemes for efficiently solving routing problems in unpredictable circumstances and proposes some real world applications for them. The versatile routing schemes mathematically guarantee long-term efficiency and are most appropriate for networks with non-deterministic (or oblivious) current and past states.

After an introduction to network design and the importance of routing problems, the book presents mathematical tools needed to construct versatile routing schemes, emphasizing the role of linked hierarchical data structures, both top-down and bottom-up. It then describes two important applications of versatile routing schemes: a secure model for congestion-free content-centric networks (which will play a key role in the future of the Internet) and a novel approach for the distribution of green power resources on a smart electricity grid.

Preface ix
Acknowledgments xiii
Chapter 1 Introduction to Network Design
1(26)
1.1 Single-Source Network Routing Problem
2(10)
1.1.1 Preliminary Definitions
2(1)
Ground Transportation Example
3(2)
1.1.2 Edge Routing Cost
5(5)
1.1.3 Network Routing Cost
10(2)
1.2 General Network Routing Problem
12(4)
Routing Cost Optimization
15(1)
1.3 Oblivious Routing Cost Environment
16(4)
Dynamic Approach
18(1)
Versatile Approach
19(1)
1.4 Fractional versus Integral Routing
20(3)
Routing Cost of the Fractional Solution
22(1)
Obliviousness of the Routing Cost Environment
22(1)
1.5 Summary and Outlook
23(4)
Exercises
24(1)
Suggested Reading
25(2)
Part I Mathematical Foundation
27(66)
Chapter 2 Hierarchical Routing Tools and Data Structures
29(30)
2.1 Preliminary Definitions
30(2)
2.2 Hierarchical Decomposition Tree
32(4)
2.2.1 Hierarchical Decomposition Sequence
32(2)
2.2.2 Tree Definition
34(2)
2.3 Hierarchical Independence Tree Type-1
36(11)
2.3.1 Independent Set of Vertices
36(2)
2.3.2 HIT Definition and Properties
38(6)
2.3.3 Induced Partitions of HIT
44(3)
2.4 Hierarchical Independence Tree Type-2
47(4)
2.5 Hierarchical Independence Tree Type-0
51(4)
2.6 Summary and Outlook
55(4)
Exercises
55(2)
Suggested Reading
57(2)
Chapter 3 Routing Schemes in Oblivious Network Design
59(34)
3.1 A Top-Down Versatile Routing Scheme
59(23)
3.1.1 Routing Problem Specification
61(1)
3.1.2 Padded Hierarchical Decomposition Sequence
61(2)
Fakcharoenphol's Algorithm
63(6)
3.1.3 The Routing Scheme Construction
69(1)
Fractional Scheme
70(3)
Integral Scheme
73(3)
3.1.4 Routing Cost Analysis
76(5)
Competitive Ratio of the Integral Scheme
81(1)
3.2 A Bottom-Up Versatile Routing Scheme
82(7)
3.2.1 Problem Specification
83(1)
3.2.2 Scheme Construction
84(1)
Solution Cost Analysis
85(4)
3.3 Summary and Outlook
89(4)
Exercises
89(1)
Suggested Reading
90(3)
Part II Applications
93(60)
Chapter 4 A Secure Versatile Model of Content-Centric Networks
95(28)
4.1 Security Preliminaries
96(2)
Confidentiality
96(1)
Integrity
96(1)
Availability
97(1)
Privacy
97(1)
Host-Oblivious Security Schemes
97(1)
4.2 The Hybrid Model Description
98(5)
Phase 0 Key Distribution
100(1)
Phase 1 Requesting Content
101(1)
Responding to the Request
102(1)
Phase 3 Choosing the Supplying Device
102(1)
Phase 4 Data Transmission
102(1)
4.3 Message Forwarding in the Routing Nodes
103(4)
Forwarding REQ and NOTIF
103(2)
Forwarding REG and ACK
105(1)
Forwarding DATA
105(2)
4.4 Oblivious Routing Problem Specification
107(5)
4.4.1 Definitions
107(1)
4.4.2 Graph Representation of the Hybrid Model
108(2)
4.4.3 Oblivious Routing Cost Environment
110(2)
4.5 A Versatile Routing Scheme
112(2)
Busch's Randomized Algorithm
112(2)
4.6 Node Congestion Prevention
114(5)
4.6.1 Preliminary Definitions
115(1)
4.6.2 The Expected Competitive Ratio
116(3)
4.7 Routing Cost Analysis
119(3)
4.8 Summary and Outlook
122(1)
Exercises
122(1)
Suggested Reading
122(1)
Chapter 5 Versatile Distribution of Green Power Resources
123(30)
5.1 Introduction
124(3)
A Residential Electricity System
124(3)
5.2 Electricity System Reliability
127(11)
5.2.1 Stochastic Processes
128(1)
5.2.2 Modeling with Stochastic Processes
129(2)
5.2.3 Reliability Analysis
131(1)
Impact of Auxiliary Power Plants on System Reliability
132(6)
5.3 Analysis of the Energy Distribution Cost
138(6)
5.3.1 Global Controller
139(1)
Step 1
140(1)
Step 2
140(2)
Step 3
142(1)
5.3.2 Energy Flow Cost Function
142(1)
Edge Cost Function
143(1)
5.4 Cost Optimization of Energy Distribution
144(7)
5.4.1 Computation of Energy Flow Values Using Rosen's Method
146(4)
5.4.2 Competitive Ratio of Cost Distribution
150(1)
5.5 Summary and Outlook
151(2)
Exercises
151(1)
Suggested Reading
151(2)
Bibliography 153(4)
Index 157