| 758 | <a class="EntryGoto" id="Berman, Mark and Elliott, Chip and Landweber, Lawrence"></a> |
| 759 | <b class="myheading" style="position: relative; left: 5%;">Berman, Mark and Elliott, Chip and Landweber, Lawrence</b> |
| 760 | |
| 761 | <div class="BibEntry"> |
| 762 | |
| 763 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 764 | |
| 765 | <li> |
| 766 | |
| 767 | |
| 768 | <tr> |
| 769 | <td valign="top">Author</td> |
| 770 | <td valign="top">Berman, Mark and Elliott, Chip and Landweber, Lawrence</td> |
| 771 | </tr> |
| 772 | |
| 773 | <tr> |
| 774 | <td valign="top">Title</td> |
| 775 | <td valign="top">GENI: Large-Scale Distributed Infrastructure for Networking and Distributed Systems Research</td> |
| 776 | </tr> |
| 777 | |
| 778 | <tr> |
| 779 | <td valign="top">Booktitle</td> |
| 780 | <td valign="top">2014 IEEE Fifth International Conference on Communications and Electronics (ICCE)</td> |
| 781 | </tr> |
| 782 | |
| 783 | <tr> |
| 784 | <td valign="top">Location</td> |
| 785 | <td valign="top">Da Nang, Vietnam</td> |
| 786 | </tr> |
| 787 | |
| 788 | <tr> |
| 789 | <td valign="top">Year</td> |
| 790 | <td valign="top">2014</td> |
| 791 | </tr> |
| 792 | |
| 793 | <tr> |
| 794 | <td valign="top">Abstract</td> |
| 795 | <td valign="top">GENI, the Global Environment for Networking Innovation, is a distributed virtual laboratory for research in networking and distributed systems, with applications in domain science. The main components of GENI include OpenFlow-enabled software defined networking (SDN) resources deployed on over 40 university campuses across the U.S. These resources include both switches and GENI Racks (SDN capable compute clusters with OpenFlow switches for internal and external communications). GENI Racks are currently installed on dozens of university campuses and within R&E network backbones. Also available is a diverse group of programmable computing and wireless networking resources. Researchers access this collection of resources via the key GENI techniques of deep programmability and slicing. Collectively, these resources and methods enable GENI to support a wide variety of research efforts.</td> |
| 796 | </tr> |
| 797 | |
| 798 | |
| 799 | |
| 800 | |
| 801 | |
| 802 | |
| 803 | </li> |
| 804 | |
| 805 | </table></div><br><br> |
| 806 | |
| 807 | |
| 808 | |
| 809 | |
| 3934 | <a class="EntryGoto" id="Lara, Adrian and Ramamurthy, Byrav and Nagaraja, Kiran and Krishnamoorthy, Aravind and Raychaudhuri, Dipankar"></a> |
| 3935 | <b class="myheading" style="position: relative; left: 5%;">Lara, Adrian and Ramamurthy, Byrav and Nagaraja, Kiran and Krishnamoorthy, Aravind and Raychaudhuri, Dipankar</b> |
| 3936 | |
| 3937 | <div class="BibEntry"> |
| 3938 | |
| 3939 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 3940 | |
| 3941 | <li> |
| 3942 | |
| 3943 | |
| 3944 | <tr> |
| 3945 | <td valign="top">Author</td> |
| 3946 | <td valign="top">Lara, Adrian and Ramamurthy, Byrav and Nagaraja, Kiran and Krishnamoorthy, Aravind and Raychaudhuri, Dipankar</td> |
| 3947 | </tr> |
| 3948 | |
| 3949 | <tr> |
| 3950 | <td valign="top">Title</td> |
| 3951 | <td valign="top">Using OpenFlow to provide cut-through switching in MobilityFirst</td> |
| 3952 | </tr> |
| 3953 | |
| 3954 | <tr> |
| 3955 | <td valign="top">Booktitle</td> |
| 3956 | <td valign="top">Photonic Network Communications</td> |
| 3957 | </tr> |
| 3958 | |
| 3959 | <tr> |
| 3960 | <td valign="top">Publisher</td> |
| 3961 | <td valign="top">Springer US</td> |
| 3962 | </tr> |
| 3963 | |
| 3964 | <tr> |
| 3965 | <td valign="top">Year</td> |
| 3966 | <td valign="top">2014</td> |
| 3967 | </tr> |
| 3968 | |
| 3969 | <tr> |
| 3970 | <td valign="top">Abstract</td> |
| 3971 | <td valign="top">Mobile devices are expected to become the Internet's predominant technology. Current protocols such as TCP/IP were not originally designed with mobility as a key consideration, and therefore underperform under challenging mobile and wireless conditions. MobilityFirst, a clean slate architecture proposal, embraces several key concepts centered around secure identifiers that inherently support mobility and trustworthiness as key requirements of the network architecture. This includes a hop-by-hop segmented data transport based on a globally unique identifier. This allows late and dynamic rebinding of end-point addresses to support mobility. While this provides critical gains in wireless segments, some overheads are incurred even in stable segments such as in the core. Bypassing routing-layer decisions in these cases, with lower layer cut-through forwarding, can improve said gains. In this work, we introduce a general bypass capability within the MobilityFirst architecture that provides better performance and enables both individual and aggregate flow-level traffic control. Furthermore, we present an OpenFlow-based proof-of-concept implementation of the bypass function using layer 2 VLAN tagging. We run experiments on the ORBIT and Global Environment for Network Innovations (GENI) testbeds to evaluate the performance and scalability of the solution. By implementing the bypass functionality, we are able to significantly reduce the number of messages processed by the controller as well as the number of flow rules that need to be pushed into the switches.</td> |
| 3972 | </tr> |
| 3973 | |
| 3974 | |
| 3975 | |
| 3976 | <tr> |
| 3977 | <td valign="top">DOI</td> |
| 3978 | <td valign="top">10.1007/s11107-014-0461-3</td> |
| 3979 | </tr> |
| 3980 | |
| 3981 | |
| 3982 | |
| 3983 | <tr> |
| 3984 | <td valign="top">URL</td> |
| 3985 | <td valign="top"><a href="http://dx.doi.org/10.1007/s11107-014-0461-3">http://dx.doi.org/10.1007/s11107-014-0461-3</a></td> |
| 3986 | </tr> |
| 3987 | |
| 3988 | |
| 3989 | </li> |
| 3990 | |
| 3991 | </table></div><br><br> |
| 3992 | |
| 3993 | |
| 3994 | |
| 3995 | |
4370 | | <td valign="top">Network Operations and Management Symposium (NOMS), 2012 IEEE</td> |
4371 | | </tr> |
4372 | | |
4373 | | <tr> |
4374 | | <td valign="top">Year</td> |
4375 | | <td valign="top">2012</td> |
4376 | | </tr> |
4377 | | |
4378 | | |
4379 | | |
4380 | | <tr> |
4381 | | <td valign="top">DOI</td> |
4382 | | <td valign="top">10.1109/NOMS.2012.6211961</td> |
4383 | | </tr> |
4384 | | |
4385 | | |
4386 | | |
4387 | | <tr> |
4388 | | <td valign="top">URL</td> |
4389 | | <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> |
4390 | | </tr> |
4391 | | |
4392 | | |
4393 | | </li> |
4394 | | |
4395 | | </table></div><br><br> |
4396 | | |
4397 | | |
4398 | | <div class="BibEntry"> |
4399 | | |
4400 | | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
4401 | | |
4402 | | <li> |
4403 | | |
4404 | | |
4405 | | <tr> |
4406 | | <td valign="top">Author</td> |
4407 | | <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> |
4408 | | </tr> |
4409 | | |
4410 | | <tr> |
4411 | | <td valign="top">Title</td> |
4412 | | <td valign="top">Extending the NetServ autonomic management capabilities using OpenFlow</td> |
4413 | | </tr> |
4414 | | |
4415 | | <tr> |
4416 | | <td valign="top">Booktitle</td> |
| 4527 | <div class="BibEntry"> |
| 4528 | |
| 4529 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 4530 | |
| 4531 | <li> |
| 4532 | |
| 4533 | |
| 4534 | <tr> |
| 4535 | <td valign="top">Author</td> |
| 4536 | <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> |
| 4537 | </tr> |
| 4538 | |
| 4539 | <tr> |
| 4540 | <td valign="top">Title</td> |
| 4541 | <td valign="top">Extending the NetServ autonomic management capabilities using OpenFlow</td> |
| 4542 | </tr> |
| 4543 | |
| 4544 | <tr> |
| 4545 | <td valign="top">Booktitle</td> |
| 4546 | <td valign="top">Network Operations and Management Symposium (NOMS), 2012 IEEE</td> |
| 4547 | </tr> |
| 4548 | |
| 4549 | <tr> |
| 4550 | <td valign="top">Year</td> |
| 4551 | <td valign="top">2012</td> |
| 4552 | </tr> |
| 4553 | |
| 4554 | |
| 4555 | |
| 4556 | <tr> |
| 4557 | <td valign="top">DOI</td> |
| 4558 | <td valign="top">10.1109/NOMS.2012.6211961</td> |
| 4559 | </tr> |
| 4560 | |
| 4561 | |
| 4562 | |
| 4563 | <tr> |
| 4564 | <td valign="top">URL</td> |
| 4565 | <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> |
| 4566 | </tr> |
| 4567 | |
| 4568 | |
| 4569 | </li> |
| 4570 | |
| 4571 | </table></div><br><br> |
| 4572 | |
| 4573 | |
| 8037 | <a class="EntryGoto" id="Velusamy, Gandhimathi"></a> |
| 8038 | <b class="myheading" style="position: relative; left: 5%;">Velusamy, Gandhimathi</b> |
| 8039 | |
| 8040 | <div class="BibEntry"> |
| 8041 | |
| 8042 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 8043 | |
| 8044 | <li> |
| 8045 | |
| 8046 | |
| 8047 | <tr> |
| 8048 | <td valign="top">Author</td> |
| 8049 | <td valign="top">Velusamy, Gandhimathi</td> |
| 8050 | </tr> |
| 8051 | |
| 8052 | <tr> |
| 8053 | <td valign="top">Title</td> |
| 8054 | <td valign="top">OpenFlow-based Distributed and Fault-Tolerant Software Switch Architecture</td> |
| 8055 | </tr> |
| 8056 | |
| 8057 | <tr> |
| 8058 | <td valign="top">Year</td> |
| 8059 | <td valign="top">2014</td> |
| 8060 | </tr> |
| 8061 | |
| 8062 | <tr> |
| 8063 | <td valign="top">Abstract</td> |
| 8064 | <td valign="top">We are living in the era where each of us is connected with each other virtually across the globe. We are sharing the information electronically over the internet every second of our day. There are many networking devices involved in sending the information over the internet. They are routers, gateways, switches, PCs, laptops, handheld devices, etc. The switches are very crucial elements in delivering packets to the intended recipients. Now the networking field is moving towards Software Defined Networking and the network elements are being slowly replaced by the software applications run by OpenFlow protocols. For example the switching functionality in local area networks could be achieved with software switches like OpenvSwitch (OVS), LINC-Switch, etc. Now a days the organizations depend on the datacenters to run their services. The application servers are being run from virtual machines on the hosts to better utilize the computing resources and make the system more scalable. The application servers need to be continuously available to run the business for which they are deployed for. Software switches are used to connect virtual machines as an alternative to Top of Rack switches. If such software switch fails then the application servers will not be able to connect to its clients. This may severely impact the business serviced by the application servers, deployed on the virtual machines. For reliable data connectivity, the switching elements need to be continuously functional. There is a need for reliable and robust switches to cater the today's networking infrastructure. In this study, the software switch LINC-Switch is implemented as distributed application on multiple nodes to make it resilient to failure. The fault-tolerance is achieved by using the distribution properties of the programming language Erlang. By implementing the switch on three redundant nodes and starting the application as a distributed application, the switch will be serving its purpose very promptly by restarting it on other node in case it fails on the current node by using failover/takeover mechanisms of Erlang. The tolerance to failure of the LINC-Switch is verified with Ping based experiment on the GENI test bed and on the Xen-cluster in our Lab.</td> |
| 8065 | </tr> |
| 8066 | |
| 8067 | |
| 8068 | |
| 8069 | |
| 8070 | |
| 8071 | <tr> |
| 8072 | <td valign="top">URL</td> |
| 8073 | <td valign="top"><a href="http://repositories.tdl.org/uh-ir/bitstream/handle/10657/693/VELUSAMY-THESIS-2014.pdf">http://repositories.tdl.org/uh-ir/bitstream/handle/10657/693/VELUSAMY-THESIS-2014.pdf</a></td> |
| 8074 | </tr> |
| 8075 | |
| 8076 | |
| 8077 | </li> |
| 8078 | |
| 8079 | </table></div><br><br> |
| 8080 | |
| 8081 | |
| 8082 | |
| 8083 | |
| 8156 | <a class="EntryGoto" id="Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chium L. and Tang, Ao and Weatherspoon, Hakim"></a> |
| 8157 | <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> |
| 8158 | |
| 8159 | <div class="BibEntry"> |
| 8160 | |
| 8161 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 8162 | |
| 8163 | <li> |
| 8164 | |
| 8165 | |
| 8166 | <tr> |
| 8167 | <td valign="top">Author</td> |
| 8168 | <td valign="top">Wang, Han and Lee, Ki S. and Li, Erluo and Lim, Chium L. and Tang, Ao and Weatherspoon, Hakim</td> |
| 8169 | </tr> |
| 8170 | |
| 8171 | <tr> |
| 8172 | <td valign="top">Title</td> |
| 8173 | <td valign="top">Timing is Everything: Accurate, Minimum Overhead, Available Bandwidth Estimation in High-speed Wired Network</td> |
| 8174 | </tr> |
| 8175 | |
| 8176 | <tr> |
| 8177 | <td valign="top">Booktitle</td> |
| 8178 | <td valign="top">Internet Measurement Conference</td> |
| 8179 | </tr> |
| 8180 | |
| 8181 | <tr> |
| 8182 | <td valign="top">Location</td> |
| 8183 | <td valign="top">Vancouver</td> |
| 8184 | </tr> |
| 8185 | |
| 8186 | <tr> |
| 8187 | <td valign="top">Year</td> |
| 8188 | <td valign="top">2014</td> |
| 8189 | </tr> |
| 8190 | |
| 8191 | <tr> |
| 8192 | <td valign="top">Abstract</td> |
| 8193 | <td valign="top">Active end-to-end available bandwidth estimation is intrusive, expensive, inaccurate, and does not work well with bursty cross traffic or on high capacity links. Yet, it is important for designing high performant networked systems, improving network protocols, building distributed systems, and improving application performance. In this paper, we present minProbe which addresses unsolved issues that have plagued available bandwidth estimation. As a middlebox, minProbe measures and estimates available bandwidth with high-fidelity, minimal-cost, and in userspace; thus, enabling cheaper (virtually no overhead) and more accurate available bandwidth estimation. MinProbe performs accurately on high capacity networks up to 10 Gbps and with bursty cross traffic. We evaluated the performance and accuracy of minProbe over a wide-area network, the National Lambda Rail (NLR), and within our own network testbed. Results indicate that minProbe can estimate available bandwidth with error typically no more than 0.4 Gbps in a 10 Gbps network.</td> |
| 8194 | </tr> |
| 8195 | |
| 8196 | |
| 8197 | |
| 8198 | <tr> |
| 8199 | <td valign="top">DOI</td> |
| 8200 | <td valign="top">10.1145/2663716.2663746</td> |
| 8201 | </tr> |
| 8202 | |
| 8203 | |
| 8204 | |
| 8205 | <tr> |
| 8206 | <td valign="top">URL</td> |
| 8207 | <td valign="top"><a href="http://fireless.cs.cornell.edu/publications/minprobe_imc14.pdf">http://fireless.cs.cornell.edu/publications/minprobe_imc14.pdf</a></td> |
| 8208 | </tr> |
| 8209 | |
| 8210 | |
| 8211 | </li> |
| 8212 | |
| 8213 | </table></div><br><br> |
| 8214 | |
| 8215 | |
| 8216 | |
| 8217 | |
| 8342 | <a class="EntryGoto" id="Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul"></a> |
| 8343 | <b class="myheading" style="position: relative; left: 5%;">Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</b> |
| 8344 | |
| 8345 | <div class="BibEntry"> |
| 8346 | |
| 8347 | <table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;"> |
| 8348 | |
| 8349 | <li> |
| 8350 | |
| 8351 | |
| 8352 | <tr> |
| 8353 | <td valign="top">Author</td> |
| 8354 | <td valign="top">Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</td> |
| 8355 | </tr> |
| 8356 | |
| 8357 | <tr> |
| 8358 | <td valign="top">Title</td> |
| 8359 | <td valign="top">Capacity of Inter-cloud Layer-2 Virtual Networking</td> |
| 8360 | </tr> |
| 8361 | |
| 8362 | <tr> |
| 8363 | <td valign="top">Booktitle</td> |
| 8364 | <td valign="top">Proceedings of the 2014 ACM SIGCOMM Workshop on Distributed Cloud Computing</td> |
| 8365 | </tr> |
| 8366 | |
| 8367 | <tr> |
| 8368 | <td valign="top">Location</td> |
| 8369 | <td valign="top">Chicago, Illinois, USA</td> |
| 8370 | </tr> |
| 8371 | |
| 8372 | <tr> |
| 8373 | <td valign="top">Publisher</td> |
| 8374 | <td valign="top">ACM</td> |
| 8375 | </tr> |
| 8376 | |
| 8377 | <tr> |
| 8378 | <td valign="top">Address</td> |
| 8379 | <td valign="top">New York, NY, USA</td> |
| 8380 | </tr> |
| 8381 | |
| 8382 | <tr> |
| 8383 | <td valign="top">Year</td> |
| 8384 | <td valign="top">2014</td> |
| 8385 | </tr> |
| 8386 | |
| 8387 | <tr> |
| 8388 | <td valign="top">Abstract</td> |
| 8389 | <td valign="top">Due to the economy of scale of Ethernet networks and available dynamic circuit capability from the major national research and educational networks, VLAN (Virtual LAN) based virtual networking solution has been successfully adopted in some advanced distributed cloud systems. However, there are two major constraints in this adaptation: (1) dynamic circuit service is far from pervasive; (2) there is only limited VLAN tags offered by regional network service providers. In this paper, after examining layer-2 networking in large-scale distributed cloud environments, we present a graph theoretical model to study the network capacity in terms of the number of inter-cloud connections that can co-exist. We further design the algorithms to achieve this capacity for both point-to-point and multi-point inter-cloud connections in both static and dynamic scenarios. We also study a general topology embedding problem based on this model. As tagging is a common mechanism for isolating communication channels in other network layers, the proposed models and algorithms can be extended to optical and IP networks.</td> |
| 8390 | </tr> |
| 8391 | |
| 8392 | |
| 8393 | |
| 8394 | <tr> |
| 8395 | <td valign="top">DOI</td> |
| 8396 | <td valign="top">10.1145/2627566.2627573</td> |
| 8397 | </tr> |
| 8398 | |
| 8399 | |
| 8400 | |
| 8401 | <tr> |
| 8402 | <td valign="top">URL</td> |
| 8403 | <td valign="top"><a href="http://dx.doi.org/10.1145/2627566.2627573">http://dx.doi.org/10.1145/2627566.2627573</a></td> |
| 8404 | </tr> |
| 8405 | |
| 8406 | |
| 8407 | </li> |
| 8408 | |
| 8409 | </table></div><br><br> |
| 8410 | |
| 8411 | |
| 8412 | |
| 8413 | |