Changes between Version 15 and Version 16 of GENIBibliography

Timestamp:

07/22/14 14:59:58 (10 years ago)

Author:

Mark Berman

Comment:

--

GENIBibliography

@@ -409 +409 @@
 
 
+<a class="EntryGoto" id="Babaoglu, Ahmet C."></a>
+<b class="myheading" style="position: relative; left: 5%;">Babaoglu, Ahmet C.</b>
+
+<div class="BibEntry">
+
+<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
+
+<li>
+
+
+<tr>
+     <td valign="top">Author</td>
+     <td valign="top">Babaoglu, Ahmet C.</td>
+</tr>
+
+<tr>
+     <td valign="top">Title</td>
+     <td valign="top">Verification Services for the Choice-Based Internet of the Future</td>
+</tr>
+
+<tr>
+     <td valign="top">Year</td>
+     <td valign="top">2014</td>
+</tr>
+
+<tr>
+     <td valign="top">Abstract</td>
+     <td valign="top">The Internet has grown from its inception as a special-purpose internetwork into a general multi-purpose world-wide facility enabling education, commerce, governance, and societal communication, all in the space of a few decades. Over this time, and accelerating in the last decade or so, increasing demands and a growing variety of use cases are posing new challenges on the architecture prompting re-thinking and re-architecting of the network. One thread of research in such architectural considerations involves the issue of choice. The lack of alternative network services brings little economic incentive for the network service providers to make investments to deploy new technologies and improve the quality of their network services. In addition, most user flows goes through several providers, thus there is no effective mechanism in the current Internet to provide feedback to users about which provider is the cause of the performance problems they experience. One solution to these problems is to create a more competitive open market where providers can advertise their network services, and users can choose their desired set of network services to satisfy their needs. In this solution, the users have the option to choose another service if they are not satisfied. However, even in this solution, the root cause of the performance problems still can not be found and it brings us to the lack of a robust feedback capability. In this work, we investigate a solution to this fundamental missing piece of the In- ternet, the measurement and verification capability of the network services offered in the Internet, that indirectly pushes more responsibility to the network providers to fulfill their requirements for high quality services. Our work, while rooted in standard expectations of economic theory, is not in economics itself. Rather, it is in defining, designing, and realizing architectural entities and interactions in technical terms that can realize verification services essential to enabling such economic interactions. Our work is threefold; after giving a literature overview of the research on future Internet and Internet measurement, we first propose an architecture that defines the roles, interactions and design choices to enable a Choice-Based Verification Service. We then describe the results and analysis of a series of tests, which start with our work on measurement frameworks in wired and wireless environments and continue with the simulation, the mechanism introduced and the actual prototype of this work deployed into a real system, the GENI meso-scale testbed. Finally, we investigate and validate whether such informed choices with verification service actually lead to better overall results. We use energy-efficiency as a practical and useful domain for a case study and show the simulation results, which greatly increase the appeal of this work as applicable real-world network services.</td>
+</tr>
+
+
+
+
+
+<tr>
+     <td valign="top">URL</td>
+     <td valign="top"><a href="http://www.lib.ncsu.edu/resolver/1840.16/9336">http://www.lib.ncsu.edu/resolver/1840.16/9336</a></td>
+</tr>
+
+
+</li>
+
+</table></div><br><br>
+
+
+
+
 <a class="EntryGoto" id="Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Renci, Chris H. and Chase, Unc-Ch J. and Marupadi, Varun and Yumerefendi, Aydan and Irwin, David"></a>
 <b class="myheading" style="position: relative; left: 5%;">Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Renci, Chris H. and Chase, Unc-Ch J. and Marupadi, Varun and Yumerefendi, Aydan and Irwin, David</b>
