| 254 | <a class="EntryGoto" id="Angu, Pragatheeswaran and Ramamurthy, Byrav"></a> |
| 255 | <b class="myheading" style="position: relative; left: 5%;">Angu, Pragatheeswaran and Ramamurthy, Byrav</b> |
| 256 | |
| 257 | <div class="BibEntry"> |
| 258 | |
| 259 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 260 | |
| 261 | |
| 262 | <tr> |
| 263 | <td valign="top">Author</td> |
| 264 | <td valign="top">Angu, Pragatheeswaran and Ramamurthy, Byrav</td> |
| 265 | </tr> |
| 266 | |
| 267 | <tr> |
| 268 | <td valign="top">Title</td> |
| 269 | <td valign="top">Experiences with dynamic circuit creation in a regional network testbed</td> |
| 270 | </tr> |
| 271 | |
| 272 | <tr> |
| 273 | <td valign="top">Booktitle</td> |
| 274 | <td valign="top">2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)</td> |
| 275 | </tr> |
| 276 | |
| 277 | <tr> |
| 278 | <td valign="top">Location</td> |
| 279 | <td valign="top">Shanghai, China</td> |
| 280 | </tr> |
| 281 | |
| 282 | <tr> |
| 283 | <td valign="top">Publisher</td> |
| 284 | <td valign="top">IEEE</td> |
| 285 | </tr> |
| 286 | |
| 287 | <tr> |
| 288 | <td valign="top">Year</td> |
| 289 | <td valign="top">2011</td> |
| 290 | </tr> |
| 291 | |
| 292 | <tr> |
| 293 | <td valign="top">Abstract</td> |
| 294 | <td valign="top">In this paper we share our experiences of enabling dynamic circuit creation in the GpENI network. GpENI is a network research testbed in the mid-west USA involving several educational institutions. University of Nebraska-Lincoln is involved in provisioning dynamic circuits across the GpENI network among its participating universities. We discuss several options investigated for deploying dynamic circuits over the GpENI network as well as our demonstration experiments at the GENI engineering conferences. UNL has also collaborated with ProtoGENI project of University of Utah and Mid-Atlantic Crossroads (MAX) facility of Washington DC to create inter-domain dynamic circuits.</td> |
| 295 | </tr> |
| 296 | |
| 297 | |
| 298 | |
| 299 | <tr> |
| 300 | <td valign="top">DOI</td> |
| 301 | <td valign="top">10.1109/infcomw.2011.5928801</td> |
| 302 | </tr> |
| 303 | |
| 304 | |
| 305 | |
| 306 | <tr> |
| 307 | <td valign="top">URL</td> |
| 308 | <td valign="top"><a href="http://dx.doi.org/10.1109/infcomw.2011.5928801">http://dx.doi.org/10.1109/infcomw.2011.5928801</a></td> |
| 309 | </tr> |
| 310 | |
| 311 | |
| 312 | </table></div><br><br> |
| 313 | |
| 314 | |
| 315 | |
| 316 | |
255 | 317 | <a class="EntryGoto" id="Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Renci, Chris H. and Chase, Unc-Ch J. and Marupadi, Varun and Yumerefendi, Aydan and Irwin, David"></a> |
256 | 318 | <b class="myheading" style="position: relative; left: 5%;">Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Renci, Chris H. and Chase, Unc-Ch J. and Marupadi, Varun and Yumerefendi, Aydan and Irwin, David</b> |
| 423 | <a class="EntryGoto" id="Bavier, Andy and Coady, Yvonne and Mack, Tony and Matthews, Chris and Mambretti, Joe and McGeer, Rick and Mueller, Paul and Snoeren, Alex and Yuen, Marco"></a> |
| 424 | <b class="myheading" style="position: relative; left: 5%;">Bavier, Andy and Coady, Yvonne and Mack, Tony and Matthews, Chris and Mambretti, Joe and McGeer, Rick and Mueller, Paul and Snoeren, Alex and Yuen, Marco</b> |
| 425 | |
| 426 | <div class="BibEntry"> |
| 427 | |
| 428 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 429 | |
| 430 | |
| 431 | <tr> |
| 432 | <td valign="top">Author</td> |
| 433 | <td valign="top">Bavier, Andy and Coady, Yvonne and Mack, Tony and Matthews, Chris and Mambretti, Joe and McGeer, Rick and Mueller, Paul and Snoeren, Alex and Yuen, Marco</td> |
| 434 | </tr> |
| 435 | |
| 436 | <tr> |
| 437 | <td valign="top">Title</td> |
| 438 | <td valign="top">GENICloud and transcloud</td> |
| 439 | </tr> |
| 440 | |
| 441 | <tr> |
| 442 | <td valign="top">Booktitle</td> |
| 443 | <td valign="top">Proceedings of the 2012 workshop on Cloud services, federation, and the 8th open cirrus summit</td> |
| 444 | </tr> |
| 445 | |
| 446 | <tr> |
| 447 | <td valign="top">Location</td> |
| 448 | <td valign="top">San Jose, California, USA</td> |
| 449 | </tr> |
| 450 | |
| 451 | <tr> |
| 452 | <td valign="top">Publisher</td> |
| 453 | <td valign="top">ACM</td> |
| 454 | </tr> |
| 455 | |
| 456 | <tr> |
| 457 | <td valign="top">Address</td> |
| 458 | <td valign="top">New York, NY, USA</td> |
| 459 | </tr> |
| 460 | |
| 461 | <tr> |
| 462 | <td valign="top">Year</td> |
| 463 | <td valign="top">2012</td> |
| 464 | </tr> |
| 465 | |
| 466 | <tr> |
| 467 | <td valign="top">Abstract</td> |
| 468 | <td valign="top">In this paper, we argue that federation of cloud systems requires a standard API for users to create, manage, and destroy virtual objects, and a standard naming scheme for virtual objects. We introduce an existing API for this purpose, the Slice-Based Federation Architecture, and demonstrate that it can be implemented on a number of existing cloud management systems. We introduce a simple naming scheme for virtual objects, and discuss its implementation.</td> |
| 469 | </tr> |
| 470 | |
| 471 | |
| 472 | |
| 473 | <tr> |
| 474 | <td valign="top">DOI</td> |
| 475 | <td valign="top">10.1145/2378975.2378980</td> |
| 476 | </tr> |
| 477 | |
| 478 | |
| 479 | |
| 480 | <tr> |
| 481 | <td valign="top">URL</td> |
| 482 | <td valign="top"><a href="http://dx.doi.org/10.1145/2378975.2378980">http://dx.doi.org/10.1145/2378975.2378980</a></td> |
| 483 | </tr> |
| 484 | |
| 485 | |
| 486 | </table></div><br><br> |
| 487 | |
| 488 | |
| 489 | |
| 490 | |
| 3334 | <a class="EntryGoto" id="Ricci, Robert and Wong, Gary and Stoller, Leigh and Duerig, Jonathon"></a> |
| 3335 | <b class="myheading" style="position: relative; left: 5%;">Ricci, Robert and Wong, Gary and Stoller, Leigh and Duerig, Jonathon</b> |
| 3336 | |
| 3337 | <div class="BibEntry"> |
| 3338 | |
| 3339 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 3340 | |
| 3341 | |
| 3342 | <tr> |
| 3343 | <td valign="top">Author</td> |
| 3344 | <td valign="top">Ricci, Robert and Wong, Gary and Stoller, Leigh and Duerig, Jonathon</td> |
| 3345 | </tr> |
| 3346 | |
| 3347 | <tr> |
| 3348 | <td valign="top">Title</td> |
| 3349 | <td valign="top">An Architecture For International Federation of Network Testbeds</td> |
| 3350 | </tr> |
| 3351 | |
| 3352 | <tr> |
| 3353 | <td valign="top">Journal</td> |
| 3354 | <td valign="top">IEICE Transactions on Communications</td> |
| 3355 | </tr> |
| 3356 | |
| 3357 | <tr> |
| 3358 | <td valign="top">Year</td> |
| 3359 | <td valign="top">2013</td> |
| 3360 | </tr> |
| 3361 | |
| 3362 | <tr> |
| 3363 | <td valign="top">Abstract</td> |
| 3364 | <td valign="top">Testbeds play a key role in the advancement of network science and the exploration of new network architectures. Because the scale and scope of any individual testbed is necessarily limited, federation is a useful technique for constructing testbeds that serve a wide range of experimenter needs. In a federated testbed, individual facilities maintain local autonomy while cooperating to provide a unified set of abstractions and interfaces to users. Forming an international federation is particularly challenging, because issues of trust, user access policy, and local laws and regulations are of greater concern that they are for federations within a single country. In this paper, we describe an architecture, based on the US National Science Foundation's GENI project, that is capable of supporting the needs of an international federation.</td> |
| 3365 | </tr> |
| 3366 | |
| 3367 | |
| 3368 | |
| 3369 | <tr> |
| 3370 | <td valign="top">DOI</td> |
| 3371 | <td valign="top">10.1587/transcom.E96.B.2</td> |
| 3372 | </tr> |
| 3373 | |
| 3374 | |
| 3375 | |
| 3376 | <tr> |
| 3377 | <td valign="top">URL</td> |
| 3378 | <td valign="top"><a href="http://dx.doi.org/10.1587/transcom.E96.B.2">http://dx.doi.org/10.1587/transcom.E96.B.2</a></td> |
| 3379 | </tr> |
| 3380 | |
| 3381 | |
| 3382 | </table></div><br><br> |
| 3383 | |
| 3384 | |
| 3385 | |
| 3386 | |
| 4005 | <a class="EntryGoto" id="Sterbenz, J. P. G. and Egemen and Hameed, M. A. and Jabbar, A. and Rohrer, J. P."></a> |
| 4006 | <b class="myheading" style="position: relative; left: 5%;">Sterbenz, J. P. G. and Egemen and Hameed, M. A. and Jabbar, A. and Rohrer, J. P.</b> |
| 4007 | |
| 4008 | <div class="BibEntry"> |
| 4009 | |
| 4010 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 4011 | |
| 4012 | |
| 4013 | <tr> |
| 4014 | <td valign="top">Author</td> |
| 4015 | <td valign="top">Sterbenz, J. P. G. and Egemen and Hameed, M. A. and Jabbar, A. and Rohrer, J. P.</td> |
| 4016 | </tr> |
| 4017 | |
| 4018 | <tr> |
| 4019 | <td valign="top">Title</td> |
| 4020 | <td valign="top">Modelling and analysis of network resilience</td> |
| 4021 | </tr> |
| 4022 | |
| 4023 | <tr> |
| 4024 | <td valign="top">Booktitle</td> |
| 4025 | <td valign="top">2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)</td> |
| 4026 | </tr> |
| 4027 | |
| 4028 | <tr> |
| 4029 | <td valign="top">Location</td> |
| 4030 | <td valign="top">Bangalore</td> |
| 4031 | </tr> |
| 4032 | |
| 4033 | <tr> |
| 4034 | <td valign="top">Publisher</td> |
| 4035 | <td valign="top">IEEE</td> |
| 4036 | </tr> |
| 4037 | |
| 4038 | <tr> |
| 4039 | <td valign="top">Year</td> |
| 4040 | <td valign="top">2011</td> |
| 4041 | </tr> |
| 4042 | |
| 4043 | <tr> |
| 4044 | <td valign="top">Abstract</td> |
| 4045 | <td valign="top">As the Internet becomes increasingly important to all aspects of society, the consequences of disruption become increasingly severe. Thus it is critical to increase the resilience and survivability of the future network. We define resilience as the ability of the network to provide desired service even when challenged by attacks, large-scale disasters, and other failures. This paper describes a comprehensive methodology to evaluate network resilience using a combination of analytical and simulation techniques with the goal of improving the resilience and survivability of the Future Internet.</td> |
| 4046 | </tr> |
| 4047 | |
| 4048 | |
| 4049 | |
| 4050 | <tr> |
| 4051 | <td valign="top">DOI</td> |
| 4052 | <td valign="top">10.1109/COMSNETS.2011.5716502</td> |
| 4053 | </tr> |
| 4054 | |
| 4055 | |
| 4056 | |
| 4057 | <tr> |
| 4058 | <td valign="top">URL</td> |
| 4059 | <td valign="top"><a href="http://dx.doi.org/10.1109/COMSNETS.2011.5716502">http://dx.doi.org/10.1109/COMSNETS.2011.5716502</a></td> |
| 4060 | </tr> |
| 4061 | |
| 4062 | |
| 4063 | </table></div><br><br> |
| 4064 | |
| 4065 | |
| 4066 | |
| 4067 | |
| 4162 | <div class="BibEntry"> |
| 4163 | |
| 4164 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 4165 | |
| 4166 | |
| 4167 | <tr> |
| 4168 | <td valign="top">Author</td> |
| 4169 | <td valign="top">Teerapittayanon, Surat and Fouli, Kerim and Médard, Muriel and Montpetit, Marie-José and Shi, Xiaomeng and Seskar, Ivan and Gosain, Abhimanyu</td> |
| 4170 | </tr> |
| 4171 | |
| 4172 | <tr> |
| 4173 | <td valign="top">Title</td> |
| 4174 | <td valign="top">Network Coding as a WiMAX Link Reliability Mechanism</td> |
| 4175 | </tr> |
| 4176 | |
| 4177 | <tr> |
| 4178 | <td valign="top">Booktitle</td> |
| 4179 | <td valign="top">Multiple Access Communications</td> |
| 4180 | </tr> |
| 4181 | |
| 4182 | <tr> |
| 4183 | <td valign="top">Publisher</td> |
| 4184 | <td valign="top">Springer Berlin Heidelberg</td> |
| 4185 | </tr> |
| 4186 | |
| 4187 | <tr> |
| 4188 | <td valign="top">Year</td> |
| 4189 | <td valign="top">2012</td> |
| 4190 | </tr> |
| 4191 | |
| 4192 | <tr> |
| 4193 | <td valign="top">Abstract</td> |
| 4194 | <td valign="top">We design and implement a network-coding-enabled relia- bility architecture for next generation wireless networks. Our network coding (NC) architecture uses a flexible thread-based design, with each encoder-decoder instance applying systematic intra-session random lin- ear network coding as a packet erasure code at the IP layer. Using GENI WiMAX platforms, a series of point-to-point transmission experiments were conducted to compare the performance of the NC architecture to that of the Automatic Repeated reQuest (ARQ) and Hybrid ARQ (HARQ) mechanisms. In our scenarios, the proposed architecture is able to decrease packet loss from around 11-32% to nearly 0%; compared to HARQ and joint HARQ/ARQ mechanisms, the NC architecture offers up to 5.9 times gain in throughput and 5.5 times reduction in end-to- end file transfer delay. By establishing NC as a potential substitute for HARQ/ARQ, our experiments offer important insights into cross-layer designs of next generation wireless networks.</td> |
| 4195 | </tr> |
| 4196 | |
| 4197 | |
| 4198 | |
| 4199 | <tr> |
| 4200 | <td valign="top">DOI</td> |
| 4201 | <td valign="top">10.1007/978-3-642-34976-8_1</td> |
| 4202 | </tr> |
| 4203 | |
| 4204 | |
| 4205 | |
| 4206 | <tr> |
| 4207 | <td valign="top">URL</td> |
| 4208 | <td valign="top"><a href="http://dx.doi.org/10.1007/978-3-642-34976-8_1">http://dx.doi.org/10.1007/978-3-642-34976-8_1</a></td> |
| 4209 | </tr> |
| 4210 | |
| 4211 | |
| 4212 | </table></div><br><br> |
| 4213 | |
| 4214 | |
| 4328 | <a class="EntryGoto" id="Tuncer, Hasan and Nozaki, Yoshihiro and Shenoy, Nirmala"></a> |
| 4329 | <b class="myheading" style="position: relative; left: 5%;">Tuncer, Hasan and Nozaki, Yoshihiro and Shenoy, Nirmala</b> |
| 4330 | |
| 4331 | <div class="BibEntry"> |
| 4332 | |
| 4333 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 4334 | |
| 4335 | |
| 4336 | <tr> |
| 4337 | <td valign="top">Author</td> |
| 4338 | <td valign="top">Tuncer, Hasan and Nozaki, Yoshihiro and Shenoy, Nirmala</td> |
| 4339 | </tr> |
| 4340 | |
| 4341 | <tr> |
| 4342 | <td valign="top">Title</td> |
| 4343 | <td valign="top">Virtual Mobility Domains - A Mobility Architecture for the Future Internet</td> |
| 4344 | </tr> |
| 4345 | |
| 4346 | <tr> |
| 4347 | <td valign="top">Booktitle</td> |
| 4348 | <td valign="top">IEEE International Conference on Commnunications (IEE ICC 2012) Symposium on Next-Generation Networking</td> |
| 4349 | </tr> |
| 4350 | |
| 4351 | <tr> |
| 4352 | <td valign="top">Year</td> |
| 4353 | <td valign="top">2012</td> |
| 4354 | </tr> |
| 4355 | |
| 4356 | <tr> |
| 4357 | <td valign="top">Abstract</td> |
| 4358 | <td valign="top">This paper presents a novel mobility architecture called Virtual Mobility Domains that is designed to work with the Floating Cloud Tiered Internetworking model. Virtual Mobility Domains supports both inter Autonomous System (macro) and intra Autonomous System (micro) mobility by leveraging a tiered addressing, a network cloud concept, and a unique packet forwarding scheme introduced by the Floating Cloud Tiered Internetworking model. The proposed mobility architecture is distinct from others by not using IP addressing and classic routing protocols, and deploying user-centric overlapping mobility domains. The comparative simulation study of Virtual Mobility Domains against Mobile IPv6, Hierarchical Mobile IPv6, and Proxy Mobile IPv6 using OPNET shows that Virtual Mobility Domains brings lower latency, lesser signaling overhead, and fewer packets loss during handoffs, specially during inter Autonomous System roaming. The results highlight the potential for a seamless mobility management.</td> |
| 4359 | </tr> |
| 4360 | |
| 4361 | |
| 4362 | |
| 4363 | <tr> |
| 4364 | <td valign="top">DOI</td> |
| 4365 | <td valign="top">10.1109/ICC.2012.6363872</td> |
| 4366 | </tr> |
| 4367 | |
| 4368 | |
| 4369 | |
| 4370 | <tr> |
| 4371 | <td valign="top">URL</td> |
| 4372 | <td valign="top"><a href="ftp://lesc.det.unifi.it/pub/LenLar/proceedings/2012/ICC2012/symposia/papers/virtual_mobility_domains_-_a_mobility_architecture_for_the_\\_.pdf">ftp://lesc.det.unifi.it/pub/LenLar/proceedings/2012/ICC2012/symposia/papers/virtual_mobility_domains_-_a_mobility_architecture_for_the_\\_.pdf</a></td> |
| 4373 | </tr> |
| 4374 | |
| 4375 | |
| 4376 | </table></div><br><br> |
| 4377 | |
| 4378 | |
| 4379 | |
| 4380 | |