Next-Generation Internet: Architectures and Protocols

Cover......Page 1
Half-title......Page 3
Title......Page 5
Copyright......Page 6
Dedication......Page 7
Contents......Page 9
Contributors......Page 18
Book organization......Page 21
Acknowledgements......Page 25
Part I Enabling technologies......Page 27
1 Optical switching fabrics for terabit packet switches......Page 29
1.1 Optical switching fabrics......Page 31
1.1.1 Wavelength-selective (WS) architecture......Page 33
1.1.2 Wavelength-routing (WR) architecture......Page 34
1.1.3 Plane-switching (PS) architecture......Page 35
1.2 Modeling optical devices......Page 36
1.2.1 Physical model......Page 37
1.2.2 Device characterization......Page 38
1.2.3 Multi-plane-specific issues......Page 41
1.3 Scalability analysis......Page 42
1.4 Cost analysis......Page 44
1.5.1 Scalability of the aggregate switching bandwidth......Page 47
1.5.2 CAPEX estimation......Page 49
1.6 Conclusions......Page 50
References......Page 51
2.1.1 Current broadband access solutions......Page 53
2.1.2 Passive Optical Network (PON)......Page 54
2.1.3 Extending the reach: Long-Reach PON (LR-PON)......Page 56
2.2.1 Enabling technologies......Page 58
2.2.2 Demonstrations of LR-PON......Page 59
2.3.2 Resource allocation: DBA with Multi-Thread Polling......Page 60
2.3.3 Traffic management: behavior-aware user assignment......Page 61
2.4.1 WOBAN architecture......Page 62
2.4.2 Motivation of WOBAN......Page 63
2.4.3 Research challenges in WOBAN......Page 64
References......Page 65
3.1 Introduction......Page 68
3.2 Overview of optical control plane design......Page 69
3.2.2 GMPLS routing protocol......Page 70
3.2.3 GMPLS signaling protocol......Page 72
3.3 IP-over-WDM networking architecture......Page 73
3.3.2 The peer and augmented models......Page 74
3.4 A new approach to optical control plane design: an optical layer-based unified control plane architecture......Page 75
3.4.1 Node architecture for the unified control plane......Page 76
3.4.2 Optical layer-based provisioning......Page 77
References......Page 94
4.1 Introduction......Page 98
4.2.1 Background......Page 99
4.2.2 Approach......Page 100
4.2.3 Benefits......Page 103
4.2.4 Protocol architecture......Page 104
4.3.1 Background......Page 105
4.3.2 Approach......Page 106
4.3.3 Benefits......Page 109
4.4 Conclusion......Page 110
References......Page 111
5.1 Introduction......Page 114
5.2.1 Grid Computing......Page 115
5.2.2 Lambda Grid networks......Page 116
5.3 Cloud Computing......Page 117
5.4.2 Optical network testbeds and projects......Page 118
5.4.3 Computational resources......Page 120
5.5 Scheduling......Page 121
5.6.1 Studies on OCS-based Grids......Page 124
5.6.2 Studies on OBS-based Grids......Page 126
5.7 Conclusion......Page 127
References......Page 128
Part II Network architectures......Page 131
6.1 Introduction......Page 133
6.2 Fundamental problems in the Internet today......Page 134
6.2.3 Unwanted traffic......Page 135
6.3 The HIP architecture and base exchange......Page 136
6.3.1 Basics......Page 137
6.3.2 HITs and LSIs......Page 138
6.3.3 Protocols and packet formats......Page 139
6.3.4 Detailed layering......Page 143
6.3.5 Functional model......Page 144
6.3.6 Potential drawbacks......Page 146
6.4.1 HIP-based basic mobility and multi-homing......Page 147
6.4.2 Facilitating rendezvous......Page 148
6.4.3 Mobility between addressing realms and through NATs......Page 149
6.4.4 Subnetwork mobility......Page 150
6.5.1 Privacy and accountability......Page 152
6.5.2 Reducing unwanted traffic......Page 153
6.6 Current status of HIP......Page 155
References......Page 157
7 Contract-Switching for Managing Inter-Domain Dynamics......Page 162
7.1 Contract-switching paradigm......Page 163
7.2 Architectural issues......Page 164
7.2.2 Contract routing......Page 165
7.3 A contract link: bailouts and forwards......Page 169
7.3.2 Formalization for pricing a bailout forward contract (BFC)......Page 170
7.3.3 Bailout forward contract (BFC) performance evaluation......Page 173
7.4 Summary......Page 178
References......Page 179
8.1 Introduction......Page 180
8.3 PHAROS architecture: an overview......Page 183
8.4.1 Resource management strategies......Page 187
8.4.2 Protection......Page 190
8.4.3 Playbooks......Page 192
8.4.4 Sub-lambda grooming......Page 194
8.5 Signaling system......Page 195
8.5.1 Control plane operation......Page 197
8.5.2 Failure notification......Page 198
8.6 Core node implementation......Page 199
8.7 Performance analysis......Page 201
8.8 Concluding remarks......Page 202
References......Page 203
9.1.1 Internet architecture......Page 205
9.1.3 Data path programmability......Page 206
9.1.5 In-network processing solutions......Page 207
9.2.1 Concepts......Page 208
9.2.2 System architecture......Page 210
9.3.1 Service pipeline......Page 212
9.3.2 Service composition......Page 213
9.4.1 Problem statement......Page 214
9.4.2 Centralized routing and placement......Page 215
9.4.3 Distributed routing and placement......Page 216
9.5.1 Workload and system model......Page 217
9.5.3 Task duplication......Page 218
9.5.4 Task mapping......Page 219
References......Page 220
10.1 Toward a new Internet architecture......Page 223
10.2 The problems with the current architecture......Page 225
10.3 SILO architecture: design for change......Page 227
10.4 Prior related work......Page 232
10.5 Prototype and case studies......Page 233
10.6.1 Virtualization......Page 234
10.6.2 SDO: ``software defined optics''......Page 237
10.6.3 Other open problems......Page 238
10.7 Case study......Page 239
References......Page 240
Part III Protocols and practice......Page 243
11.1 Introduction......Page 245
11.2 PoMo design goals......Page 246
11.3.1 PFRI network structure and addressing......Page 248
11.3.2 PFRI forwarding......Page 249
11.3.3 PFRI routing policies......Page 251
11.3.4 PFRI packet header mechanisms......Page 252
11.4 Scaling the PFRI architecture......Page 253
11.5 Discussion......Page 256
11.6 Experimental evaluation......Page 258
11.7 Other clean-slate approaches......Page 260
References......Page 261
12.1 Introduction......Page 264
12.2.1 Objectives......Page 265
12.2.2 Trilogy technologies......Page 266
12.3 Multi-path routing......Page 267
12.3.3 Improved response to path changes......Page 268
12.3.5 Improved market transparency......Page 269
12.4.1 Intra-domain multi-path routing......Page 270
12.4.2 Inter-domain multi-path routing......Page 271
12.4.3 Motivations for other solutions......Page 273
12.4.4 mBGP and MpASS......Page 274
12.5 Conclusions and future work......Page 279
References......Page 280
13 Explicit congestion control......Page 283
13.1 Fairness......Page 284
13.2 Proportionally fair rate control protocol......Page 286
13.2.1 Sufficient conditions for local stability......Page 289
13.2.3 Two forms of feedback?......Page 290
13.3 Admission management......Page 291
13.3.1 Step-change algorithm......Page 292
13.3.2 Robustness of the step-change algorithm......Page 293
13.3.3 Guidelines for network management......Page 294
13.3.4 Illustrating the utilization--robustness tradeoff......Page 295
13.3.5 Buffer sizing and the step-change algorithm......Page 296
13.4 Concluding remarks......Page 298
References......Page 299
14.1 Introduction......Page 301
14.2.1 Generic services......Page 304
14.2.2 Domain-specific services......Page 309
14.3.1 The fabric model......Page 310
14.3.2 KanseiGenie architecture......Page 311
14.3.3 GENI extension to KanseiGenie......Page 313
14.3.4 Implementation of KanseiGenie......Page 314
14.3.5 KanseiGenie federation......Page 316
14.4.1 How to customize KanseiGenie......Page 318
14.4.2 Vertical APIs and their role in customization......Page 319
14.4.3 KanseiGenie usage step-by-step run-through......Page 320
14.5.1 Resource specifications for sensor fabrics......Page 321
14.5.3 Resource allocation......Page 322
14.5.5 Network virtualization......Page 323
References......Page 324
Part IV Theory and models......Page 327
15.1 Introduction......Page 329
15.2 Buffer sizing and end-to-end congestion control......Page 330
15.2.1 Four heuristic arguments about buffer sizing......Page 331
15.2.2 Fluid traffic model and queue model......Page 333
15.2.3 Queueing delay, utilization, and synchronization......Page 335
15.2.4 Traffic burstiness......Page 338
15.3.1 Model for a switched network......Page 339
15.3.2 The capacity region, and virtual queues......Page 340
15.3.3 Performance analysis......Page 341
15.4 A proposed packet-level architecture......Page 346
References......Page 349
16.1 Introduction......Page 350
16.2.1 Background......Page 352
16.2.2 Key ideas and procedures......Page 353
16.3.1 Session-level dynamics......Page 354
16.3.2 Packet-level dynamics......Page 358
16.3.3 Constraint-level dynamics......Page 360
16.3.4 Combinations of multiple dynamics......Page 362
16.4 Wireless scheduling......Page 363
16.4.1 Collision-free algorithms......Page 365
16.4.2 Collision-based algorithms......Page 368
16.4.3 Performance--complexity tradeoff......Page 372
16.4.4 Future research directions......Page 376
References......Page 377
17.1 Network coding background......Page 385
17.2.1 Single multicast in undirected networks......Page 387
17.2.2 The linear programming perspective......Page 391
17.2.3 Single multicast in Internet-like bi-directed networks......Page 392
17.2.5 Multiple communication sessions......Page 393
17.2.6 The source independence property of multicast......Page 394
17.3.1 Peer-assisted content distribution with network coding......Page 395
17.3.2 Peer-assisted media streaming with network coding......Page 397
17.4 Conclusions......Page 400
References......Page 401
18 Network economics......Page 404
18.1 Neutrality......Page 406
18.1.1 Model......Page 407
18.1.2 The analysis of one- and two-sided pricing......Page 410
18.1.4 Comparison......Page 412
18.1.5 Conclusions......Page 415
18.2 Competition......Page 416
18.2.1 Model......Page 418
18.2.2 Circuit analogy......Page 419
18.3 Service differentiation......Page 424
References......Page 426
About the Editors......Page 429
Index......Page 431