@@ -3769 +3816 @@
 
 
+<div class="BibEntry">
+
+<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
+
+<li>
+
+
+<tr>
+     <td valign="top">Author</td>
+     <td valign="top">Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</td>
+</tr>
+
+<tr>
+     <td valign="top">Title</td>
+     <td valign="top">Network capabilities of cloud services for a real time scientific application</td>
+</tr>
+
+<tr>
+     <td valign="top">Booktitle</td>
+     <td valign="top">37th Annual IEEE Conference on Local Computer Networks</td>
+</tr>
+
+<tr>
+     <td valign="top">Location</td>
+     <td valign="top">Clearwater Beach, FL, USA</td>
+</tr>
+
+<tr>
+     <td valign="top">Publisher</td>
+     <td valign="top">IEEE</td>
+</tr>
+
+<tr>
+     <td valign="top">Year</td>
+     <td valign="top">2012</td>
+</tr>
+
+<tr>
+     <td valign="top">Abstract</td>
+     <td valign="top">Dedicating high-end servers for executing scientific applications that run intermittently, such as severe weather detection or generalized weather forecasting, wastes resources. While the Infrastructure-as-a-Service (IaaS) model used by today's cloud platforms is well-suited for the bursty computational demands of these applications, it is unclear if the network capabilities of today's cloud platforms are sufficient. In this paper, we analyze the networking capabilities of multiple commercial (Amazon's EC2 and Rackspace) and research (GENICloud and ExoGENI cloud) platforms in the context of a Nowcasting application, a forecasting algorithm for highly accurate, near-term, e.g., 5-20 minutes, weather predictions. The application has both computational and network requirements. While it executes rarely, whenever severe weather approaches, it benefits from an IaaS model; However, since its results are time-critical, enough bandwidth must be available to transmit radar data to cloud platforms before it becomes stale. We conduct network capacity measurements between radar sites and cloud platforms throughout the country. Our results indicate that ExoGENI cloud performs the best for both serial and parallel data transfer with an average throughput of 110.22 Mbps and 17.2 Mbps, respectively. We also found that the cloud services perform better in the distributed data transfer case, where a subset of nodes transmit data in parallel to a cloud instance. Ultimately, we conclude that commercial and research clouds are capable of providing sufficient bandwidth for our real-time Nowcasting application.</td>
+</tr>
+
+
+
+<tr>
+     <td valign="top">DOI</td>
+     <td valign="top">10.1109/lcn.2012.6423665</td>
+</tr>
+
+
+
+<tr>
+     <td valign="top">URL</td>
+     <td valign="top"><a href="http://dx.doi.org/10.1109/lcn.2012.6423665">http://dx.doi.org/10.1109/lcn.2012.6423665</a></td>
+</tr>
+
+
+</li>
+
+</table></div><br><br>
+
+
 
 
@@ -6136 +6245 @@
 
 
+<a class="EntryGoto" id="Sher-DeCusatis, Carolyn J. and DeCusatis, Casimer"></a>
+<b class="myheading" style="position: relative; left: 5%;">Sher-DeCusatis, Carolyn J. and DeCusatis, Casimer</b>
+
+<div class="BibEntry">
+
+<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
+
+<li>
+
+
+<tr>
+     <td valign="top">Author</td>
+     <td valign="top">Sher-DeCusatis, Carolyn J. and DeCusatis, Casimer</td>
+</tr>
+
+<tr>
+     <td valign="top">Title</td>
+     <td valign="top">Developing a Software Defined Networking curriculum through industry partnerships</td>
+</tr>
+
+<tr>
+     <td valign="top">Booktitle</td>
+     <td valign="top">American Society for Engineering Education (ASEE Zone 1), 2014 Zone 1 Conference of the</td>
+</tr>
+
+<tr>
+     <td valign="top">Year</td>
+     <td valign="top">2014</td>
+</tr>
+
+
+
+<tr>
+     <td valign="top">DOI</td>
+     <td valign="top">10.1109/ASEEZone1.2014.6820653</td>
+</tr>
+
+
+
+<tr>
+     <td valign="top">URL</td>
+     <td valign="top"><a href="http://dx.doi.org/10.1109/ASEEZone1.2014.6820653">http://dx.doi.org/10.1109/ASEEZone1.2014.6820653</a></td>
+</tr>
+
+
+</li>
+
+</table></div><br><br>
+
+
+
+
 <a class="EntryGoto" id="Shin, Sunae and Dhondge, Kaustubh and Choi, Baek-Young"></a>
 <b class="myheading" style="position: relative; left: 5%;">Shin, Sunae and Dhondge, Kaustubh and Choi, Baek-Young</b>
@@ -8204 +8365 @@
 
 
+<a class="EntryGoto" id="Yi, Ping"></a>
+<b class="myheading" style="position: relative; left: 5%;">Yi, Ping</b>
+
+<div class="BibEntry">
+
+<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
+
+<li>
+
+
+<tr>
+     <td valign="top">Author</td>
+     <td valign="top">Yi, Ping</td>
+</tr>
+
+<tr>
+     <td valign="top">Title</td>
+     <td valign="top">Peer-to-Peer based Trading and File Distribution for Cloud Computing</td>
+</tr>
+
+<tr>
+     <td valign="top">Address</td>
+     <td valign="top">Lexington, Kentucky</td>
+</tr>
+
+<tr>
+     <td valign="top">Year</td>
+     <td valign="top">2014</td>
+</tr>
+
+<tr>
+     <td valign="top">Abstract</td>
+     <td valign="top">In this dissertation we take a peer-to-peer approach to deal with two specific issues, fair trading and file distribution, arisen from data management for cloud computing. In mobile cloud computing environment cloud providers may collaborate with each other and essentially organize some dedicated resources as a peer to peer sharing system. One well-known problem in such peer to peer systems with exchange of resources is free riding. Providing incentives for peers to contribute to the system is an important issue in peer to peer systems. We design a reputation-based fair trading mechanism that favors peers with higher reputation. Based on the definition of the reputation used in the system, we derive a fair trading policy. We evaluate the performance of reputation-based trading mechanisms and highlight the scenarios in which they can make a difference. Distribution of data to the resources within a cloud or to different collaborating clouds efficiently is another issue in cloud computing. The delivery efficiency is de- pendent on the characteristics of the network links available among these network nodes and the mechanism that takes advantage of them. Our study is based on the Global Environment for Network Innovations (GENI), a testbed for researchers to build a virtual laboratory at scale to explore future Internets. Our study consists of two parts. First, we characterize the links in the GENI network. Even though GENI has been used in many research and education projects, there is no systematic study about what we can expect from the GENI testbeds from a performance perspective. The goal is to characterize the links of the GENI networks and provide guidance for GENI experiments. Second, we propose a peer to peer approach to file distribution for cloud comput- ing. We develop a mechanism that uses multiple delivery trees as the distribution structure, which takes into consideration the measured performance information in the GENI network. Files are divided into chunks to improve parallelism among differ- ent delivery trees. With a strict scheduling mechanism for each chunk, we can reduce the overall time for getting the file to all relevant nodes. We evaluate the proposed mechanism and show that our mechanism can significantly reduce the overall delivery time.</td>
+</tr>
+
+
+
+
+
+<tr>
+     <td valign="top">URL</td>
+     <td valign="top"><a href="http://uknowledge.uky.edu/cs&#x005F;etds/22/">http://uknowledge.uky.edu/cs&#x005F;etds/22/</a></td>
+</tr>
+
+
+</li>
+
+</table></div><br><br>
+
+
+
+
 <a class="EntryGoto" id="Yu, Xinxin and Li, Min and Liu, Kaikai and Li, Xiaolin"></a>
 <b class="myheading" style="position: relative; left: 5%;">Yu, Xinxin and Li, Min and Liu, Kaikai and Li, Xiaolin</b>