Changes between Version 26 and Version 27 of GENIBibliography


Ignore:
Timestamp:
04/29/15 16:07:40 (5 years ago)
Author:
Mark Berman
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • GENIBibliography

    v26 v27  
    224224
    225225<li>
     226<b>Baldine, I.</b>
     227, &quot;Unique optical networking facilities and cross-layer networking.&quot;
     228Summer Topical Meeting, 2009. LEOSST '09. IEEE/LEOS,
     2292009.
     230doi:10.1109/LEOSST.2009.5226210.
     231<a href="http://dx.doi.org/10.1109/LEOSST.2009.5226210">http://dx.doi.org/10.1109/LEOSST.2009.5226210</a>
     232
     233</li>
     234<br>
     235
     236
     237
     238<li>
     239<b>Baldine, Ilia and Xin, Yufeng and Evans, Daniel and Heerman, Chris and Chase, Jeff and Marupadi, Varun and Yumerefendi, Aydan</b>
     240, &quot;The missing link: Putting the network in networked cloud computing.&quot;
     241in ICVCI09: International Conference on the Virtual Computing Initiative,
     2422009.
     243
     244
     245
     246</li>
     247<br>
     248
     249
     250
     251<li>
    226252<b>Elliott, Chip and Falk, Aaron</b>
    227253, &quot;An update on the GENI project.&quot;
     
    416442
    417443<a href="http://s3.amazonaws.com/marcoy&#x005F;thesis/Thesis.pdf">http://s3.amazonaws.com/marcoy&#x005F;thesis/Thesis.pdf</a>
    418 <br><br><b>Abstract: </b>Computer networking researchers often have access to a few di
    419 erent network testbeds (Section 1.2) for their experiments. However, those testbeds are limited in resources; contentions for resources are prominent in those testbeds especially when conference deadline is looming. Moreover, services running on those testbeds are subject to seasonal and daily trac spikes from users all round the world. Hence, demand for resources at the testbeds are high. Some researchers can use other testbeds in conjunction with the ones they are using. Even though each of the testbeds may have di
    420 erent infrastructures, and characteristics, in the end, what the researchers receive in return is a set of computing resources, either virtual machines or physical machines. Essentially, those testbeds are providing a similar service, but researchers have to manage the credentials for accessing the testbeds manually, and they have to manually request resources from di
    421 erent testbeds in order to setup experiments that span across di
    422 erent testbeds. This thesis presents GENICloud, a project that enables the federation of testbeds with clouds. Computing and storage resources can be provisioned to researchers and services running on existing testbeds dynamically from an Eucalyptus cloud. As a part of the GENICloud project, the user proxy (Section 3.4) provides a less arduous method for testbeds administrators to federate with other testbeds; the same serviceiv also manages researchers credentials, so they do not have to acquire resources from each testbed individually. The user proxy provides a single interface for researchers to interact with di
    423 erent testbeds and clouds and manage their experiments. Furthermore, GENICloud demonstrates that there are, in fact, quite a few architectural similarities between di
    424 erent testbeds and even clouds
     444<br><br><b>Abstract: </b>Computer networking researchers often have access to a few dierent network testbeds (Section 1.2) for their experiments. However, those testbeds are limited in resources; contentions for resources are prominent in those testbeds especially when conference deadline is looming. Moreover, services running on those testbeds are subject to seasonal and daily trac spikes from users all round the world. Hence, demand for resources at the testbeds are high. Some researchers can use other testbeds in conjunction with the ones they are using. Even though each of the testbeds may have dierent infrastructures, and characteristics, in the end, what the researchers receive in return is a set of computing resources, either virtual machines or physical machines. Essentially, those testbeds are providing a similar service, but researchers have to manage the credentials for accessing the testbeds manually, and they have to manually request resources from dierent testbeds in order to setup experiments that span across dierent testbeds. This thesis presents GENICloud, a project that enables the federation of testbeds with clouds. Computing and storage resources can be provisioned to researchers and services running on existing testbeds dynamically from an Eucalyptus cloud. As a part of the GENICloud project, the user proxy (Section 3.4) provides a less arduous method for testbeds administrators to federate with other testbeds; the same serviceiv also manages researchers credentials, so they do not have to acquire resources from each testbed individually. The user proxy provides a single interface for researchers to interact with dierent testbeds and clouds and manage their experiments. Furthermore, GENICloud demonstrates that there are, in fact, quite a few architectural similarities between dierent testbeds and even clouds
    425445</li>
    426446<br>
     
    485505
    486506<li>
     507<b>Chen, Kang and Shen, Haiying</b>
     508, &quot;Global optimization of file availability through replication for efficient file sharing in MANETs.&quot;
     509Network Protocols (ICNP), 2011 19th IEEE International Conference on, Vancouver, AB, Canada, IEEE,
     5102011.
     511doi:10.1109/icnp.2011.6089056.
     512<a href="http://dx.doi.org/10.1109/icnp.2011.6089056">http://dx.doi.org/10.1109/icnp.2011.6089056</a>
     513<br><br><b>Abstract: </b>File sharing applications in mobile ad hoc networks (MANETs) have attracted more and more attention in recent years. The efficiency of file querying suffers from the distinctive properties of MANETs including node mobility and limited communication range and resource. An intuitive method to alleviate this problem is to create file replicas in the network. However, despite the efforts on file replication, no research has focused on the global optimal replica sharing with minimum average querying delay. Specifically, current file replication protocols in MANETs have two shortcomings. First, they lack a rule to allocate limited resource to different files in order to minimize the average querying delay. Second, they simply consider storage as resource for replicas, but neglect the fact that the file holders' frequency of meeting other nodes also plays an important role in determining file availability. A node having a higher meeting frequency with others provides higher availability to its files. In this paper, we introduce a new concept of resource for file replication, which considers both node storage and meeting frequency. We theoretically study the influence of resource allocation on the average querying delay and derive a resource allocation rule to minimize the average querying delay. We further propose a distributed file replication protocol that follows the rule. The trace-driven experiments on both the real-world GENI testbed and NS-2 show that our protocol can achieve shorter average querying delay at lower cost than current replication protocols, which justifies the correctness of our theoretical analysis and the effectiveness of the proposed protocol.
     514</li>
     515<br>
     516
     517
     518
     519<li>
    487520<b>Chen, Kang and Shen, Haiying and Zhang, Haibo</b>
    488521, &quot;Leveraging Social Networks for P2P Content-Based File Sharing in Mobile Ad Hoc Networks.&quot;
     
    628661
    629662<li>
     663<b>Mandal, A. and Xin, Yufeng and Baldine, I. and Ruth, P. and Heerman, C. and Chase, J. and Orlikowski, V. and Yumerefendi, A.</b>
     664, &quot;Provisioning and Evaluating Multi-domain Networked Clouds for Hadoop-based Applications.&quot;
     665Cloud Computing Technology and Science (CloudCom), 2011 IEEE Third International Conference on,
     6662011.
     667doi:10.1109/CloudCom.2011.107.
     668<a href="http://dx.doi.org/10.1109/CloudCom.2011.107">http://dx.doi.org/10.1109/CloudCom.2011.107</a>
     669
     670</li>
     671<br>
     672
     673
     674
     675<li>
    630676<b>Ozcelik, Ilker and Brooks, Richard R.</b>
    631677, &quot;Security experimentation using operational systems.&quot;
     
    783829
    784830
     831<li>
     832<b>Wallace, Scott A. and Muhammad, Monzur and Mache, Jens and Cappos, Justin</b>
     833, &quot;Hands-on Internet with Seattle and Computers from Across the Globe.&quot;
     834J. Comput. Sci. Coll., Consortium for Computing Sciences in Colleges, USA,
     8352011.
     836
     837<a href="http://portal.acm.org/citation.cfm?id=2037151.2037181">http://portal.acm.org/citation.cfm?id=2037151.2037181</a>
     838<br><br><b>Abstract: </b>The Internet Connectivity module is a short assignment covering distributed computing and networking. The Internet Connectivity module is part of the curriculum created for the Northwest Distributed Computer Science Department and is built upon the Seattle distributed computing platform. In this paper, we describe the module and illustrate how Seattle facilitates networking projects and experiments that use computers/resources from across the globe. In addition, we describe how the Internet Connectivity module was used in two courses, provide some comments on students' reactions to the project, and conclude with suggestions for faculty considering how to use this module in their future courses.
     839</li>
     840<br>
     841
     842
     843
     844<li>
     845<b>Xin, Yufeng and Baldine, Ilia and Mandal, Anirban and Heermann, Chris and Chase, Jeff and Yumerefendi, Aydan</b>
     846, &quot;Embedding Virtual Topologies in Networked Clouds.&quot;
     847Proceedings of the 6th International Conference on Future Internet Technologies, Seoul, Republic of Korea, ACM, New York, NY, USA,
     8482011.
     849doi:10.1145/2002396.2002403.
     850<a href="http://doi.acm.org/10.1145/2002396.2002403">http://doi.acm.org/10.1145/2002396.2002403</a>
     851
     852</li>
     853<br>
     854
     855
     856
    785857<br>
    786858<a id="full-2012"><H2>GENI Publications for 2012</H2></a>
     
    10361108<li>
    10371109<b>Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
    1038 , &quot;Performance of GENI Cloud Testbeds for Real Time Scientific Application.&quot;
    1039 First GENI Research and Educational Experiment Workshop (GREE 2012), Los Angeles,
    1040 2012.
    1041 
    1042 
    1043 <br><br><b>Abstract: </b>Dedicating high end servers for short-term execution of scientific applications such as weather forecasting wastes resources. Cloud platforms IaaS model seems well suited for applications which are executed on an irregular basis and for short duration. In this paper, we evaluate the performance of research testbed cloud platforms such as GENICloud and ORCA cloud clusters for our real-time scientific application of short-term weather forecasting called Nowcasting. In this paper, we evaluate the network capabilities of these research cloud testbeds for our real-time application of weather forecasting. In addition, we evaluate the computation time of executing Nowcasting on each cloud platform for weather data collected from real weather events. We also evaluate the total time taken to generate and transmit short-term forecast images to end users with live data from our own radar on campus. We also compare the performance of each of these clusters for Nowcasting with commercial cloud services such as Amazon's EC2. The results obtained from our measurement show that cloud testbeds are suitable for real-time application experiments to be carried out on a cloud platform.
    1044 </li>
    1045 <br>
    1046 
    1047 <li>
    1048 <b>Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
    10491110, &quot;Network capabilities of cloud services for a real time scientific application.&quot;
    1050111137th Annual IEEE Conference on Local Computer Networks, Clearwater Beach, FL, USA, IEEE,
     
    10561117<br>
    10571118
     1119<li>
     1120<b>Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
     1121, &quot;Performance of GENI Cloud Testbeds for Real Time Scientific Application.&quot;
     1122First GENI Research and Educational Experiment Workshop (GREE 2012), Los Angeles,
     11232012.
     1124
     1125
     1126<br><br><b>Abstract: </b>Dedicating high end servers for short-term execution of scientific applications such as weather forecasting wastes resources. Cloud platforms IaaS model seems well suited for applications which are executed on an irregular basis and for short duration. In this paper, we evaluate the performance of research testbed cloud platforms such as GENICloud and ORCA cloud clusters for our real-time scientific application of short-term weather forecasting called Nowcasting. In this paper, we evaluate the network capabilities of these research cloud testbeds for our real-time application of weather forecasting. In addition, we evaluate the computation time of executing Nowcasting on each cloud platform for weather data collected from real weather events. We also evaluate the total time taken to generate and transmit short-term forecast images to end users with live data from our own radar on campus. We also compare the performance of each of these clusters for Nowcasting with commercial cloud services such as Amazon's EC2. The results obtained from our measurement show that cloud testbeds are suitable for real-time application experiments to be carried out on a cloud platform.
     1127</li>
     1128<br>
     1129
    10581130
    10591131
     
    14401512
    14411513<li>
     1514<b>Chen, Kang and Shen, Haiying</b>
     1515, &quot;Cont2: Social-Aware Content and Contact Based File Search in Delay Tolerant Networks.&quot;
     1516Proceedings of the 2013 42Nd International Conference on Parallel Processing, IEEE Computer Society, Washington, DC, USA,
     15172013.
     1518doi:10.1109/icpp.2013.28.
     1519<a href="http://dx.doi.org/10.1109/icpp.2013.28">http://dx.doi.org/10.1109/icpp.2013.28</a>
     1520<br><br><b>Abstract: </b>In this paper, we focus on distributed file search over a delay tolerant network (DTN) formed by mobile devices that exhibit the characteristics of social networks. Current file search methods in MANETs/DTNs are either content-based or contact-based. The former builds routing tables for node contents but is not resilient to high node mobility, while the latter exploits node contact patterns in the social networks but may lead to high latency. Recent research also reveal the importance of interests in realizing efficient file dissemination in DTNs. In this paper, we first analyze node interest and mobility from real traces, which confirms the shortcomings of a contact based method and show the importance of considering both content/interest and contact in file search. We then propose Cont2, a social-aware file search method which leverages both node social interests (content) and contact patterns to enhance search efficiency. First, considering people with common interests tend to share files and gather together, Cont2 virtually groups common-interest nodes into a community to direct file search. Second, considering human mobility follows a certain pattern, Cont2 exploits nodes that have high contact frequency with the queried content. Third, Cont2 also exploits active nodes that have more connections to others as a complementary approach to expedite file search. Trace-driven experimental on the real-world GENI test bed and NS-2 simulator show that Cont2 can significantly improve the search efficiency compared to current methods.
     1521</li>
     1522<br>
     1523
     1524
     1525
     1526<li>
    14421527<b>Esposito, Flavio and Wang, Yuefeng and Matta, Ibrahim and Day, John</b>
    14431528, &quot;Dynamic Layer Instantiation as a Service.&quot;
     
    15421627
    15431628<li>
     1629<b>Lauer, Gregory and Irwin, Ryan and Kappler, Chris and Nishioka, Itaru</b>
     1630, &quot;Distributed Resource Control Using Shadowed Subgraphs.&quot;
     1631Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies, Santa Barbara, California, USA, ACM, New York, NY, USA,
     16322013.
     1633doi:10.1145/2535372.2535410.
     1634<a href="http://dx.doi.org/10.1145/2535372.2535410">http://dx.doi.org/10.1145/2535372.2535410</a>
     1635<br><br><b>Abstract: </b>As software defined networks (SDN) grow in size and in number, the problem of coordinating the actions of multiple SDN controllers will grow in importance. In this paper, we propose a way of organizing SDN control based on coordinated subgraph shadowing. Graphs are a natural way to think about and describe SDN activity. Subgraphs provide a means to share a subset of a network's resources. Shadowing provides a means to dynamically update shared subgraphs. Leveraging advances in graph databases and our shadowing messaging technique, we discuss our implementation of a multi-domain virtual private network (VPN) using multi-protocol label switching (MPLS).
     1636</li>
     1637<br>
     1638
     1639
     1640
     1641<li>
    15441642<b>Lee, Ki S. and Wang, Han and Weatherspoon, Hakim</b>
    15451643, &quot;SoNIC: Precise Realtime Software Access and Control of Wired Networks.&quot;
     
    15551653
    15561654<li>
     1655<b>Li, Ting and Van Vorst, Nathanael and Liu, Jason</b>
     1656, &quot;A Rate-based TCP Traffic Model to Accelerate Network Simulation.&quot;
     1657Simulation, Society for Computer Simulation International, San Diego, CA, USA,
     16582013.
     1659doi:10.1177/0037549712469892.
     1660<a href="http://dx.doi.org/10.1177/0037549712469892">http://dx.doi.org/10.1177/0037549712469892</a>
     1661<br><br><b>Abstract: </b>Traditional discrete-event simulation of large-scale networks at the packet level is computationally expensive. This article presents a fast rate-based transmission control protocol (RTCP) traffic model designed to reduce the time and space complexity for simulating network traffic whilst maintaining good accuracy. A distinct feature of the proposed model is that the transmission control protocol (TCP) congestion control behavior is represented using analytical models that describe the send rate at the traffic source as a function of the round-trip time and the packet loss rate at different phases of a TCP connection. Rather than modeling at the granularity of individual packets visiting the intermediate routers, the model approximates traffic flows as a series of rate windows, each consisting of a number of packets considered to possess the same arrival rate. The model calculates the queuing delays and the packet losses as these rate windows traverse the individual network queues along the flow path. The proposed RTCP model is able to achieve a performance advantage over other TCP models, by integrating analytical solutions and aggregating traffic using rate windows. Empirical results show that the RTCP model can correctly capture the overall TCP behavior and achieve a speedup of more than two orders of magnitude over the corresponding detailed packet-oriented simulation.
     1662</li>
     1663<br>
     1664
     1665
     1666
     1667<li>
    15571668<b>Mandal, Anirban and Ruth, Paul and Baldin, Ilya and Xin, Yufeng and Castillo, Claris and Rynge, Mats and Deelman, Ewa</b>
    15581669, &quot;Evaluating I/O Aware Network Management for Scientific Workflows on Networked Clouds.&quot;
     
    156016712013.
    15611672doi:10.1145/2534695.2534698.
     1673<a href="http://doi.acm.org/10.1145/2534695.2534698">http://doi.acm.org/10.1145/2534695.2534698</a>
     1674
     1675</li>
     1676<br>
     1677
     1678<li>
     1679<b>Mandal, Anirban and Ruth, Paul and Baldin, Ilya and Xin, Yufeng and Castillo, Claris and Rynge, Mats and Deelman, Ewa</b>
     1680, &quot;Evaluating I/O Aware Network Management for Scientific Workflows on Networked Clouds.&quot;
     1681Proceedings of the Third International Workshop on Network-Aware Data Management, Denver, Colorado, ACM, New York, NY, USA,
     16822013.
     1683doi:10.1145/2534695.2534698.
    15621684<a href="http://dx.doi.org/10.1145/2534695.2534698">http://dx.doi.org/10.1145/2534695.2534698</a>
    15631685<br><br><b>Abstract: </b>This paper presents a performance evaluation of scientific workflows on networked cloud systems with particular emphasis on evaluating the effect of provisioned network bandwidth on application I/O performance. The experiments were run on ExoGENI, a widely distributed networked infrastructure as a service (NIaaS) testbed. ExoGENI orchestrates a federation of independent cloud sites located around the world along with backbone circuit providers. The evaluation used a representative data-intensive scientific workflow application called Montage. The application was deployed on a virtualized HTCondor environment provisioned dynamically from the ExoGENI networked cloud testbed, and managed by the Pegasus workflow manager. The results of our experiments show the effect of modifying provisioned network bandwidth on disk I/O throughput and workflow execution time. The marginal benefit as perceived by the workflow reduces as the network bandwidth allocation increases to a point where disk I/O saturates. There is little or no benefit from increasing network bandwidth beyond this inflection point. The results also underline the importance of network and I/O performance isolation for predictable application performance, and are applicable for general data-intensive workloads. Insights from this work will also be useful for real-time monitoring, application steering and infrastructure planning for data-intensive workloads on networked cloud platforms.
     
    18151937
    18161938<li>
     1939<b>Zhang, Yihua and Steele, Aaron and Blanton, Marina</b>
     1940, &quot;PICCO: A General-purpose Compiler for Private Distributed Computation.&quot;
     1941Proceedings of the 2013 ACM SIGSAC Conference on Computer &#x0026;&#x0023;38; Communications Security, Berlin, Germany, ACM, New York, NY, USA,
     19422013.
     1943doi:10.1145/2508859.2516752.
     1944<a href="http://dx.doi.org/10.1145/2508859.2516752">http://dx.doi.org/10.1145/2508859.2516752</a>
     1945<br><br><b>Abstract: </b>Secure computation on private data has been an active area of research for many years and has received a renewed interest with the emergence of cloud computing. In recent years, substantial progress has been made with respect to the efficiency of the available techniques and several implementations have appeared. The available tools, however, lacked a convenient mechanism for implementing a general-purposeprogram in a secure computation framework suitable for execution in not fully trusted environments. This work fulfills this gap and describes a system, called PICCO, for converting a program written in an extension of C into its distributed secure implementation and running it in a distributed environment. The C extension preserves all current features of the programming language and allows variables to be marked as private and be used in general-purpose computation. Secure distributed implementation of compiled programs is based on linear secret sharing, achieving efficiency and information-theoretical security. Our experiments also indicate that many programs can be evaluated very efficiently on private data using PICCO.
     1946</li>
     1947<br>
     1948
     1949
     1950
     1951<li>
    18171952<b>Zhuang, Yanyan and Rafetseder, A. and Cappos, J.</b>
    18181953, &quot;Experience with Seattle: A Community Platform for Research and Education.&quot;
     
    23892524
    23902525<li>
     2526<b>Naylor, David and Mukerjee, Matthew K. and Agyapong, Patrick and Grandl, Robert and Kang, Ruogu and Machado, Michel and Brown, Stephanie and Doucette, Cody and Hsiao, Hsu C. and Han, Dongsu and Kim, Tiffany H. and Lim, Hyeontaek and Ovon, Carol and Zhou, Dong and Lee, Soo B. and Lin, Yue H. and Stuart, Colleen and Barrett, Daniel and Akella, Aditya and Andersen, David and Byers, John and Dabbish, Laura and Kaminsky, Michael and Kiesler, Sara and Peha, Jon and Perrig, Adrian and Seshan, Srinivasan and Sirbu, Marvin and Steenkiste, Peter</b>
     2527, &quot;XIA: Architecting a More Trustworthy and Evolvable Internet.&quot;
     2528SIGCOMM Comput. Commun. Rev., ACM, New York, NY, USA,
     25292014.
     2530doi:10.1145/2656877.2656885.
     2531<a href="http://dx.doi.org/10.1145/2656877.2656885">http://dx.doi.org/10.1145/2656877.2656885</a>
     2532<br><br><b>Abstract: </b>Motivated by limitations in today's host-centric IP network, recent studies have proposed clean-slate network architectures centered around alternate first-class principals, such as content, services, or users. However, muchlike the host-centric IP design, elevating one principal type above others hinders communication between other principals and inhibits the network's capability to evolve. This paper presents the eXpressive Internet Architecture (XIA), an architecture with native support for multiple principals and the ability to evolve its functionality to accommodate new, as yet unforeseen, principals over time. We present the results of our ongoing research motivated by and building on the XIA architecture, ranging from topics at the physical level (``how fast can XIA go'') up through to the user level.
     2533</li>
     2534<br>
     2535
     2536
     2537
     2538<li>
    23912539<b>Nozaki, Yoshihiro and Bakshi, Parth and Tuncer, Hasan and Shenoy, Nirmala</b>
    23922540, &quot;Evaluation of tiered routing protocol in floating cloud tiered internet architecture.&quot;
     
    24022550
    24032551<li>
     2552<b>Qiu, Chenxi and Shen, Haiying</b>
     2553, &quot;A Delaunay-Based Coordinate-Free Mechanism for Full Coverage in Wireless Sensor Networks.&quot;
     2554Parallel and Distributed Systems, IEEE Transactions on, IEEE,
     25552014.
     2556doi:10.1109/tpds.2013.134.
     2557<a href="http://dx.doi.org/10.1109/tpds.2013.134">http://dx.doi.org/10.1109/tpds.2013.134</a>
     2558<br><br><b>Abstract: </b>Recently, many schemes have been proposed for detecting and healing coverage holes to achieve full coverage in wireless sensor networks (WSNs). However, none of these schemes aim to find the shortest node movement paths to heal the coverage holes, which could significantly reduce energy usage for node movement. Also, current hole healing schemes require accurate knowledge of sensor locations; obtaining this knowledge consumes high energy. In this paper, we propose a Delaunay-based coordinate-free mechanism (DECM) for full coverage. Based on rigorous mathematical analysis, DECM can detect coverage holes and find the locally shortest paths for healing holes in a distributed manner without requiring accurate node location information. Also, DECM incorporates a cooperative movement mechanism that can prevent generating new holes during node movements in healing holes. Simulation results and experimental results from the real-world GENI Orbit testbed show that DECM achieves superior performance in terms of the energy-efficiency, effectiveness of hole healing, energy consumption balance and lifetime compared to previous schemes.
     2559</li>
     2560<br>
     2561
     2562
     2563
     2564<li>
    24042565<b>Rakotoarivelo, Thierry and Jourjon, Guillaume and Mehani, Olivier and Ott, Maximilian and Zink, Mike</b>
    24052566, &quot;Repeatable Experiments with LabWiki.&quot;
     
    26632824<li>
    26642825<b>Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</b>
     2826, &quot;Scaling up applications over distributed clouds with dynamic layer-2 exchange and broadcast service.&quot;
     2827Teletraffic Congress (ITC), 2014 26th International, IEEE,
     28282014.
     2829doi:10.1109/itc.2014.6932973.
     2830<a href="http://dx.doi.org/10.1109/itc.2014.6932973">http://dx.doi.org/10.1109/itc.2014.6932973</a>
     2831<br><br><b>Abstract: </b>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.
     2832</li>
     2833<br>
     2834
     2835<li>
     2836<b>Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</b>
    26652837, &quot;Capacity of Inter-cloud Layer-2 Virtual Networking.&quot;
    26662838Proceedings of the 2014 ACM SIGCOMM Workshop on Distributed Cloud Computing, Chicago, Illinois, USA, ACM, New York, NY, USA,
     
    26692841<a href="http://dx.doi.org/10.1145/2627566.2627573">http://dx.doi.org/10.1145/2627566.2627573</a>
    26702842<br><br><b>Abstract: </b>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.
    2671 </li>
    2672 <br>
    2673 
    2674 <li>
    2675 <b>Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</b>
    2676 , &quot;Scaling up applications over distributed clouds with dynamic layer-2 exchange and broadcast service.&quot;
    2677 Teletraffic Congress (ITC), 2014 26th International, IEEE,
    2678 2014.
    2679 doi:10.1109/itc.2014.6932973.
    2680 <a href="http://dx.doi.org/10.1109/itc.2014.6932973">http://dx.doi.org/10.1109/itc.2014.6932973</a>
    2681 <br><br><b>Abstract: </b>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.
    26822843</li>
    26832844<br>
     
    27682929
    27692930<li>
     2931<b>Elliott, Steven D.</b>
     2932, &quot;Exploring the Challenges and Opportunities of Implementing Software-Defined Networking in a Research Testbed.&quot;
     2933
     29342015.
     2935
     2936<a href="http://repository.lib.ncsu.edu/ir/bitstream/1840.16/10164/1/etd.pdf">http://repository.lib.ncsu.edu/ir/bitstream/1840.16/10164/1/etd.pdf</a>
     2937<br><br><b>Abstract: </b>Designing a new network and upgrading existing network infrastructure are complex and arduous tasks. These projects are further complicated in campus, regional, and international research networks given the large bandwidth and unique segmentation requirements coupled with the unknown implications of testing new network protocols. The software-defined networking (SDN) revolution promises to alleviate these challenges by separating the network control plane from the data plane [208]. This allows for a more flexible and programmable network. While SDN has delivered large dividends to early adopters, it is still a monumental undertaking to re-architect an existing network to use new technology. To ease the transition burden, many research networks have chosen either a hybrid SDN solution or a clean-slate approach. Unfortunately, neither of these approaches can avoid the limitations of existing SDN implementations. For example, software-defined networking can introduce an increase in packet delay in a previously low-latency network. Therefore, it is vital for administrators to have an indepth understanding of these new challenges during the SDN transition. OpenFlow (OF) [209], the protocol many SDN controllers use to communicate with network devices, also has several drawbacks that network architects need to discern before designing the network. Therefore, care must be taken when designing and implementing a software-defined network. This thesis takes an in-depth look at Stanford University, GENI, and OFELIA as case study examples of campus, national, and international research networks that utilize SDN concepts. Additionally, we detail the planning of the future MCNC SDN that will connect several North Carolina research institutions using a high-speed software-defined network. After dissecting the design and implementation of these software-defined research networks, we present common challenges and lessons learned. Our analysis uncovered some common issues in existing software-defined networks. For example, there are problems with the Spanning Tree Protocol (STP), switch/OpenFlow compatibility, hybrid OpenFlow/legacy switch implementations, and the FlowVisor network slicing tool. These potential issues are discussed in detail. Trends include implementation of OpenFlow version 1.3, use of commercial-quality controllers, and a transition to inexpensive network hardware through the use of software switches and NetFPGAs. We hope the findings presented in this thesis will allow network architects to avoid some of the difficulties that arise in design, implementation, and policy decisions when campus and other research networks are transitioning to a software-defined approach.
     2938</li>
     2939<br>
     2940
     2941
     2942
     2943<li>
    27702944<b>Mukherjee, Shreyasee and Baid, Akash and Raychaudhuri, Dipankar</b>
    27712945, &quot;Integrating Advanced Mobility Services into the Future Internet Architecture.&quot;
     
    29743148
    29753149<li>
     3150<b>Baldine, I.</b>
     3151, &quot;Unique optical networking facilities and cross-layer networking.&quot
     3152Summer Topical Meeting, 2009. LEOSST '09. IEEE/LEOS,
     31532009.
     3154doi:10.1109/LEOSST.2009.5226210.
     3155</li>
     3156<br>
     3157
     3158
     3159
     3160<li>
     3161<b>Baldine, Ilia and Xin, Yufeng and Evans, Daniel and Heerman, Chris and Chase, Jeff and Marupadi, Varun and Yumerefendi, Aydan</b>
     3162, &quot;The missing link: Putting the network in networked cloud computing.&quot
     3163in ICVCI09: International Conference on the Virtual Computing Initiative,
     31642009.
     3165
     3166</li>
     3167<br>
     3168
     3169
     3170
     3171<li>
    29763172<b>Elliott, Chip and Falk, Aaron</b>
    29773173, &quot;An update on the GENI project.&quot
     
    31913387
    31923388<li>
     3389<b>Chen, Kang and Shen, Haiying</b>
     3390, &quot;Global optimization of file availability through replication for efficient file sharing in MANETs.&quot
     3391Network Protocols (ICNP), 2011 19th IEEE International Conference on, Vancouver, AB, Canada, IEEE,
     33922011.
     3393doi:10.1109/icnp.2011.6089056.
     3394</li>
     3395<br>
     3396
     3397
     3398
     3399<li>
    31933400<b>Chen, Kang and Shen, Haiying and Zhang, Haibo</b>
    31943401, &quot;Leveraging Social Networks for P2P Content-Based File Sharing in Mobile Ad Hoc Networks.&quot
     
    33123519
    33133520<li>
     3521<b>Mandal, A. and Xin, Yufeng and Baldine, I. and Ruth, P. and Heerman, C. and Chase, J. and Orlikowski, V. and Yumerefendi, A.</b>
     3522, &quot;Provisioning and Evaluating Multi-domain Networked Clouds for Hadoop-based Applications.&quot
     3523Cloud Computing Technology and Science (CloudCom), 2011 IEEE Third International Conference on,
     35242011.
     3525doi:10.1109/CloudCom.2011.107.
     3526</li>
     3527<br>
     3528
     3529
     3530
     3531<li>
    33143532<b>Ozcelik, Ilker and Brooks, Richard R.</b>
    33153533, &quot;Security experimentation using operational systems.&quot
     
    34433661
    34443662
     3663<li>
     3664<b>Wallace, Scott A. and Muhammad, Monzur and Mache, Jens and Cappos, Justin</b>
     3665, &quot;Hands-on Internet with Seattle and Computers from Across the Globe.&quot
     3666J. Comput. Sci. Coll., Consortium for Computing Sciences in Colleges, USA,
     36672011.
     3668
     3669</li>
     3670<br>
     3671
     3672
     3673
     3674<li>
     3675<b>Xin, Yufeng and Baldine, Ilia and Mandal, Anirban and Heermann, Chris and Chase, Jeff and Yumerefendi, Aydan</b>
     3676, &quot;Embedding Virtual Topologies in Networked Clouds.&quot
     3677Proceedings of the 6th International Conference on Future Internet Technologies, Seoul, Republic of Korea, ACM, New York, NY, USA,
     36782011.
     3679doi:10.1145/2002396.2002403.
     3680</li>
     3681<br>
     3682
     3683
     3684
    34453685<br>
    34463686<a id="concise-2012"><H2>GENI Publications for 2012</H2></a>
     
    36583898<li>
    36593899<b>Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
     3900, &quot;Network capabilities of cloud services for a real time scientific application.&quot
     390137th Annual IEEE Conference on Local Computer Networks, Clearwater Beach, FL, USA, IEEE,
     39022012.
     3903doi:10.1109/lcn.2012.6423665.
     3904</li>
     3905<br>
     3906
     3907<li>
     3908<b>Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
    36603909, &quot;Performance of GENI Cloud Testbeds for Real Time Scientific Application.&quot
    36613910First GENI Research and Educational Experiment Workshop (GREE 2012), Los Angeles,
    366239112012.
    36633912
    3664 </li>
    3665 <br>
    3666 
    3667 <li>
    3668 <b>Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
    3669 , &quot;Network capabilities of cloud services for a real time scientific application.&quot
    3670 37th Annual IEEE Conference on Local Computer Networks, Clearwater Beach, FL, USA, IEEE,
    3671 2012.
    3672 doi:10.1109/lcn.2012.6423665.
    36733913</li>
    36743914<br>
     
    40004240
    40014241<li>
     4242<b>Chen, Kang and Shen, Haiying</b>
     4243, &quot;Cont2: Social-Aware Content and Contact Based File Search in Delay Tolerant Networks.&quot
     4244Proceedings of the 2013 42Nd International Conference on Parallel Processing, IEEE Computer Society, Washington, DC, USA,
     42452013.
     4246doi:10.1109/icpp.2013.28.
     4247</li>
     4248<br>
     4249
     4250
     4251
     4252<li>
    40024253<b>Esposito, Flavio and Wang, Yuefeng and Matta, Ibrahim and Day, John</b>
    40034254, &quot;Dynamic Layer Instantiation as a Service.&quot
     
    40864337
    40874338<li>
     4339<b>Lauer, Gregory and Irwin, Ryan and Kappler, Chris and Nishioka, Itaru</b>
     4340, &quot;Distributed Resource Control Using Shadowed Subgraphs.&quot
     4341Proceedings of the Ninth ACM Conference on Emerging Networking Experiments and Technologies, Santa Barbara, California, USA, ACM, New York, NY, USA,
     43422013.
     4343doi:10.1145/2535372.2535410.
     4344</li>
     4345<br>
     4346
     4347
     4348
     4349<li>
    40884350<b>Lee, Ki S. and Wang, Han and Weatherspoon, Hakim</b>
    40894351, &quot;SoNIC: Precise Realtime Software Access and Control of Wired Networks.&quot
     
    40974359
    40984360<li>
     4361<b>Li, Ting and Van Vorst, Nathanael and Liu, Jason</b>
     4362, &quot;A Rate-based TCP Traffic Model to Accelerate Network Simulation.&quot
     4363Simulation, Society for Computer Simulation International, San Diego, CA, USA,
     43642013.
     4365doi:10.1177/0037549712469892.
     4366</li>
     4367<br>
     4368
     4369
     4370
     4371<li>
    40994372<b>Mandal, Anirban and Ruth, Paul and Baldin, Ilya and Xin, Yufeng and Castillo, Claris and Rynge, Mats and Deelman, Ewa</b>
    41004373, &quot;Evaluating I/O Aware Network Management for Scientific Workflows on Networked Clouds.&quot
     
    41054378<br>
    41064379
     4380<li>
     4381<b>Mandal, Anirban and Ruth, Paul and Baldin, Ilya and Xin, Yufeng and Castillo, Claris and Rynge, Mats and Deelman, Ewa</b>
     4382, &quot;Evaluating I/O Aware Network Management for Scientific Workflows on Networked Clouds.&quot
     4383Proceedings of the Third International Workshop on Network-Aware Data Management, Denver, Colorado, ACM, New York, NY, USA,
     43842013.
     4385doi:10.1145/2534695.2534698.
     4386</li>
     4387<br>
     4388
    41074389
    41084390
     
    43174599
    43184600<li>
     4601<b>Zhang, Yihua and Steele, Aaron and Blanton, Marina</b>
     4602, &quot;PICCO: A General-purpose Compiler for Private Distributed Computation.&quot
     4603Proceedings of the 2013 ACM SIGSAC Conference on Computer &#x0026;&#x0023;38; Communications Security, Berlin, Germany, ACM, New York, NY, USA,
     46042013.
     4605doi:10.1145/2508859.2516752.
     4606</li>
     4607<br>
     4608
     4609
     4610
     4611<li>
    43194612<b>Zhuang, Yanyan and Rafetseder, A. and Cappos, J.</b>
    43204613, &quot;Experience with Seattle: A Community Platform for Research and Education.&quot
     
    48035096
    48045097<li>
     5098<b>Naylor, David and Mukerjee, Matthew K. and Agyapong, Patrick and Grandl, Robert and Kang, Ruogu and Machado, Michel and Brown, Stephanie and Doucette, Cody and Hsiao, Hsu C. and Han, Dongsu and Kim, Tiffany H. and Lim, Hyeontaek and Ovon, Carol and Zhou, Dong and Lee, Soo B. and Lin, Yue H. and Stuart, Colleen and Barrett, Daniel and Akella, Aditya and Andersen, David and Byers, John and Dabbish, Laura and Kaminsky, Michael and Kiesler, Sara and Peha, Jon and Perrig, Adrian and Seshan, Srinivasan and Sirbu, Marvin and Steenkiste, Peter</b>
     5099, &quot;XIA: Architecting a More Trustworthy and Evolvable Internet.&quot
     5100SIGCOMM Comput. Commun. Rev., ACM, New York, NY, USA,
     51012014.
     5102doi:10.1145/2656877.2656885.
     5103</li>
     5104<br>
     5105
     5106
     5107
     5108<li>
    48055109<b>Nozaki, Yoshihiro and Bakshi, Parth and Tuncer, Hasan and Shenoy, Nirmala</b>
    48065110, &quot;Evaluation of tiered routing protocol in floating cloud tiered internet architecture.&quot
     
    48145118
    48155119<li>
     5120<b>Qiu, Chenxi and Shen, Haiying</b>
     5121, &quot;A Delaunay-Based Coordinate-Free Mechanism for Full Coverage in Wireless Sensor Networks.&quot
     5122Parallel and Distributed Systems, IEEE Transactions on, IEEE,
     51232014.
     5124doi:10.1109/tpds.2013.134.
     5125</li>
     5126<br>
     5127
     5128
     5129
     5130<li>
    48165131<b>Rakotoarivelo, Thierry and Jourjon, Guillaume and Mehani, Olivier and Ott, Maximilian and Zink, Mike</b>
    48175132, &quot;Repeatable Experiments with LabWiki.&quot
     
    50355350<li>
    50365351<b>Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</b>
     5352, &quot;Scaling up applications over distributed clouds with dynamic layer-2 exchange and broadcast service.&quot
     5353Teletraffic Congress (ITC), 2014 26th International, IEEE,
     53542014.
     5355doi:10.1109/itc.2014.6932973.
     5356</li>
     5357<br>
     5358
     5359<li>
     5360<b>Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</b>
    50375361, &quot;Capacity of Inter-cloud Layer-2 Virtual Networking.&quot
    50385362Proceedings of the 2014 ACM SIGCOMM Workshop on Distributed Cloud Computing, Chicago, Illinois, USA, ACM, New York, NY, USA,
    503953632014.
    50405364doi:10.1145/2627566.2627573.
    5041 </li>
    5042 <br>
    5043 
    5044 <li>
    5045 <b>Xin, Yufeng and Baldin, Ilya and Heermann, Chris and Mandal, Anirban and Ruth, Paul</b>
    5046 , &quot;Scaling up applications over distributed clouds with dynamic layer-2 exchange and broadcast service.&quot
    5047 Teletraffic Congress (ITC), 2014 26th International, IEEE,
    5048 2014.
    5049 doi:10.1109/itc.2014.6932973.
    50505365</li>
    50515366<br>
     
    51245439
    51255440<li>
     5441<b>Elliott, Steven D.</b>
     5442, &quot;Exploring the Challenges and Opportunities of Implementing Software-Defined Networking in a Research Testbed.&quot
     5443
     54442015.
     5445
     5446</li>
     5447<br>
     5448
     5449
     5450
     5451<li>
    51265452<b>Mukherjee, Shreyasee and Baid, Akash and Raychaudhuri, Dipankar</b>
    51275453, &quot;Integrating Advanced Mobility Services into the Future Internet Architecture.&quot