| 753 | <a class="EntryGoto" id="Bavier, Andy and Chen, Jim and Mambretti, Joe and McGeer, Rick and McGeer, Sean and Nelson, Jude and O'Connell, Patrick and Ricart, Glenn and Tredger, Stephen and Coady, Yvonne"></a> |
| 754 | <b class="myheading" style="position: relative; left: 5%;">Bavier, Andy and Chen, Jim and Mambretti, Joe and McGeer, Rick and McGeer, Sean and Nelson, Jude and O'Connell, Patrick and Ricart, Glenn and Tredger, Stephen and Coady, Yvonne</b> |
| 755 | |
| 756 | <div class="BibEntry"> |
| 757 | |
| 758 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 759 | |
| 760 | <li> |
| 761 | |
| 762 | |
| 763 | <tr> |
| 764 | <td valign="top">Author</td> |
| 765 | <td valign="top">Bavier, Andy and Chen, Jim and Mambretti, Joe and McGeer, Rick and McGeer, Sean and Nelson, Jude and O'Connell, Patrick and Ricart, Glenn and Tredger, Stephen and Coady, Yvonne</td> |
| 766 | </tr> |
| 767 | |
| 768 | <tr> |
| 769 | <td valign="top">Title</td> |
| 770 | <td valign="top">The GENI experiment engine</td> |
| 771 | </tr> |
| 772 | |
| 773 | <tr> |
| 774 | <td valign="top">Booktitle</td> |
| 775 | <td valign="top">Teletraffic Congress (ITC), 2014 26th International</td> |
| 776 | </tr> |
| 777 | |
| 778 | <tr> |
| 779 | <td valign="top">Publisher</td> |
| 780 | <td valign="top">IEEE</td> |
| 781 | </tr> |
| 782 | |
| 783 | <tr> |
| 784 | <td valign="top">Year</td> |
| 785 | <td valign="top">2014</td> |
| 786 | </tr> |
| 787 | |
| 788 | <tr> |
| 789 | <td valign="top">Abstract</td> |
| 790 | <td valign="top">We describe the GENI Experiment Engine, a Distributed-Platform-as-a-Service facility designed to be implemented on a distributed testbed or infrastructure. The GEE is intended to provide rapid and convenient access to a distributed infrastructure for simple, easy-to-configure experiments and applications. Specifically, the design goal of the GEE is to permit experimenters and application writers to: (a) allocate a GEE slicelet; (b) deploy a simple experiment or application; (c) run the experiment; (d) collect the results; and (e) tear down the experiment, starting from scratch, within five minutes. The GEE consists of four cooperating services over the GENI infrastructure, which together with pre-allocated slicelets and a pre-allocated network offers a complete, ready to use, sliceable platform over the GENI Infrastructure.</td> |
| 791 | </tr> |
| 792 | |
| 793 | |
| 794 | |
| 795 | <tr> |
| 796 | <td valign="top">DOI</td> |
| 797 | <td valign="top">10.1109/itc.2014.6932974</td> |
| 798 | </tr> |
| 799 | |
| 800 | |
| 801 | |
| 802 | <tr> |
| 803 | <td valign="top">URL</td> |
| 804 | <td valign="top"><a href="http://dx.doi.org/10.1109/itc.2014.6932974">http://dx.doi.org/10.1109/itc.2014.6932974</a></td> |
| 805 | </tr> |
| 806 | |
| 807 | |
| 808 | </li> |
| 809 | |
| 810 | </table></div><br><br> |
| 811 | |
| 812 | |
| 813 | |
| 814 | |
753 | 815 | <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> |
754 | 816 | <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> |
| 1445 | <a class="EntryGoto" id="Bhat, Divyashri and Riga, Niky and Zink, Michael"></a> |
| 1446 | <b class="myheading" style="position: relative; left: 5%;">Bhat, Divyashri and Riga, Niky and Zink, Michael</b> |
| 1447 | |
| 1448 | <div class="BibEntry"> |
| 1449 | |
| 1450 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 1451 | |
| 1452 | <li> |
| 1453 | |
| 1454 | |
| 1455 | <tr> |
| 1456 | <td valign="top">Author</td> |
| 1457 | <td valign="top">Bhat, Divyashri and Riga, Niky and Zink, Michael</td> |
| 1458 | </tr> |
| 1459 | |
| 1460 | <tr> |
| 1461 | <td valign="top">Title</td> |
| 1462 | <td valign="top">Towards seamless application delivery using software defined exchanges</td> |
| 1463 | </tr> |
| 1464 | |
| 1465 | <tr> |
| 1466 | <td valign="top">Booktitle</td> |
| 1467 | <td valign="top">Teletraffic Congress (ITC), 2014 26th International</td> |
| 1468 | </tr> |
| 1469 | |
| 1470 | <tr> |
| 1471 | <td valign="top">Publisher</td> |
| 1472 | <td valign="top">IEEE</td> |
| 1473 | </tr> |
| 1474 | |
| 1475 | <tr> |
| 1476 | <td valign="top">Year</td> |
| 1477 | <td valign="top">2014</td> |
| 1478 | </tr> |
| 1479 | |
| 1480 | <tr> |
| 1481 | <td valign="top">Abstract</td> |
| 1482 | <td valign="top">Content Delivery over the Internet continues to be a challenge as there is no centralized control system [1]. Software Defined Networking has paved the way to provide this control of network traffic. OpenFlow is now being standardized as part of the Open Networking Foundation, and Software Defined Exchange provides a framework to use OpenFlow for multidomain routing. Prototype deployments of Software Defined Exchanges have recently come into existence as a platform for Future Internet architecture to eliminate the need for core routing technology used in today's Internet. In this paper, we look at how application delivery, in particular, Dynamic Adaptive Streaming over HTTP (DASH) and Nowcasting take advantage of Software Defined Exchange. We compare unsophisticated controllers to more sophisticated ones which we call a ” load balancer” and find that implementing a good reactive controller for inter-domain routing can result in better network utilization and better application performance.</td> |
| 1483 | </tr> |
| 1484 | |
| 1485 | |
| 1486 | |
| 1487 | <tr> |
| 1488 | <td valign="top">DOI</td> |
| 1489 | <td valign="top">10.1109/itc.2014.6932971</td> |
| 1490 | </tr> |
| 1491 | |
| 1492 | |
| 1493 | |
| 1494 | <tr> |
| 1495 | <td valign="top">URL</td> |
| 1496 | <td valign="top"><a href="http://dx.doi.org/10.1109/itc.2014.6932971">http://dx.doi.org/10.1109/itc.2014.6932971</a></td> |
| 1497 | </tr> |
| 1498 | |
| 1499 | |
| 1500 | </li> |
| 1501 | |
| 1502 | </table></div><br><br> |
| 1503 | |
| 1504 | |
| 1505 | |
| 1506 | |
1383 | 1507 | <a class="EntryGoto" id="Blanton, Ethan and Chatterjee, Sarbajit and Gangam, Sriharsha and Kala, Sumit and Sharma, Deepti and Fahmy, Sonia and Sharma, Puneet"></a> |
1384 | 1508 | <b class="myheading" style="position: relative; left: 5%;">Blanton, Ethan and Chatterjee, Sarbajit and Gangam, Sriharsha and Kala, Sumit and Sharma, Deepti and Fahmy, Sonia and Sharma, Puneet</b> |
| 1574 | <a class="EntryGoto" id="Brown, D. and Nasir, H. and Carpenter, C. and Ascigil, O. and Griffioen, J. and Calvert, K."></a> |
| 1575 | <b class="myheading" style="position: relative; left: 5%;">Brown, D. and Nasir, H. and Carpenter, C. and Ascigil, O. and Griffioen, J. and Calvert, K.</b> |
| 1576 | |
| 1577 | <div class="BibEntry"> |
| 1578 | |
| 1579 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 1580 | |
| 1581 | <li> |
| 1582 | |
| 1583 | |
| 1584 | <tr> |
| 1585 | <td valign="top">Author</td> |
| 1586 | <td valign="top">Brown, D. and Nasir, H. and Carpenter, C. and Ascigil, O. and Griffioen, J. and Calvert, K.</td> |
| 1587 | </tr> |
| 1588 | |
| 1589 | <tr> |
| 1590 | <td valign="top">Title</td> |
| 1591 | <td valign="top">ChoiceNet gaming: Changing the gaming experience with economics</td> |
| 1592 | </tr> |
| 1593 | |
| 1594 | <tr> |
| 1595 | <td valign="top">Booktitle</td> |
| 1596 | <td valign="top">Computer Games: AI, Animation, Mobile, Multimedia, Educational and Serious Games (CGAMES), 2014</td> |
| 1597 | </tr> |
| 1598 | |
| 1599 | <tr> |
| 1600 | <td valign="top">Publisher</td> |
| 1601 | <td valign="top">IEEE</td> |
| 1602 | </tr> |
| 1603 | |
| 1604 | <tr> |
| 1605 | <td valign="top">Year</td> |
| 1606 | <td valign="top">2014</td> |
| 1607 | </tr> |
| 1608 | |
| 1609 | <tr> |
| 1610 | <td valign="top">Abstract</td> |
| 1611 | <td valign="top">When playing online games, the user experience is often dictated by the performance of the network. To deliver the best possible gaming experience, game developers often find themselves developing work-arounds that try to mask the lack of control they have over of the existing TCP/IP Internet. ChoiceNet, an emerging future Internet architecture, attempts to give applications enhanced control (choice) over the service they receive from the network. In particular, ChoiceNet supports an economic plane in which applications can purchase services from any provider. Because providers are compensated, they are motivated to offer a variety of innovative, excellent services, enabling applications to select the service best suited for its needs. Instead of coding work-arounds, game developers can obtain precisely the network service that is needed to optimize the game experience. In this paper, we describe the emerging ChoiceNet archi- tecture and show how computer games can benefit from the alternatives enabled by ChoiceNet. To demonstrate the benefits of the ChoiceNet architecture, we implemented a first person shooter game that uses ChoiceNet to ” purchase” and then send data over the purchased path resulting in substantially lower latency than the default path. We describe the ChoiceNet services used to implement the game, and we present performance results that show a significant reduction in latency. We also show how ChoiceNet can be used to purchase reliable (non-lossy) communication paths that improve the user's experience.</td> |
| 1612 | </tr> |
| 1613 | |
| 1614 | |
| 1615 | |
| 1616 | <tr> |
| 1617 | <td valign="top">DOI</td> |
| 1618 | <td valign="top">10.1109/cgames.2014.6934146</td> |
| 1619 | </tr> |
| 1620 | |
| 1621 | |
| 1622 | |
| 1623 | <tr> |
| 1624 | <td valign="top">URL</td> |
| 1625 | <td valign="top"><a href="http://dx.doi.org/10.1109/cgames.2014.6934146">http://dx.doi.org/10.1109/cgames.2014.6934146</a></td> |
| 1626 | </tr> |
| 1627 | |
| 1628 | |
| 1629 | </li> |
| 1630 | |
| 1631 | </table></div><br><br> |
| 1632 | |
| 1633 | |
| 1634 | |
| 1635 | |
1450 | 1636 | <a class="EntryGoto" id="Calyam, P. and Rajagopalan, S. and Selvadhurai, A. and Mohan, S. and Venkataraman, A. and Berryman, A. and Ramnath, R."></a> |
1451 | 1637 | <b class="myheading" style="position: relative; left: 5%;">Calyam, P. and Rajagopalan, S. and Selvadhurai, A. and Mohan, S. and Venkataraman, A. and Berryman, A. and Ramnath, R.</b> |
| 2796 | <a class="EntryGoto" id="Fei, Zongming and Xu, Qingrong and Lu, Hui"></a> |
| 2797 | <b class="myheading" style="position: relative; left: 5%;">Fei, Zongming and Xu, Qingrong and Lu, Hui</b> |
| 2798 | |
| 2799 | <div class="BibEntry"> |
| 2800 | |
| 2801 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 2802 | |
| 2803 | <li> |
| 2804 | |
| 2805 | |
| 2806 | <tr> |
| 2807 | <td valign="top">Author</td> |
| 2808 | <td valign="top">Fei, Zongming and Xu, Qingrong and Lu, Hui</td> |
| 2809 | </tr> |
| 2810 | |
| 2811 | <tr> |
| 2812 | <td valign="top">Title</td> |
| 2813 | <td valign="top">Generating large network topologies for GENI experiments</td> |
| 2814 | </tr> |
| 2815 | |
| 2816 | <tr> |
| 2817 | <td valign="top">Booktitle</td> |
| 2818 | <td valign="top">SOUTHEASTCON 2014, IEEE</td> |
| 2819 | </tr> |
| 2820 | |
| 2821 | <tr> |
| 2822 | <td valign="top">Publisher</td> |
| 2823 | <td valign="top">IEEE</td> |
| 2824 | </tr> |
| 2825 | |
| 2826 | <tr> |
| 2827 | <td valign="top">Year</td> |
| 2828 | <td valign="top">2014</td> |
| 2829 | </tr> |
| 2830 | |
| 2831 | <tr> |
| 2832 | <td valign="top">Abstract</td> |
| 2833 | <td valign="top">The Global Environment for Network Innovations (GENI) is a virtual laboratory which provides the infrastructure and resources for setting up network experiments. At present, GENI experimenters need to draw the topology in detail with a tool such as Flack, describing every node and every link in the experiment. This is not a problem for small-scale experiments. However, if an experiment needs a large-scale network topology, it is difficult for experimenters to accomplish the task. To deal with the problem, this paper develops a web application that can create large-scale network topologies in the GENI environment automatically. It makes use of existing network topology generators, such as GT-ITMand INET, and adapts them to be used in the GENI environment. The system can interface with GENI seamlessly. With the tool, the task of setting up large-scale experiments by GENI experimenters is made as easy as simply specifying high-level parameters of the topology.</td> |
| 2834 | </tr> |
| 2835 | |
| 2836 | |
| 2837 | |
| 2838 | <tr> |
| 2839 | <td valign="top">DOI</td> |
| 2840 | <td valign="top">10.1109/secon.2014.6950726</td> |
| 2841 | </tr> |
| 2842 | |
| 2843 | |
| 2844 | |
| 2845 | <tr> |
| 2846 | <td valign="top">URL</td> |
| 2847 | <td valign="top"><a href="http://dx.doi.org/10.1109/secon.2014.6950726">http://dx.doi.org/10.1109/secon.2014.6950726</a></td> |
| 2848 | </tr> |
| 2849 | |
| 2850 | |
| 2851 | </li> |
| 2852 | |
| 2853 | </table></div><br><br> |
| 2854 | |
| 2855 | |
| 2856 | |
| 2857 | |
5114 | | <td valign="top">Network Operations and Management Symposium (NOMS), 2012 IEEE</td> |
5115 | | </tr> |
5116 | | |
5117 | | <tr> |
5118 | | <td valign="top">Year</td> |
5119 | | <td valign="top">2012</td> |
5120 | | </tr> |
5121 | | |
5122 | | |
5123 | | |
5124 | | <tr> |
5125 | | <td valign="top">DOI</td> |
5126 | | <td valign="top">10.1109/NOMS.2012.6211961</td> |
5127 | | </tr> |
5128 | | |
5129 | | |
5130 | | |
5131 | | <tr> |
5132 | | <td valign="top">URL</td> |
5133 | | <td valign="top"><a href="http://dx.doi.org/10.1109/NOMS.2012.6211961">http://dx.doi.org/10.1109/NOMS.2012.6211961</a></td> |
5134 | | </tr> |
5135 | | |
5136 | | |
5137 | | </li> |
5138 | | |
5139 | | </table></div><br><br> |
5140 | | |
5141 | | |
5142 | | <div class="BibEntry"> |
5143 | | |
5144 | | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
5145 | | |
5146 | | <li> |
5147 | | |
5148 | | |
5149 | | <tr> |
5150 | | <td valign="top">Author</td> |
5151 | | <td valign="top">Maccherani, E. and Femminella, M. and Lee, J. W. and Francescangeli, R. and Janak, J. and Reali, G. and Schulzrinne, H.</td> |
5152 | | </tr> |
5153 | | |
5154 | | <tr> |
5155 | | <td valign="top">Title</td> |
5156 | | <td valign="top">Extending the NetServ autonomic management capabilities using OpenFlow</td> |
5157 | | </tr> |
5158 | | |
5159 | | <tr> |
5160 | | <td valign="top">Booktitle</td> |
| 5405 | <div class="BibEntry"> |
| 5406 | |
| 5407 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 5408 | |
| 5409 | <li> |
| 5410 | |
| 5411 | |
| 5412 | <tr> |
| 5413 | <td valign="top">Author</td> |
| 5414 | <td valign="top">Maccherani, E. and Femminella, M. and Lee, J. W. and Francescangeli, R. and Janak, J. and Reali, G. and Schulzrinne, H.</td> |
| 5415 | </tr> |
| 5416 | |
| 5417 | <tr> |
| 5418 | <td valign="top">Title</td> |
| 5419 | <td valign="top">Extending the NetServ autonomic management capabilities using OpenFlow</td> |
| 5420 | </tr> |
| 5421 | |
| 5422 | <tr> |
| 5423 | <td valign="top">Booktitle</td> |
| 5424 | <td valign="top">Network Operations and Management Symposium (NOMS), 2012 IEEE</td> |
| 5425 | </tr> |
| 5426 | |
| 5427 | <tr> |
| 5428 | <td valign="top">Year</td> |
| 5429 | <td valign="top">2012</td> |
| 5430 | </tr> |
| 5431 | |
| 5432 | |
| 5433 | |
| 5434 | <tr> |
| 5435 | <td valign="top">DOI</td> |
| 5436 | <td valign="top">10.1109/NOMS.2012.6211961</td> |
| 5437 | </tr> |
| 5438 | |
| 5439 | |
| 5440 | |
| 5441 | <tr> |
| 5442 | <td valign="top">URL</td> |
| 5443 | <td valign="top"><a href="http://dx.doi.org/10.1109/NOMS.2012.6211961">http://dx.doi.org/10.1109/NOMS.2012.6211961</a></td> |
| 5444 | </tr> |
| 5445 | |
| 5446 | |
| 5447 | </li> |
| 5448 | |
| 5449 | </table></div><br><br> |
| 5450 | |
| 5451 | |
| 5662 | <td valign="top">Software-Defined Network Exchanges (SDXs): Architecture, services, capabilities, and foundation technologies</td> |
| 5663 | </tr> |
| 5664 | |
| 5665 | <tr> |
| 5666 | <td valign="top">Booktitle</td> |
| 5667 | <td valign="top">Teletraffic Congress (ITC), 2014 26th International</td> |
| 5668 | </tr> |
| 5669 | |
| 5670 | <tr> |
| 5671 | <td valign="top">Publisher</td> |
| 5672 | <td valign="top">IEEE</td> |
| 5673 | </tr> |
| 5674 | |
| 5675 | <tr> |
| 5676 | <td valign="top">Year</td> |
| 5677 | <td valign="top">2014</td> |
| 5678 | </tr> |
| 5679 | |
| 5680 | <tr> |
| 5681 | <td valign="top">Abstract</td> |
| 5682 | <td valign="top">Software Defined Networks (SDNs), primarily based on OpenFlow, are being deployed in single domain networks around the world. The popularity of SDNs has given rise to multiple considerations about designing, implementing, and operating Software-Defined Network Exchanges (SDXs), to enable SDNs to interconnect SDN islands and to extend SDNs across multiple domains. These goals can be accomplished only by developing new techniques that extend the single domain orientation of current SDN/OpenFlow approaches to include capabilities for multidomain control, including those for resource discovery, signaling, and dynamic provisioning. Several networking research communities have begun to investigate these concepts. Early architectural models of SDXs have been designed and implemented as prototypes. These SDXs are being used to conduct experiments and to demonstrate the potentials of SDXs.</td> |
| 5683 | </tr> |
| 5684 | |
| 5685 | |
| 5686 | |
| 5687 | <tr> |
| 5688 | <td valign="top">DOI</td> |
| 5689 | <td valign="top">10.1109/itc.2014.6932970</td> |
| 5690 | </tr> |
| 5691 | |
| 5692 | |
| 5693 | |
| 5694 | <tr> |
| 5695 | <td valign="top">URL</td> |
| 5696 | <td valign="top"><a href="http://dx.doi.org/10.1109/itc.2014.6932970">http://dx.doi.org/10.1109/itc.2014.6932970</a></td> |
| 5697 | </tr> |
| 5698 | |
| 5699 | |
| 5700 | </li> |
| 5701 | |
| 5702 | </table></div><br><br> |
| 5703 | |
| 5704 | |
| 5705 | <div class="BibEntry"> |
| 5706 | |
| 5707 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 5708 | |
| 5709 | <li> |
| 5710 | |
| 5711 | |
| 5712 | <tr> |
| 5713 | <td valign="top">Author</td> |
| 5714 | <td valign="top">Mambretti, Joe and Chen, Jim and Yeh, Fei</td> |
| 5715 | </tr> |
| 5716 | |
| 5717 | <tr> |
| 5718 | <td valign="top">Title</td> |
| 6448 | <a class="EntryGoto" id="Narisetty, RajaRevanth and Gurkan, Deniz"></a> |
| 6449 | <b class="myheading" style="position: relative; left: 5%;">Narisetty, RajaRevanth and Gurkan, Deniz</b> |
| 6450 | |
| 6451 | <div class="BibEntry"> |
| 6452 | |
| 6453 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 6454 | |
| 6455 | <li> |
| 6456 | |
| 6457 | |
| 6458 | <tr> |
| 6459 | <td valign="top">Author</td> |
| 6460 | <td valign="top">Narisetty, RajaRevanth and Gurkan, Deniz</td> |
| 6461 | </tr> |
| 6462 | |
| 6463 | <tr> |
| 6464 | <td valign="top">Title</td> |
| 6465 | <td valign="top">Identification of network measurement challenges in OpenFlow-based service chaining</td> |
| 6466 | </tr> |
| 6467 | |
| 6468 | <tr> |
| 6469 | <td valign="top">Booktitle</td> |
| 6470 | <td valign="top">Local Computer Networks Workshops (LCN Workshops), 2014 IEEE 39th Conference on</td> |
| 6471 | </tr> |
| 6472 | |
| 6473 | <tr> |
| 6474 | <td valign="top">Publisher</td> |
| 6475 | <td valign="top">IEEE</td> |
| 6476 | </tr> |
| 6477 | |
| 6478 | <tr> |
| 6479 | <td valign="top">Year</td> |
| 6480 | <td valign="top">2014</td> |
| 6481 | </tr> |
| 6482 | |
| 6483 | <tr> |
| 6484 | <td valign="top">Abstract</td> |
| 6485 | <td valign="top">Software-defined networking and Network Function Virtualization (NFV) have simplified the coordination efforts for ” service chaining.” Consequently, network services such as firewall, load balancing, etc. may be service chained in the forwarding (data) plane for specific applications and/or traffic. A specific case is for the firewall rules that depend on deep packet inspection for application identification. If a particular application is identified and is ” safe,” would it be worthwhile to program the data plane to bypass the FW for the duration of the application session? For such a traffic-steering case, we report measurement challenges on various setups and the related cost analysis based on the network delay. Measurements of the network and processing delay have been performed with virtualized resources, on GENI testbed, and with isolated hardware units. Experiences are also reported on how a commercial firewall virtual appliance has been deployed on the GENI testbed for experimentation. The results illustrate the measurement uncertainties and challenges for DPI-based traffic steering in virtualized environments. In addition, we show that such a service chaining may increase throughput and relieve DPI-based processing overhead on firewall units.</td> |
| 6486 | </tr> |
| 6487 | |
| 6488 | |
| 6489 | |
| 6490 | <tr> |
| 6491 | <td valign="top">DOI</td> |
| 6492 | <td valign="top">10.1109/lcnw.2014.6927718</td> |
| 6493 | </tr> |
| 6494 | |
| 6495 | |
| 6496 | |
| 6497 | <tr> |
| 6498 | <td valign="top">URL</td> |
| 6499 | <td valign="top"><a href="http://dx.doi.org/10.1109/lcnw.2014.6927718">http://dx.doi.org/10.1109/lcnw.2014.6927718</a></td> |
| 6500 | </tr> |
| 6501 | |
| 6502 | |
| 6503 | </li> |
| 6504 | |
| 6505 | </table></div><br><br> |
| 6506 | |
| 6507 | |
| 6508 | |
| 6509 | |
| 7167 | <a class="EntryGoto" id="Ricart, Glenn"></a> |
| 7168 | <b class="myheading" style="position: relative; left: 5%;">Ricart, Glenn</b> |
| 7169 | |
| 7170 | <div class="BibEntry"> |
| 7171 | |
| 7172 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 7173 | |
| 7174 | <li> |
| 7175 | |
| 7176 | |
| 7177 | <tr> |
| 7178 | <td valign="top">Author</td> |
| 7179 | <td valign="top">Ricart, Glenn</td> |
| 7180 | </tr> |
| 7181 | |
| 7182 | <tr> |
| 7183 | <td valign="top">Title</td> |
| 7184 | <td valign="top">US Ignite testbeds: Advanced testbeds enable next-generation applications</td> |
| 7185 | </tr> |
| 7186 | |
| 7187 | <tr> |
| 7188 | <td valign="top">Booktitle</td> |
| 7189 | <td valign="top">Teletraffic Congress (ITC), 2014 26th International</td> |
| 7190 | </tr> |
| 7191 | |
| 7192 | <tr> |
| 7193 | <td valign="top">Publisher</td> |
| 7194 | <td valign="top">IEEE</td> |
| 7195 | </tr> |
| 7196 | |
| 7197 | <tr> |
| 7198 | <td valign="top">Year</td> |
| 7199 | <td valign="top">2014</td> |
| 7200 | </tr> |
| 7201 | |
| 7202 | <tr> |
| 7203 | <td valign="top">Abstract</td> |
| 7204 | <td valign="top">US Ignite is organizing what will eventually become 200 testbeds for next-generation applications in the United States. Twenty-eight testbeds are currently in various stages of operation. Most testbeds have gigabit to the end user capability including homes and small businesses. Both wired (fiber) and wireless cities are represented. The three salient advantages of these testbeds are their (1) applicability for big data (and big video) applications upstream and downstream, (2) ability to provide low-latency access to edge or local cloud (locavore) infrastructure for ultra-responsive and powerful applications, and (3) capacity for enough physical bandwidth to allow for virtualized channels carrying new services under new business models.</td> |
| 7205 | </tr> |
| 7206 | |
| 7207 | |
| 7208 | |
| 7209 | <tr> |
| 7210 | <td valign="top">DOI</td> |
| 7211 | <td valign="top">10.1109/itc.2014.6932975</td> |
| 7212 | </tr> |
| 7213 | |
| 7214 | |
| 7215 | |
| 7216 | <tr> |
| 7217 | <td valign="top">URL</td> |
| 7218 | <td valign="top"><a href="http://dx.doi.org/10.1109/itc.2014.6932975">http://dx.doi.org/10.1109/itc.2014.6932975</a></td> |
| 7219 | </tr> |
| 7220 | |
| 7221 | |
| 7222 | </li> |
| 7223 | |
| 7224 | </table></div><br><br> |
| 7225 | |
| 7226 | |
| 7227 | |
| 7228 | |
9257 | | <a class="EntryGoto" id="Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chium L. and Tang, Ao and Weatherspoon, Hakim"></a> |
9258 | | <b class="myheading" style="position: relative; left: 5%;">Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chium L. and Tang, Ao and Weatherspoon, Hakim</b> |
9259 | | |
9260 | | <div class="BibEntry"> |
9261 | | |
9262 | | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
9263 | | |
9264 | | <li> |
9265 | | |
9266 | | |
9267 | | <tr> |
9268 | | <td valign="top">Author</td> |
9269 | | <td valign="top">Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chium L. and Tang, Ao and Weatherspoon, Hakim</td> |
9270 | | </tr> |
9271 | | |
9272 | | <tr> |
9273 | | <td valign="top">Title</td> |
9274 | | <td valign="top">Timing is Everything: Accurate, Minimum Overhead, Available Bandwidth Estimation in High-speed Wired Network</td> |
9275 | | </tr> |
9276 | | |
9277 | | <tr> |
9278 | | <td valign="top">Booktitle</td> |
9279 | | <td valign="top">Internet Measurement Conference</td> |
| 9686 | <a class="EntryGoto" id="Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chiun L. and Tang, Ao and Weatherspoon, Hakim"></a> |
| 9687 | <b class="myheading" style="position: relative; left: 5%;">Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chiun L. and Tang, Ao and Weatherspoon, Hakim</b> |
| 9688 | |
| 9689 | <div class="BibEntry"> |
| 9690 | |
| 9691 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 9692 | |
| 9693 | <li> |
| 9694 | |
| 9695 | |
| 9696 | <tr> |
| 9697 | <td valign="top">Author</td> |
| 9698 | <td valign="top">Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chiun L. and Tang, Ao and Weatherspoon, Hakim</td> |
| 9699 | </tr> |
| 9700 | |
| 9701 | <tr> |
| 9702 | <td valign="top">Title</td> |
| 9703 | <td valign="top">Timing is Everything: Accurate, Minimum Overhead, Available Bandwidth Estimation in High-speed Wired Networks</td> |
| 9704 | </tr> |
| 9705 | |
| 9706 | <tr> |
| 9707 | <td valign="top">Booktitle</td> |
| 9708 | <td valign="top">Proceedings of the 2014 Conference on Internet Measurement Conference</td> |
| 9882 | <a class="EntryGoto" id="Willner, Alexander and Magedanz, Thomas"></a> |
| 9883 | <b class="myheading" style="position: relative; left: 5%;">Willner, Alexander and Magedanz, Thomas</b> |
| 9884 | |
| 9885 | <div class="BibEntry"> |
| 9886 | |
| 9887 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 9888 | |
| 9889 | <li> |
| 9890 | |
| 9891 | |
| 9892 | <tr> |
| 9893 | <td valign="top">Author</td> |
| 9894 | <td valign="top">Willner, Alexander and Magedanz, Thomas</td> |
| 9895 | </tr> |
| 9896 | |
| 9897 | <tr> |
| 9898 | <td valign="top">Title</td> |
| 9899 | <td valign="top">FIRMA: A Future Internet resource management architecture</td> |
| 9900 | </tr> |
| 9901 | |
| 9902 | <tr> |
| 9903 | <td valign="top">Booktitle</td> |
| 9904 | <td valign="top">Teletraffic Congress (ITC), 2014 26th International</td> |
| 9905 | </tr> |
| 9906 | |
| 9907 | <tr> |
| 9908 | <td valign="top">Publisher</td> |
| 9909 | <td valign="top">IEEE</td> |
| 9910 | </tr> |
| 9911 | |
| 9912 | <tr> |
| 9913 | <td valign="top">Year</td> |
| 9914 | <td valign="top">2014</td> |
| 9915 | </tr> |
| 9916 | |
| 9917 | <tr> |
| 9918 | <td valign="top">Abstract</td> |
| 9919 | <td valign="top">The Internet is broken and there are several approaches to fix it. In order to validate the different attempts, they need to be evaluated within large-scale environments involving numerous heterogeneous resources. As a result, several testbeds have been established along with a number of competitive mechanisms to federate them. Since most of these protocols try to address similar issues, combining and unifying them is subject of current research. This leads to a complex environment for testbed owners and developers. Furthermore, it is foreseeable that even more federation approaches in different application domains will emerge in the future. Therefore, we propose an extensible architecture that allows to be federation protocol agnostic. The fundamental idea is to allow interoperability on the level of a semantic information model and to separate delivery mechanism specific implementations from a common core. The requirements for such an architecture have been extracted from latest European Future Internet research projects and its practicability is being evaluated by an initial implementation.</td> |
| 9920 | </tr> |
| 9921 | |
| 9922 | |
| 9923 | |
| 9924 | <tr> |
| 9925 | <td valign="top">DOI</td> |
| 9926 | <td valign="top">10.1109/itc.2014.6932981</td> |
| 9927 | </tr> |
| 9928 | |
| 9929 | |
| 9930 | |
| 9931 | <tr> |
| 9932 | <td valign="top">URL</td> |
| 9933 | <td valign="top"><a href="http://dx.doi.org/10.1109/itc.2014.6932981">http://dx.doi.org/10.1109/itc.2014.6932981</a></td> |
| 9934 | </tr> |
| 9935 | |
| 9936 | |
| 9937 | </li> |
| 9938 | |
| 9939 | </table></div><br><br> |
| 9940 | |
| 9941 | |
| 9942 | |
| 9943 | |
| 10023 | <td valign="top">Scaling up applications over distributed clouds with dynamic layer-2 exchange and broadcast service</td> |
| 10024 | </tr> |
| 10025 | |
| 10026 | <tr> |
| 10027 | <td valign="top">Booktitle</td> |
| 10028 | <td valign="top">Teletraffic Congress (ITC), 2014 26th International</td> |
| 10029 | </tr> |
| 10030 | |
| 10031 | <tr> |
| 10032 | <td valign="top">Publisher</td> |
| 10033 | <td valign="top">IEEE</td> |
| 10034 | </tr> |
| 10035 | |
| 10036 | <tr> |
| 10037 | <td valign="top">Year</td> |
| 10038 | <td valign="top">2014</td> |
| 10039 | </tr> |
| 10040 | |
| 10041 | <tr> |
| 10042 | <td valign="top">Abstract</td> |
| 10043 | <td valign="top">In this paper, we study the problem of provisioning large-scale virtual clusters over federated clouds connected by multi-domain, layer-2 wide area networks. We first present the virtual cluster request abstraction and the abstraction models for substrate resource pools. Based on these two abstraction models, we developed a novel layer-2 exchange mechanism and an implementation of it in a multi-domain networked cloud environment. The design of the mechanism takes into consideration the realistic constraints in current network and cloud systems. We show that efficient cluster splitting, cloud data center selection and resource allocation algorithms can be developed to provision large-scale virtual clusters across cloud sites. A prototype system has been deployed and integrated into the ExoGENI testbed for about a year, and is being heavily used by scientific and data analytic applications.</td> |
| 10044 | </tr> |
| 10045 | |
| 10046 | |
| 10047 | |
| 10048 | <tr> |
| 10049 | <td valign="top">DOI</td> |
| 10050 | <td valign="top">10.1109/itc.2014.6932973</td> |
| 10051 | </tr> |
| 10052 | |
| 10053 | |
| 10054 | |
| 10055 | <tr> |
| 10056 | <td valign="top">URL</td> |
| 10057 | <td valign="top"><a href="http://dx.doi.org/10.1109/itc.2014.6932973">http://dx.doi.org/10.1109/itc.2014.6932973</a></td> |
| 10058 | </tr> |
| 10059 | |
| 10060 | |
| 10061 | </li> |
| 10062 | |
| 10063 | </table></div><br><br> |
| 10064 | |
| 10065 | |
| 10066 | <div class="BibEntry"> |
| 10067 | |
| 10068 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 10069 | |
| 10070 | <li> |
| 10071 | |
| 10072 | |
| 10073 | <tr> |
| 10074 | <td valign="top">Author</td> |
| 10075 | <td valign="top">Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</td> |
| 10076 | </tr> |
| 10077 | |
| 10078 | <tr> |
| 10079 | <td valign="top">Title</td> |