Changes between Version 2 and Version 3 of GENIBibliography


Ignore:
Timestamp:
10/02/12 15:45:34 (12 years ago)
Author:
Mark Berman
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • GENIBibliography

    v2 v3  
    2525
    2626<a class="EntryGoto" id="Aikat, Jay and Hasan, Shaddi and Jeffay, Kevin and Smith, F. Donelson"></a>
    27 <b class="myheading" style="position: relative; left: 10%;">Aikat, Jay and Hasan, Shaddi and Jeffay, Kevin and Smith, F. Donelson</b>
    28 
    29 <div class="BibEntry">
    30 
    31 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    32 
    33 
    34 <tr>
    35      <td>Author</td>
    36      <td>Aikat, Jay and Hasan, Shaddi and Jeffay, Kevin and Smith, F. Donelson</td>
    37 </tr>
    38 
    39 <tr>
    40      <td>Title</td>
    41      <td>Discrete-Approximation of Measured Round Trip Time Distributions: A Model for Network Emulation</td>
    42 </tr>
    43 
    44 <tr>
    45      <td>Booktitle</td>
    46      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    47 </tr>
    48 
    49 <tr>
    50      <td>Location</td>
    51      <td>Los Angeles</td>
    52 </tr>
    53 
    54 <tr>
    55      <td>Year</td>
    56      <td>2012</td>
    57 </tr>
    58 
    59 <tr>
    60      <td>Abstract</td>
    61      <td>Empirical evaluations to study network performance, whether in a laboratory setting or on GENI testbeds, rely heavily on measurement-based modeling of round trip times (RTTs) to emulate realistic end-to-end delays of local and metropolitan area networks. For generating realistic traffic, we studied several models to emulate RTTs. In this paper, we performed experiments on real testbeds using synthetic TCP traffic generated from measurement data from a large university campus. As a result of our study, we present the Discrete- Approximation model for RTT (DA-RTT) emulation. Using three different metrics for performance evaluation, which include queue length at routers, connection response times, and connection durations, we demonstrate that the simple DA-RTT model closely represents the per-connection RTTs in the original traffic. While these experiments were performed in our laboratory, and not using GENI infrastructure, we present this as a possible model for adoption on GENI testbeds to emulate Round Trip Time Distributions for GENI experiments.</td>
     27<b class="myheading" style="position: relative; left: 5%;">Aikat, Jay and Hasan, Shaddi and Jeffay, Kevin and Smith, F. Donelson</b>
     28
     29<div class="BibEntry">
     30
     31<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     32
     33
     34<tr>
     35     <td valign="top">Author</td>
     36     <td valign="top">Aikat, Jay and Hasan, Shaddi and Jeffay, Kevin and Smith, F. Donelson</td>
     37</tr>
     38
     39<tr>
     40     <td valign="top">Title</td>
     41     <td valign="top">Discrete-Approximation of Measured Round Trip Time Distributions: A Model for Network Emulation</td>
     42</tr>
     43
     44<tr>
     45     <td valign="top">Booktitle</td>
     46     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     47</tr>
     48
     49<tr>
     50     <td valign="top">Location</td>
     51     <td valign="top">Los Angeles</td>
     52</tr>
     53
     54<tr>
     55     <td valign="top">Year</td>
     56     <td valign="top">2012</td>
     57</tr>
     58
     59<tr>
     60     <td valign="top">Abstract</td>
     61     <td valign="top">Empirical evaluations to study network performance, whether in a laboratory setting or on GENI testbeds, rely heavily on measurement-based modeling of round trip times (RTTs) to emulate realistic end-to-end delays of local and metropolitan area networks. For generating realistic traffic, we studied several models to emulate RTTs. In this paper, we performed experiments on real testbeds using synthetic TCP traffic generated from measurement data from a large university campus. As a result of our study, we present the Discrete- Approximation model for RTT (DA-RTT) emulation. Using three different metrics for performance evaluation, which include queue length at routers, connection response times, and connection durations, we demonstrate that the simple DA-RTT model closely represents the per-connection RTTs in the original traffic. While these experiments were performed in our laboratory, and not using GENI infrastructure, we present this as a possible model for adoption on GENI testbeds to emulate Round Trip Time Distributions for GENI experiments.</td>
    6262</tr>
    6363
    … …  
    7373
    7474<a class="EntryGoto" id="Albrecht, J. and Huang, D. Y."></a>
    75 <b class="myheading" style="position: relative; left: 10%;">Albrecht, J. and Huang, D. Y.</b>
    76 
    77 <div class="BibEntry">
    78 
    79 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    80 
    81 
    82 <tr>
    83      <td>Author</td>
    84      <td>Albrecht, J. and Huang, D. Y.</td>
    85 </tr>
    86 
    87 <tr>
    88      <td>Title</td>
    89      <td>Managing distributed applications using Gush</td>
    90 </tr>
    91 
    92 <tr>
    93      <td>Journal</td>
    94      <td>Proceedings of the ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, Testbed Practices Session (TridentCom)</td>
    95 </tr>
    96 
    97 <tr>
    98      <td>Year</td>
    99      <td>2010</td>
    100 </tr>
    101 
    102 <tr>
    103      <td>Abstract</td>
    104      <td>Deploying and controlling experiments running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the complexities associated with resource configuration and management in these environments. Experiment control systems are designed to automate the process, and to ultimately help developers cope with the common problems that arise during the design, implementation, and evaluation of distributed systems. However, many of the existing control systems were designed with specific computing environments in mind, and thus do not provide support for heterogeneous resources in different testbeds. In this paper, we explore the functionality of Gush, an experiment control system, and discuss how it supports execution on three of the four GENI control frameworks.</td>
    105 </tr>
    106 
    107 
    108 
    109 <tr>
    110      <td>DOI</td>
    111      <td>10.1007/978-3-642-17851-1&#x005F;31</td>
    112 </tr>
    113 
    114 
    115 
    116 <tr>
    117      <td>URL</td>
    118      <td><a href="http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;31">http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;31</a></td>
     75<b class="myheading" style="position: relative; left: 5%;">Albrecht, J. and Huang, D. Y.</b>
     76
     77<div class="BibEntry">
     78
     79<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     80
     81
     82<tr>
     83     <td valign="top">Author</td>
     84     <td valign="top">Albrecht, J. and Huang, D. Y.</td>
     85</tr>
     86
     87<tr>
     88     <td valign="top">Title</td>
     89     <td valign="top">Managing distributed applications using Gush</td>
     90</tr>
     91
     92<tr>
     93     <td valign="top">Journal</td>
     94     <td valign="top">Proceedings of the ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities, Testbed Practices Session (TridentCom)</td>
     95</tr>
     96
     97<tr>
     98     <td valign="top">Year</td>
     99     <td valign="top">2010</td>
     100</tr>
     101
     102<tr>
     103     <td valign="top">Abstract</td>
     104     <td valign="top">Deploying and controlling experiments running on a distributed set of resources is a challenging task. Software developers often spend a significant amount of time dealing with the complexities associated with resource configuration and management in these environments. Experiment control systems are designed to automate the process, and to ultimately help developers cope with the common problems that arise during the design, implementation, and evaluation of distributed systems. However, many of the existing control systems were designed with specific computing environments in mind, and thus do not provide support for heterogeneous resources in different testbeds. In this paper, we explore the functionality of Gush, an experiment control system, and discuss how it supports execution on three of the four GENI control frameworks.</td>
     105</tr>
     106
     107
     108
     109<tr>
     110     <td valign="top">DOI</td>
     111     <td valign="top">10.1007/978-3-642-17851-1&#x005F;31</td>
     112</tr>
     113
     114
     115
     116<tr>
     117     <td valign="top">URL</td>
     118     <td valign="top"><a href="http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;31">http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;31</a></td>
    119119</tr>
    120120
    … …  
    126126
    127127<a class="EntryGoto" id="Albrecht, Jeannie R."></a>
    128 <b class="myheading" style="position: relative; left: 10%;">Albrecht, Jeannie R.</b>
    129 
    130 <div class="BibEntry">
    131 
    132 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    133 
    134 
    135 <tr>
    136      <td>Author</td>
    137      <td>Albrecht, Jeannie R.</td>
    138 </tr>
    139 
    140 <tr>
    141      <td>Title</td>
    142      <td>Bringing big systems to small schools: distributed systems for undergraduates</td>
    143 </tr>
    144 
    145 <tr>
    146      <td>Journal</td>
    147      <td>SIGCSE Bull.</td>
    148 </tr>
    149 
    150 <tr>
    151      <td>Publisher</td>
    152      <td>ACM</td>
    153 </tr>
    154 
    155 <tr>
    156      <td>Address</td>
    157      <td>New York, NY, USA</td>
    158 </tr>
    159 
    160 <tr>
    161      <td>Year</td>
    162      <td>2009</td>
    163 </tr>
    164 
    165 <tr>
    166      <td>Abstract</td>
    167      <td>Distributed applications have become a core component of the Internet's infrastructure. However, many undergraduate curriculums, especially at small colleges, do not offer courses that focus on the design and implementation of distributed systems. The courses that are offered address the theoretical aspects of system design, but often fail to provide students with the opportunity to develop and evaluate distributed applications in real-world environments. As a result, undergraduate students are not as prepared as they should be for graduate study or careers in industry. This paper describes an undergraduate course in Distributed Systems that not only studies the key design principles of distributed systems, but also has a unique emphasis on giving students hands-on access to distributed systems through the use of shared computing testbeds, such as PlanetLab and GENI, and open-source technologies, such as Xen and Hadoop. Using these platforms, students can perform large-scale, distributed experimentation even at small colleges.</td>
    168 </tr>
    169 
    170 
    171 
    172 <tr>
    173      <td>DOI</td>
    174      <td>10.1145/1539024.1508903</td>
    175 </tr>
    176 
    177 
    178 
    179 <tr>
    180      <td>URL</td>
    181      <td><a href="http://dx.doi.org/10.1145/1539024.1508903">http://dx.doi.org/10.1145/1539024.1508903</a></td>
     128<b class="myheading" style="position: relative; left: 5%;">Albrecht, Jeannie R.</b>
     129
     130<div class="BibEntry">
     131
     132<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     133
     134
     135<tr>
     136     <td valign="top">Author</td>
     137     <td valign="top">Albrecht, Jeannie R.</td>
     138</tr>
     139
     140<tr>
     141     <td valign="top">Title</td>
     142     <td valign="top">Bringing big systems to small schools: distributed systems for undergraduates</td>
     143</tr>
     144
     145<tr>
     146     <td valign="top">Journal</td>
     147     <td valign="top">SIGCSE Bull.</td>
     148</tr>
     149
     150<tr>
     151     <td valign="top">Publisher</td>
     152     <td valign="top">ACM</td>
     153</tr>
     154
     155<tr>
     156     <td valign="top">Address</td>
     157     <td valign="top">New York, NY, USA</td>
     158</tr>
     159
     160<tr>
     161     <td valign="top">Year</td>
     162     <td valign="top">2009</td>
     163</tr>
     164
     165<tr>
     166     <td valign="top">Abstract</td>
     167     <td valign="top">Distributed applications have become a core component of the Internet's infrastructure. However, many undergraduate curriculums, especially at small colleges, do not offer courses that focus on the design and implementation of distributed systems. The courses that are offered address the theoretical aspects of system design, but often fail to provide students with the opportunity to develop and evaluate distributed applications in real-world environments. As a result, undergraduate students are not as prepared as they should be for graduate study or careers in industry. This paper describes an undergraduate course in Distributed Systems that not only studies the key design principles of distributed systems, but also has a unique emphasis on giving students hands-on access to distributed systems through the use of shared computing testbeds, such as PlanetLab and GENI, and open-source technologies, such as Xen and Hadoop. Using these platforms, students can perform large-scale, distributed experimentation even at small colleges.</td>
     168</tr>
     169
     170
     171
     172<tr>
     173     <td valign="top">DOI</td>
     174     <td valign="top">10.1145/1539024.1508903</td>
     175</tr>
     176
     177
     178
     179<tr>
     180     <td valign="top">URL</td>
     181     <td valign="top"><a href="http://dx.doi.org/10.1145/1539024.1508903">http://dx.doi.org/10.1145/1539024.1508903</a></td>
    182182</tr>
    183183
    … …  
    189189
    190190<a class="EntryGoto" id="Albrecht, Jeannie and Tuttle, Christopher and Braud, Ryan and Dao, Darren and Topilski, Nikolay and Snoeren, Alex C. and Vahdat, Amin"></a>
    191 <b class="myheading" style="position: relative; left: 10%;">Albrecht, Jeannie and Tuttle, Christopher and Braud, Ryan and Dao, Darren and Topilski, Nikolay and Snoeren, Alex C. and Vahdat, Amin</b>
    192 
    193 <div class="BibEntry">
    194 
    195 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    196 
    197 
    198 <tr>
    199      <td>Author</td>
    200      <td>Albrecht, Jeannie and Tuttle, Christopher and Braud, Ryan and Dao, Darren and Topilski, Nikolay and Snoeren, Alex C. and Vahdat, Amin</td>
    201 </tr>
    202 
    203 <tr>
    204      <td>Title</td>
    205      <td>Distributed application configuration, management, and visualization with plush</td>
    206 </tr>
    207 
    208 <tr>
    209      <td>Journal</td>
    210      <td>ACM Trans. Internet Technol.</td>
    211 </tr>
    212 
    213 <tr>
    214      <td>Publisher</td>
    215      <td>ACM</td>
    216 </tr>
    217 
    218 <tr>
    219      <td>Address</td>
    220      <td>New York, NY, USA</td>
    221 </tr>
    222 
    223 <tr>
    224      <td>Year</td>
    225      <td>2011</td>
    226 </tr>
    227 
    228 <tr>
    229      <td>Abstract</td>
    230      <td>Support for distributed application management in large-scale networked environments remains in its early stages. Although a number of solutions exist for subtasks of application deployment, monitoring, and maintenance in distributed environments, few tools provide a unified framework for application management. Many of the existing tools address the management needs of a single type of application or service that runs in a specific environment, and these tools are not adaptable enough to be used for other applications or platforms. To this end, we present the design and implementation of Plush, a fully configurable application management infrastructure designed to meet the general requirements of several different classes of distributed applications. Plush allows developers to specifically define the flow of control needed by their computations using application building blocks. Through an extensible resource management interface, Plush supports execution in a variety of environments, including both live deployment platforms and emulated clusters. Plush also uses relaxed synchronization primitives for improving fault tolerance and liveness in failure-prone environments. To gain an understanding of how Plush manages different classes of distributed applications, we take a closer look at specific applications and evaluate how Plush provides support for each.</td>
    231 </tr>
    232 
    233 
    234 
    235 <tr>
    236      <td>DOI</td>
    237      <td>10.1145/2049656.2049658</td>
    238 </tr>
    239 
    240 
    241 
    242 <tr>
    243      <td>URL</td>
    244      <td><a href="http://dx.doi.org/10.1145/2049656.2049658">http://dx.doi.org/10.1145/2049656.2049658</a></td>
     191<b class="myheading" style="position: relative; left: 5%;">Albrecht, Jeannie and Tuttle, Christopher and Braud, Ryan and Dao, Darren and Topilski, Nikolay and Snoeren, Alex C. and Vahdat, Amin</b>
     192
     193<div class="BibEntry">
     194
     195<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     196
     197
     198<tr>
     199     <td valign="top">Author</td>
     200     <td valign="top">Albrecht, Jeannie and Tuttle, Christopher and Braud, Ryan and Dao, Darren and Topilski, Nikolay and Snoeren, Alex C. and Vahdat, Amin</td>
     201</tr>
     202
     203<tr>
     204     <td valign="top">Title</td>
     205     <td valign="top">Distributed application configuration, management, and visualization with plush</td>
     206</tr>
     207
     208<tr>
     209     <td valign="top">Journal</td>
     210     <td valign="top">ACM Trans. Internet Technol.</td>
     211</tr>
     212
     213<tr>
     214     <td valign="top">Publisher</td>
     215     <td valign="top">ACM</td>
     216</tr>
     217
     218<tr>
     219     <td valign="top">Address</td>
     220     <td valign="top">New York, NY, USA</td>
     221</tr>
     222
     223<tr>
     224     <td valign="top">Year</td>
     225     <td valign="top">2011</td>
     226</tr>
     227
     228<tr>
     229     <td valign="top">Abstract</td>
     230     <td valign="top">Support for distributed application management in large-scale networked environments remains in its early stages. Although a number of solutions exist for subtasks of application deployment, monitoring, and maintenance in distributed environments, few tools provide a unified framework for application management. Many of the existing tools address the management needs of a single type of application or service that runs in a specific environment, and these tools are not adaptable enough to be used for other applications or platforms. To this end, we present the design and implementation of Plush, a fully configurable application management infrastructure designed to meet the general requirements of several different classes of distributed applications. Plush allows developers to specifically define the flow of control needed by their computations using application building blocks. Through an extensible resource management interface, Plush supports execution in a variety of environments, including both live deployment platforms and emulated clusters. Plush also uses relaxed synchronization primitives for improving fault tolerance and liveness in failure-prone environments. To gain an understanding of how Plush manages different classes of distributed applications, we take a closer look at specific applications and evaluate how Plush provides support for each.</td>
     231</tr>
     232
     233
     234
     235<tr>
     236     <td valign="top">DOI</td>
     237     <td valign="top">10.1145/2049656.2049658</td>
     238</tr>
     239
     240
     241
     242<tr>
     243     <td valign="top">URL</td>
     244     <td valign="top"><a href="http://dx.doi.org/10.1145/2049656.2049658">http://dx.doi.org/10.1145/2049656.2049658</a></td>
    245245</tr>
    246246
    … …  
    252252
    253253<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>
    254 <b class="myheading" style="position: relative; left: 10%;">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>
    255 
    256 <div class="BibEntry">
    257 
    258 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    259 
    260 
    261 <tr>
    262      <td>Author</td>
    263      <td>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</td>
    264 </tr>
    265 
    266 <tr>
    267      <td>Title</td>
    268      <td>Networked cloud orchestration: A GENI perspective</td>
    269 </tr>
    270 
    271 <tr>
    272      <td>Booktitle</td>
    273      <td>2010 IEEE Globecom Workshops</td>
    274 </tr>
    275 
    276 <tr>
    277      <td>Location</td>
    278      <td>Miami, FL, USA</td>
    279 </tr>
    280 
    281 <tr>
    282      <td>Publisher</td>
    283      <td>IEEE</td>
    284 </tr>
    285 
    286 <tr>
    287      <td>Year</td>
    288      <td>2010</td>
    289 </tr>
    290 
    291 <tr>
    292      <td>Abstract</td>
    293      <td>This paper describes the experience of developing a system for creation of distributed linked configurations of heterogeneous resources (slices) in GENI. Our work leverages a number of unique architectural solutions (distributed architecture, declarative resource specifications, unique approach to slice instantiation) which is applicable to a wider set of problems related to autonomic co-scheduling and provisioning of heterogeneous networked resources. We discuss the architecture, the resource description mechanisms and some of the algorithms used to enable our system. We conclude with an analysis of a real experiment at allocating resources from multiple providers across a very wide geographic area (spanning Massachusetts, Illinois and North Carolina) to create a single private Layer 2 network connecting virtual machines on the campus of Duke University to a sensor testbed at University of Massachusetts, Amherst.</td>
    294 </tr>
    295 
    296 
    297 
    298 <tr>
    299      <td>DOI</td>
    300      <td>10.1109/GLOCOMW.2010.5700385</td>
    301 </tr>
    302 
    303 
    304 
    305 <tr>
    306      <td>URL</td>
    307      <td><a href="http://dx.doi.org/10.1109/GLOCOMW.2010.5700385">http://dx.doi.org/10.1109/GLOCOMW.2010.5700385</a></td>
     254<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>
     255
     256<div class="BibEntry">
     257
     258<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     259
     260
     261<tr>
     262     <td valign="top">Author</td>
     263     <td valign="top">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</td>
     264</tr>
     265
     266<tr>
     267     <td valign="top">Title</td>
     268     <td valign="top">Networked cloud orchestration: A GENI perspective</td>
     269</tr>
     270
     271<tr>
     272     <td valign="top">Booktitle</td>
     273     <td valign="top">2010 IEEE Globecom Workshops</td>
     274</tr>
     275
     276<tr>
     277     <td valign="top">Location</td>
     278     <td valign="top">Miami, FL, USA</td>
     279</tr>
     280
     281<tr>
     282     <td valign="top">Publisher</td>
     283     <td valign="top">IEEE</td>
     284</tr>
     285
     286<tr>
     287     <td valign="top">Year</td>
     288     <td valign="top">2010</td>
     289</tr>
     290
     291<tr>
     292     <td valign="top">Abstract</td>
     293     <td valign="top">This paper describes the experience of developing a system for creation of distributed linked configurations of heterogeneous resources (slices) in GENI. Our work leverages a number of unique architectural solutions (distributed architecture, declarative resource specifications, unique approach to slice instantiation) which is applicable to a wider set of problems related to autonomic co-scheduling and provisioning of heterogeneous networked resources. We discuss the architecture, the resource description mechanisms and some of the algorithms used to enable our system. We conclude with an analysis of a real experiment at allocating resources from multiple providers across a very wide geographic area (spanning Massachusetts, Illinois and North Carolina) to create a single private Layer 2 network connecting virtual machines on the campus of Duke University to a sensor testbed at University of Massachusetts, Amherst.</td>
     294</tr>
     295
     296
     297
     298<tr>
     299     <td valign="top">DOI</td>
     300     <td valign="top">10.1109/GLOCOMW.2010.5700385</td>
     301</tr>
     302
     303
     304
     305<tr>
     306     <td valign="top">URL</td>
     307     <td valign="top"><a href="http://dx.doi.org/10.1109/GLOCOMW.2010.5700385">http://dx.doi.org/10.1109/GLOCOMW.2010.5700385</a></td>
    308308</tr>
    309309
    … …  
    315315
    316316<a class="EntryGoto" id="Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Ruth, Paul and Yumerefendi, Aydan and Chase, Jeff"></a>
    317 <b class="myheading" style="position: relative; left: 10%;">Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Ruth, Paul and Yumerefendi, Aydan and Chase, Jeff</b>
    318 
    319 <div class="BibEntry">
    320 
    321 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    322 
    323 
    324 <tr>
    325      <td>Author</td>
    326      <td>Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Ruth, Paul and Yumerefendi, Aydan and Chase, Jeff</td>
    327 </tr>
    328 
    329 <tr>
    330      <td>Title</td>
    331      <td>ExoGENI: A Multi-Domain Infrastructure-as-a-Service Testbed</td>
    332 </tr>
    333 
    334 <tr>
    335      <td>Booktitle</td>
    336      <td>8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM 2012)</td>
    337 </tr>
    338 
    339 <tr>
    340      <td>Year</td>
    341      <td>2012</td>
    342 </tr>
    343 
    344 <tr>
    345      <td>Abstract</td>
    346      <td>NSF's GENI program seeks to enable experiments that run within virtual network topologies built-to-order from testbed infrastructure offered by multiple providers (domains). GENI is often viewed as a network testbed integration effort, but behind it is an ambitious vision for multi-domain infrastructure-as-a-service (IaaS). This paper presents ExoGENI, a new GENI testbed that links GENI to two advances in virtual infrastructure services outside of GENI: open cloud computing (OpenStack) and dynamic circuit fabrics. ExoGENI orchestrates a federation of independent cloud sites and circuit providers through their native IaaS interfaces, and links them to other GENI tools and resources. The ExoGENI deployment consists of cloud site ``racks'' on host campuses within the US, linked with national research networks and other circuit networks through programmable exchange points. The ExoGENI sites and control software are enabled for software-defined networking using OpenFlow. ExoGENI offers a powerful unified hosting platform for deeply networked, multi-domain, multi-site cloud applications. We intend that ExoGENI will seed a larger, evolving platform linking other third-party cloud sites, transport networks, and other infrastructure services, and that it will enable real-world deployment of innovative distributed services and new visions of a Future Internet.</td>
     317<b class="myheading" style="position: relative; left: 5%;">Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Ruth, Paul and Yumerefendi, Aydan and Chase, Jeff</b>
     318
     319<div class="BibEntry">
     320
     321<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     322
     323
     324<tr>
     325     <td valign="top">Author</td>
     326     <td valign="top">Baldine, Ilia and Xin, Yufeng and Mandal, Anirban and Ruth, Paul and Yumerefendi, Aydan and Chase, Jeff</td>
     327</tr>
     328
     329<tr>
     330     <td valign="top">Title</td>
     331     <td valign="top">ExoGENI: A Multi-Domain Infrastructure-as-a-Service Testbed</td>
     332</tr>
     333
     334<tr>
     335     <td valign="top">Booktitle</td>
     336     <td valign="top">8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM 2012)</td>
     337</tr>
     338
     339<tr>
     340     <td valign="top">Year</td>
     341     <td valign="top">2012</td>
     342</tr>
     343
     344<tr>
     345     <td valign="top">Abstract</td>
     346     <td valign="top">NSF's GENI program seeks to enable experiments that run within virtual network topologies built-to-order from testbed infrastructure offered by multiple providers (domains). GENI is often viewed as a network testbed integration effort, but behind it is an ambitious vision for multi-domain infrastructure-as-a-service (IaaS). This paper presents ExoGENI, a new GENI testbed that links GENI to two advances in virtual infrastructure services outside of GENI: open cloud computing (OpenStack) and dynamic circuit fabrics. ExoGENI orchestrates a federation of independent cloud sites and circuit providers through their native IaaS interfaces, and links them to other GENI tools and resources. The ExoGENI deployment consists of cloud site ``racks'' on host campuses within the US, linked with national research networks and other circuit networks through programmable exchange points. The ExoGENI sites and control software are enabled for software-defined networking using OpenFlow. ExoGENI offers a powerful unified hosting platform for deeply networked, multi-domain, multi-site cloud applications. We intend that ExoGENI will seed a larger, evolving platform linking other third-party cloud sites, transport networks, and other infrastructure services, and that it will enable real-world deployment of innovative distributed services and new visions of a Future Internet.</td>
    347347</tr>
    348348
    … …  
    358358
    359359<a class="EntryGoto" id="Bhanage, G. and Daya, R. and Seskar, I. and Raychaudhuri, D."></a>
    360 <b class="myheading" style="position: relative; left: 10%;">Bhanage, G. and Daya, R. and Seskar, I. and Raychaudhuri, D.</b>
    361 
    362 <div class="BibEntry">
    363 
    364 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    365 
    366 
    367 <tr>
    368      <td>Author</td>
    369      <td>Bhanage, G. and Daya, R. and Seskar, I. and Raychaudhuri, D.</td>
    370 </tr>
    371 
    372 <tr>
    373      <td>Title</td>
    374      <td>VNTS: A Virtual Network Traffic Shaper for Air Time Fairness in 802.16e Systems</td>
    375 </tr>
    376 
    377 <tr>
    378      <td>Booktitle</td>
    379      <td>Communications (ICC), 2010 IEEE International Conference on</td>
    380 </tr>
    381 
    382 <tr>
    383      <td>Publisher</td>
    384      <td>IEEE</td>
    385 </tr>
    386 
    387 <tr>
    388      <td>Year</td>
    389      <td>2010</td>
    390 </tr>
    391 
    392 <tr>
    393      <td>Abstract</td>
    394      <td>The 802.16e standard for broadband wireless access mandates the presence of QoS classes, but does not specify guidelines for the scheduler implementation or mechanisms to ensure air time fairness. Our study demonstrates the feasibility of controlling downlink airtime fairness for slices while running above a proprietary WiMAX basestation (BS) scheduler. We design and implement a virtualized infrastructure that allows users to obtain at least an allocated percentage of BS resources in the presence of saturation and link degradation. Using Kernel virtual machines for creating slices and Click modular router for implementing the virtual network traffic shaping engine we show that it is possible to adaptively control slice usage for downlink traffic on a WiMAX Basestation. The fairness index and coupling coefficient show an improvement of up to 42&#x0025;, and 73&#x0025; with preliminary indoor walking mobility experiments. Outdoor vehicular measurements show an improvement of up to 27&#x0025;, and 70\\\\\\\\ with the fairness index and coupling coefficient respectively</td>
    395 </tr>
    396 
    397 
    398 
    399 <tr>
    400      <td>DOI</td>
    401      <td>10.1109/ICC.2010.5502484</td>
    402 </tr>
    403 
    404 
    405 
    406 <tr>
    407      <td>URL</td>
    408      <td><a href="http://dx.doi.org/10.1109/ICC.2010.5502484">http://dx.doi.org/10.1109/ICC.2010.5502484</a></td>
     360<b class="myheading" style="position: relative; left: 5%;">Bhanage, G. and Daya, R. and Seskar, I. and Raychaudhuri, D.</b>
     361
     362<div class="BibEntry">
     363
     364<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     365
     366
     367<tr>
     368     <td valign="top">Author</td>
     369     <td valign="top">Bhanage, G. and Daya, R. and Seskar, I. and Raychaudhuri, D.</td>
     370</tr>
     371
     372<tr>
     373     <td valign="top">Title</td>
     374     <td valign="top">VNTS: A Virtual Network Traffic Shaper for Air Time Fairness in 802.16e Systems</td>
     375</tr>
     376
     377<tr>
     378     <td valign="top">Booktitle</td>
     379     <td valign="top">Communications (ICC), 2010 IEEE International Conference on</td>
     380</tr>
     381
     382<tr>
     383     <td valign="top">Publisher</td>
     384     <td valign="top">IEEE</td>
     385</tr>
     386
     387<tr>
     388     <td valign="top">Year</td>
     389     <td valign="top">2010</td>
     390</tr>
     391
     392<tr>
     393     <td valign="top">Abstract</td>
     394     <td valign="top">The 802.16e standard for broadband wireless access mandates the presence of QoS classes, but does not specify guidelines for the scheduler implementation or mechanisms to ensure air time fairness. Our study demonstrates the feasibility of controlling downlink airtime fairness for slices while running above a proprietary WiMAX basestation (BS) scheduler. We design and implement a virtualized infrastructure that allows users to obtain at least an allocated percentage of BS resources in the presence of saturation and link degradation. Using Kernel virtual machines for creating slices and Click modular router for implementing the virtual network traffic shaping engine we show that it is possible to adaptively control slice usage for downlink traffic on a WiMAX Basestation. The fairness index and coupling coefficient show an improvement of up to 42&#x0025;, and 73&#x0025; with preliminary indoor walking mobility experiments. Outdoor vehicular measurements show an improvement of up to 27&#x0025;, and 70\\\\ with the fairness index and coupling coefficient respectively</td>
     395</tr>
     396
     397
     398
     399<tr>
     400     <td valign="top">DOI</td>
     401     <td valign="top">10.1109/ICC.2010.5502484</td>
     402</tr>
     403
     404
     405
     406<tr>
     407     <td valign="top">URL</td>
     408     <td valign="top"><a href="http://dx.doi.org/10.1109/ICC.2010.5502484">http://dx.doi.org/10.1109/ICC.2010.5502484</a></td>
    409409</tr>
    410410
    … …  
    416416
    417417<a class="EntryGoto" id="Bhanage, G. and Seskar, I. and Zhang, Y. and Raychaudhuri, D. and Jain, S."></a>
    418 <b class="myheading" style="position: relative; left: 10%;">Bhanage, G. and Seskar, I. and Zhang, Y. and Raychaudhuri, D. and Jain, S.</b>
    419 
    420 <div class="BibEntry">
    421 
    422 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    423 
    424 
    425 <tr>
    426      <td>Author</td>
    427      <td>Bhanage, G. and Seskar, I. and Zhang, Y. and Raychaudhuri, D. and Jain, S.</td>
    428 </tr>
    429 
    430 <tr>
    431      <td>Title</td>
    432      <td>Experimental evaluation of openvz from a testbed deployment perspective</td>
    433 </tr>
    434 
    435 <tr>
    436      <td>Journal</td>
    437      <td>Proceedings of the ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom)</td>
    438 </tr>
    439 
    440 <tr>
    441      <td>Year</td>
    442      <td>2010</td>
    443 </tr>
    444 
    445 
    446 
    447 <tr>
    448      <td>DOI</td>
    449      <td>10.1007/978-3-642-17851-1&#x005F;7</td>
    450 </tr>
    451 
    452 
    453 
    454 <tr>
    455      <td>URL</td>
    456      <td><a href="http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;7">http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;7</a></td>
     418<b class="myheading" style="position: relative; left: 5%;">Bhanage, G. and Seskar, I. and Zhang, Y. and Raychaudhuri, D. and Jain, S.</b>
     419
     420<div class="BibEntry">
     421
     422<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     423
     424
     425<tr>
     426     <td valign="top">Author</td>
     427     <td valign="top">Bhanage, G. and Seskar, I. and Zhang, Y. and Raychaudhuri, D. and Jain, S.</td>
     428</tr>
     429
     430<tr>
     431     <td valign="top">Title</td>
     432     <td valign="top">Experimental evaluation of openvz from a testbed deployment perspective</td>
     433</tr>
     434
     435<tr>
     436     <td valign="top">Journal</td>
     437     <td valign="top">Proceedings of the ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom)</td>
     438</tr>
     439
     440<tr>
     441     <td valign="top">Year</td>
     442     <td valign="top">2010</td>
     443</tr>
     444
     445
     446
     447<tr>
     448     <td valign="top">DOI</td>
     449     <td valign="top">10.1007/978-3-642-17851-1&#x005F;7</td>
     450</tr>
     451
     452
     453
     454<tr>
     455     <td valign="top">URL</td>
     456     <td valign="top"><a href="http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;7">http://dx.doi.org/10.1007/978-3-642-17851-1&#x005F;7</a></td>
    457457</tr>
    458458
    … …  
    464464
    465465<a class="EntryGoto" id="Bhanage, G. and Vete, D. and Seskar, I. and Raychaudhuri, D."></a>
    466 <b class="myheading" style="position: relative; left: 10%;">Bhanage, G. and Vete, D. and Seskar, I. and Raychaudhuri, D.</b>
    467 
    468 <div class="BibEntry">
    469 
    470 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    471 
    472 
    473 <tr>
    474      <td>Author</td>
    475      <td>Bhanage, G. and Vete, D. and Seskar, I. and Raychaudhuri, D.</td>
    476 </tr>
    477 
    478 <tr>
    479      <td>Title</td>
    480      <td>SplitAP: Leveraging Wireless Network Virtualization for Flexible Sharing of WLANs</td>
    481 </tr>
    482 
    483 <tr>
    484      <td>Booktitle</td>
    485      <td>Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE</td>
    486 </tr>
    487 
    488 <tr>
    489      <td>Publisher</td>
    490      <td>IEEE</td>
    491 </tr>
    492 
    493 <tr>
    494      <td>Year</td>
    495      <td>2010</td>
    496 </tr>
    497 
    498 <tr>
    499      <td>Abstract</td>
    500      <td>Providing air-time guarantees across a group of clients forms a fundamental building block in sharing an access point (AP) across different virtual network providers. Though this problem has a relatively simple solution for downlink group scheduling through traffic engineering at the AP, solving this problem for uplink (UL) traffic presents a challenge for fair sharing of wireless hotspots. Among other issues, the mechanism for uplink traffic control has to scale across a large user base, and provide flexible operation irrespective of the client channel conditions and network loads. In this study, we propose the SplitAP architecture that address the problem of sharing uplink airtime across groups of users by extending the idea of network virtualization. Our architecture allows us to deploy different algorithms for enforcing UL airtime fairness across client groups. In this study, we will highlight the design features of the SplitAP architecture, and present results from evaluation on a prototype deployed with: (1) LPFC and (2) LPFC+, two algorithms for controlling UL group fairness. Performance comparisons on the ORBIT testbed show that the proposed algorithms are capable of providing group air-time fairness across wireless clients irrespective of the network volume, and traffic type. The algorithms show up to 40&#x0025; improvement with a modified Jain fairness index.</td>
    501 </tr>
    502 
    503 
    504 
    505 <tr>
    506      <td>DOI</td>
    507      <td>10.1109/GLOCOM.2010.5684328</td>
    508 </tr>
    509 
    510 
    511 
    512 <tr>
    513      <td>URL</td>
    514      <td><a href="http://dx.doi.org/10.1109/GLOCOM.2010.5684328">http://dx.doi.org/10.1109/GLOCOM.2010.5684328</a></td>
     466<b class="myheading" style="position: relative; left: 5%;">Bhanage, G. and Vete, D. and Seskar, I. and Raychaudhuri, D.</b>
     467
     468<div class="BibEntry">
     469
     470<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     471
     472
     473<tr>
     474     <td valign="top">Author</td>
     475     <td valign="top">Bhanage, G. and Vete, D. and Seskar, I. and Raychaudhuri, D.</td>
     476</tr>
     477
     478<tr>
     479     <td valign="top">Title</td>
     480     <td valign="top">SplitAP: Leveraging Wireless Network Virtualization for Flexible Sharing of WLANs</td>
     481</tr>
     482
     483<tr>
     484     <td valign="top">Booktitle</td>
     485     <td valign="top">Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE</td>
     486</tr>
     487
     488<tr>
     489     <td valign="top">Publisher</td>
     490     <td valign="top">IEEE</td>
     491</tr>
     492
     493<tr>
     494     <td valign="top">Year</td>
     495     <td valign="top">2010</td>
     496</tr>
     497
     498<tr>
     499     <td valign="top">Abstract</td>
     500     <td valign="top">Providing air-time guarantees across a group of clients forms a fundamental building block in sharing an access point (AP) across different virtual network providers. Though this problem has a relatively simple solution for downlink group scheduling through traffic engineering at the AP, solving this problem for uplink (UL) traffic presents a challenge for fair sharing of wireless hotspots. Among other issues, the mechanism for uplink traffic control has to scale across a large user base, and provide flexible operation irrespective of the client channel conditions and network loads. In this study, we propose the SplitAP architecture that address the problem of sharing uplink airtime across groups of users by extending the idea of network virtualization. Our architecture allows us to deploy different algorithms for enforcing UL airtime fairness across client groups. In this study, we will highlight the design features of the SplitAP architecture, and present results from evaluation on a prototype deployed with: (1) LPFC and (2) LPFC+, two algorithms for controlling UL group fairness. Performance comparisons on the ORBIT testbed show that the proposed algorithms are capable of providing group air-time fairness across wireless clients irrespective of the network volume, and traffic type. The algorithms show up to 40&#x0025; improvement with a modified Jain fairness index.</td>
     501</tr>
     502
     503
     504
     505<tr>
     506     <td valign="top">DOI</td>
     507     <td valign="top">10.1109/GLOCOM.2010.5684328</td>
     508</tr>
     509
     510
     511
     512<tr>
     513     <td valign="top">URL</td>
     514     <td valign="top"><a href="http://dx.doi.org/10.1109/GLOCOM.2010.5684328">http://dx.doi.org/10.1109/GLOCOM.2010.5684328</a></td>
    515515</tr>
    516516
    … …  
    522522
    523523<a class="EntryGoto" id="Bhanage, Gautam and Seskar, Ivan and Mahindra, Rajesh and Raychaudhuri, Dipankar"></a>
    524 <b class="myheading" style="position: relative; left: 10%;">Bhanage, Gautam and Seskar, Ivan and Mahindra, Rajesh and Raychaudhuri, Dipankar</b>
    525 
    526 <div class="BibEntry">
    527 
    528 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    529 
    530 
    531 <tr>
    532      <td>Author</td>
    533      <td>Bhanage, Gautam and Seskar, Ivan and Mahindra, Rajesh and Raychaudhuri, Dipankar</td>
    534 </tr>
    535 
    536 <tr>
    537      <td>Title</td>
    538      <td>Virtual basestation: architecture for an open shared WiMAX framework</td>
    539 </tr>
    540 
    541 <tr>
    542      <td>Booktitle</td>
    543      <td>Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures</td>
    544 </tr>
    545 
    546 <tr>
    547      <td>Location</td>
    548      <td>New Delhi, India</td>
    549 </tr>
    550 
    551 <tr>
    552      <td>Publisher</td>
    553      <td>ACM</td>
    554 </tr>
    555 
    556 <tr>
    557      <td>Address</td>
    558      <td>New York, NY, USA</td>
    559 </tr>
    560 
    561 <tr>
    562      <td>Year</td>
    563      <td>2010</td>
    564 </tr>
    565 
    566 <tr>
    567      <td>Abstract</td>
    568      <td>This paper presents the architecture and performance evaluation of a virtualized wide-area &#x34;&#x0308;G&#x20;&#x0308;cellular wireless network. Specifically, it addresses the challenges of virtualization of resources in a cellular base station to enable shared use by multiple independent slice users (experimenters or mobile virtual network operators), each with possibly distinct flow types and network layer protocols. The proposed virtual basestation architecture is based on an external substrate which uses a layer-2 switched datapath, and an arbitrated control path to the WiMAX basestation. The framework implements virtualization of base station's radio resources to achieve isolation between multiple virtual networks. An algorithm for weighted fair sharing among multiple slices based on an airtime fairness metric has been implemented for the first release. Preliminary experimental results from the virtual basestation prototype are given, demonstrating mobile network performance, isolation across slices with different flow types, and custom flow scheduling capabilities.</td>
    569 </tr>
    570 
    571 
    572 
    573 <tr>
    574      <td>DOI</td>
    575      <td>10.1145/1851399.1851401</td>
    576 </tr>
    577 
    578 
    579 
    580 <tr>
    581      <td>URL</td>
    582      <td><a href="http://dx.doi.org/10.1145/1851399.1851401">http://dx.doi.org/10.1145/1851399.1851401</a></td>
     524<b class="myheading" style="position: relative; left: 5%;">Bhanage, Gautam and Seskar, Ivan and Mahindra, Rajesh and Raychaudhuri, Dipankar</b>
     525
     526<div class="BibEntry">
     527
     528<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     529
     530
     531<tr>
     532     <td valign="top">Author</td>
     533     <td valign="top">Bhanage, Gautam and Seskar, Ivan and Mahindra, Rajesh and Raychaudhuri, Dipankar</td>
     534</tr>
     535
     536<tr>
     537     <td valign="top">Title</td>
     538     <td valign="top">Virtual basestation: architecture for an open shared WiMAX framework</td>
     539</tr>
     540
     541<tr>
     542     <td valign="top">Booktitle</td>
     543     <td valign="top">Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures</td>
     544</tr>
     545
     546<tr>
     547     <td valign="top">Location</td>
     548     <td valign="top">New Delhi, India</td>
     549</tr>
     550
     551<tr>
     552     <td valign="top">Publisher</td>
     553     <td valign="top">ACM</td>
     554</tr>
     555
     556<tr>
     557     <td valign="top">Address</td>
     558     <td valign="top">New York, NY, USA</td>
     559</tr>
     560
     561<tr>
     562     <td valign="top">Year</td>
     563     <td valign="top">2010</td>
     564</tr>
     565
     566<tr>
     567     <td valign="top">Abstract</td>
     568     <td valign="top">This paper presents the architecture and performance evaluation of a virtualized wide-area &#x34;&#x0308;G&#x20;&#x0308;cellular wireless network. Specifically, it addresses the challenges of virtualization of resources in a cellular base station to enable shared use by multiple independent slice users (experimenters or mobile virtual network operators), each with possibly distinct flow types and network layer protocols. The proposed virtual basestation architecture is based on an external substrate which uses a layer-2 switched datapath, and an arbitrated control path to the WiMAX basestation. The framework implements virtualization of base station's radio resources to achieve isolation between multiple virtual networks. An algorithm for weighted fair sharing among multiple slices based on an airtime fairness metric has been implemented for the first release. Preliminary experimental results from the virtual basestation prototype are given, demonstrating mobile network performance, isolation across slices with different flow types, and custom flow scheduling capabilities.</td>
     569</tr>
     570
     571
     572
     573<tr>
     574     <td valign="top">DOI</td>
     575     <td valign="top">10.1145/1851399.1851401</td>
     576</tr>
     577
     578
     579
     580<tr>
     581     <td valign="top">URL</td>
     582     <td valign="top"><a href="http://dx.doi.org/10.1145/1851399.1851401">http://dx.doi.org/10.1145/1851399.1851401</a></td>
    583583</tr>
    584584
    … …  
    590590
    591591<a class="EntryGoto" id="Bhanage, Gautam and Seskar, Ivan and Raychaudhuri, Dipankar"></a>
    592 <b class="myheading" style="position: relative; left: 10%;">Bhanage, Gautam and Seskar, Ivan and Raychaudhuri, Dipankar</b>
    593 
    594 <div class="BibEntry">
    595 
    596 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    597 
    598 
    599 <tr>
    600      <td>Author</td>
    601      <td>Bhanage, Gautam and Seskar, Ivan and Raychaudhuri, Dipankar</td>
    602 </tr>
    603 
    604 <tr>
    605      <td>Title</td>
    606      <td>A virtualization architecture for mobile WiMAX networks</td>
    607 </tr>
    608 
    609 <tr>
    610      <td>Journal</td>
    611      <td>SIGMOBILE Mob. Comput. Commun. Rev.</td>
    612 </tr>
    613 
    614 <tr>
    615      <td>Publisher</td>
    616      <td>ACM</td>
    617 </tr>
    618 
    619 <tr>
    620      <td>Address</td>
    621      <td>New York, NY, USA</td>
    622 </tr>
    623 
    624 <tr>
    625      <td>Year</td>
    626      <td>2012</td>
    627 </tr>
    628 
    629 <tr>
    630      <td>Abstract</td>
    631      <td>Systems virtualization offers convenient means for sharing networking infrastructure while improving its utilization. This study addresses the challenges of virtualizing a commercial off-the-shelf 4G mobileWiMAX basestation. We highlight additions and modifications needed in theWiMAX network architecture for supporting multiple simultaneous virtual basestations on a single physical basestation. The most prominent features provided by the proposed virtual basestation framework include the capability to perform all frame switching at layer-2, and control mechanisms to provide isolation across slices needed to ensure experiment repeatability. By prototyping on a commercial WiMAX radio, this paper shows the usage of the virtual basestation system for housing mobile virtual network operators and testbeds alike. A use case is shown where the virtual basestation design is used to evaluate mobile handoff schemes. Another usage case is shown for optimizing a video delivery on the edge. The video delivery use case is used to show performance improvements of up to 5dB in the PSNR. Evaluation of prototype shows a significant improvement in the slice isolation, with aggregate throughput improvements of up to 192&#x0025; achievable through fair resource allocation.</td>
    632 </tr>
    633 
    634 
    635 
    636 <tr>
    637      <td>DOI</td>
    638      <td>10.1145/2169077.2169082</td>
    639 </tr>
    640 
    641 
    642 
    643 <tr>
    644      <td>URL</td>
    645      <td><a href="http://dx.doi.org/10.1145/2169077.2169082">http://dx.doi.org/10.1145/2169077.2169082</a></td>
     592<b class="myheading" style="position: relative; left: 5%;">Bhanage, Gautam and Seskar, Ivan and Raychaudhuri, Dipankar</b>
     593
     594<div class="BibEntry">
     595
     596<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     597
     598
     599<tr>
     600     <td valign="top">Author</td>
     601     <td valign="top">Bhanage, Gautam and Seskar, Ivan and Raychaudhuri, Dipankar</td>
     602</tr>
     603
     604<tr>
     605     <td valign="top">Title</td>
     606     <td valign="top">A virtualization architecture for mobile WiMAX networks</td>
     607</tr>
     608
     609<tr>
     610     <td valign="top">Journal</td>
     611     <td valign="top">SIGMOBILE Mob. Comput. Commun. Rev.</td>
     612</tr>
     613
     614<tr>
     615     <td valign="top">Publisher</td>
     616     <td valign="top">ACM</td>
     617</tr>
     618
     619<tr>
     620     <td valign="top">Address</td>
     621     <td valign="top">New York, NY, USA</td>
     622</tr>
     623
     624<tr>
     625     <td valign="top">Year</td>
     626     <td valign="top">2012</td>
     627</tr>
     628
     629<tr>
     630     <td valign="top">Abstract</td>
     631     <td valign="top">Systems virtualization offers convenient means for sharing networking infrastructure while improving its utilization. This study addresses the challenges of virtualizing a commercial off-the-shelf 4G mobileWiMAX basestation. We highlight additions and modifications needed in theWiMAX network architecture for supporting multiple simultaneous virtual basestations on a single physical basestation. The most prominent features provided by the proposed virtual basestation framework include the capability to perform all frame switching at layer-2, and control mechanisms to provide isolation across slices needed to ensure experiment repeatability. By prototyping on a commercial WiMAX radio, this paper shows the usage of the virtual basestation system for housing mobile virtual network operators and testbeds alike. A use case is shown where the virtual basestation design is used to evaluate mobile handoff schemes. Another usage case is shown for optimizing a video delivery on the edge. The video delivery use case is used to show performance improvements of up to 5dB in the PSNR. Evaluation of prototype shows a significant improvement in the slice isolation, with aggregate throughput improvements of up to 192&#x0025; achievable through fair resource allocation.</td>
     632</tr>
     633
     634
     635
     636<tr>
     637     <td valign="top">DOI</td>
     638     <td valign="top">10.1145/2169077.2169082</td>
     639</tr>
     640
     641
     642
     643<tr>
     644     <td valign="top">URL</td>
     645     <td valign="top"><a href="http://dx.doi.org/10.1145/2169077.2169082">http://dx.doi.org/10.1145/2169077.2169082</a></td>
    646646</tr>
    647647
    … …  
    653653
    654654<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>
    655 <b class="myheading" style="position: relative; left: 10%;">Blanton, Ethan and Chatterjee, Sarbajit and Gangam, Sriharsha and Kala, Sumit and Sharma, Deepti and Fahmy, Sonia and Sharma, Puneet</b>
    656 
    657 <div class="BibEntry">
    658 
    659 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    660 
    661 
    662 <tr>
    663      <td>Author</td>
    664      <td>Blanton, Ethan and Chatterjee, Sarbajit and Gangam, Sriharsha and Kala, Sumit and Sharma, Deepti and Fahmy, Sonia and Sharma, Puneet</td>
    665 </tr>
    666 
    667 <tr>
    668      <td>Title</td>
    669      <td>Design and evaluation of the S<sup>3</sup> monitor network measurement service on GENI</td>
    670 </tr>
    671 
    672 <tr>
    673      <td>Booktitle</td>
    674      <td>2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012)</td>
    675 </tr>
    676 
    677 <tr>
    678      <td>Location</td>
    679      <td>Bangalore, India</td>
    680 </tr>
    681 
    682 <tr>
    683      <td>Publisher</td>
    684      <td>IEEE</td>
    685 </tr>
    686 
    687 <tr>
    688      <td>Year</td>
    689      <td>2012</td>
    690 </tr>
    691 
    692 <tr>
    693      <td>Abstract</td>
    694      <td>Network monitoring capabilities are critical for both network operators and networked applications. In the context of an experimental test facility, network measurement is important for researchers experimenting with new network architectures and applications, as well as operators of the test facility itself. The Global Environment for Network Innovations (GENI) is a sophisticated test facility comprised of multiple ” control frameworks.” In this paper, we describe the design and implementation of S</td>
    695 </tr>
    696 
    697 
    698 
    699 <tr>
    700      <td>DOI</td>
    701      <td>10.1109/COMSNETS.2012.6151327</td>
    702 </tr>
    703 
    704 
    705 
    706 <tr>
    707      <td>URL</td>
    708      <td><a href="http://dx.doi.org/10.1109/COMSNETS.2012.6151327">http://dx.doi.org/10.1109/COMSNETS.2012.6151327</a></td>
     655<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>
     656
     657<div class="BibEntry">
     658
     659<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     660
     661
     662<tr>
     663     <td valign="top">Author</td>
     664     <td valign="top">Blanton, Ethan and Chatterjee, Sarbajit and Gangam, Sriharsha and Kala, Sumit and Sharma, Deepti and Fahmy, Sonia and Sharma, Puneet</td>
     665</tr>
     666
     667<tr>
     668     <td valign="top">Title</td>
     669     <td valign="top">Design and evaluation of the S<sup>3</sup> monitor network measurement service on GENI</td>
     670</tr>
     671
     672<tr>
     673     <td valign="top">Booktitle</td>
     674     <td valign="top">2012 Fourth International Conference on Communication Systems and Networks (COMSNETS 2012)</td>
     675</tr>
     676
     677<tr>
     678     <td valign="top">Location</td>
     679     <td valign="top">Bangalore, India</td>
     680</tr>
     681
     682<tr>
     683     <td valign="top">Publisher</td>
     684     <td valign="top">IEEE</td>
     685</tr>
     686
     687<tr>
     688     <td valign="top">Year</td>
     689     <td valign="top">2012</td>
     690</tr>
     691
     692<tr>
     693     <td valign="top">Abstract</td>
     694     <td valign="top">Network monitoring capabilities are critical for both network operators and networked applications. In the context of an experimental test facility, network measurement is important for researchers experimenting with new network architectures and applications, as well as operators of the test facility itself. The Global Environment for Network Innovations (GENI) is a sophisticated test facility comprised of multiple ” control frameworks.” In this paper, we describe the design and implementation of S</td>
     695</tr>
     696
     697
     698
     699<tr>
     700     <td valign="top">DOI</td>
     701     <td valign="top">10.1109/COMSNETS.2012.6151327</td>
     702</tr>
     703
     704
     705
     706<tr>
     707     <td valign="top">URL</td>
     708     <td valign="top"><a href="http://dx.doi.org/10.1109/COMSNETS.2012.6151327">http://dx.doi.org/10.1109/COMSNETS.2012.6151327</a></td>
    709709</tr>
    710710
    … …  
    716716
    717717<a class="EntryGoto" id="Calyam, P. and Sridharan, M. and Xu, Yingxiao and Zhu, Kunpeng and Berryman, A. and Patali, R. and Venkataraman, A."></a>
    718 <b class="myheading" style="position: relative; left: 10%;">Calyam, P. and Sridharan, M. and Xu, Yingxiao and Zhu, Kunpeng and Berryman, A. and Patali, R. and Venkataraman, A.</b>
    719 
    720 <div class="BibEntry">
    721 
    722 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    723 
    724 
    725 <tr>
    726      <td>Author</td>
    727      <td>Calyam, P. and Sridharan, M. and Xu, Yingxiao and Zhu, Kunpeng and Berryman, A. and Patali, R. and Venkataraman, A.</td>
    728 </tr>
    729 
    730 <tr>
    731      <td>Title</td>
    732      <td>Enabling performance intelligence for application adaptation in the Future Internet</td>
    733 </tr>
    734 
    735 <tr>
    736      <td>Journal</td>
    737      <td>Communications and Networks, Journal of</td>
    738 </tr>
    739 
    740 <tr>
    741      <td>Year</td>
    742      <td>2011</td>
    743 </tr>
    744 
    745 
    746 
    747 <tr>
    748      <td>DOI</td>
    749      <td>10.1109/JCN.2011.6157475</td>
    750 </tr>
    751 
    752 
    753 
    754 <tr>
    755      <td>URL</td>
    756      <td><a href="http://dx.doi.org/10.1109/JCN.2011.6157475">http://dx.doi.org/10.1109/JCN.2011.6157475</a></td>
     718<b class="myheading" style="position: relative; left: 5%;">Calyam, P. and Sridharan, M. and Xu, Yingxiao and Zhu, Kunpeng and Berryman, A. and Patali, R. and Venkataraman, A.</b>
     719
     720<div class="BibEntry">
     721
     722<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     723
     724
     725<tr>
     726     <td valign="top">Author</td>
     727     <td valign="top">Calyam, P. and Sridharan, M. and Xu, Yingxiao and Zhu, Kunpeng and Berryman, A. and Patali, R. and Venkataraman, A.</td>
     728</tr>
     729
     730<tr>
     731     <td valign="top">Title</td>
     732     <td valign="top">Enabling performance intelligence for application adaptation in the Future Internet</td>
     733</tr>
     734
     735<tr>
     736     <td valign="top">Journal</td>
     737     <td valign="top">Communications and Networks, Journal of</td>
     738</tr>
     739
     740<tr>
     741     <td valign="top">Year</td>
     742     <td valign="top">2011</td>
     743</tr>
     744
     745
     746
     747<tr>
     748     <td valign="top">DOI</td>
     749     <td valign="top">10.1109/JCN.2011.6157475</td>
     750</tr>
     751
     752
     753
     754<tr>
     755     <td valign="top">URL</td>
     756     <td valign="top"><a href="http://dx.doi.org/10.1109/JCN.2011.6157475">http://dx.doi.org/10.1109/JCN.2011.6157475</a></td>
    757757</tr>
    758758
    … …  
    764764
    765765<a class="EntryGoto" id="Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex and Faerman, Marcio"></a>
    766 <b class="myheading" style="position: relative; left: 10%;">Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex and Faerman, Marcio</b>
    767 
    768 <div class="BibEntry">
    769 
    770 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    771 
    772 
    773 <tr>
    774      <td>Author</td>
    775      <td>Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex and Faerman, Marcio</td>
    776 </tr>
    777 
    778 <tr>
    779      <td>Title</td>
    780      <td>Experiences from Virtual Desktop CloudExperiments in GENI</td>
    781 </tr>
    782 
    783 <tr>
    784      <td>Booktitle</td>
    785      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    786 </tr>
    787 
    788 <tr>
    789      <td>Location</td>
    790      <td>Los Angeles</td>
    791 </tr>
    792 
    793 <tr>
    794      <td>Year</td>
    795      <td>2012</td>
    796 </tr>
    797 
    798 <tr>
    799      <td>Abstract</td>
    800      <td>Popular applications such as email, photo/video galleries, and file storage are increasingly being supported by cloud platforms in residential, academia and industry communities. The next frontier for these user communities will be to transition 'traditional desktops' that have dedicated hardware and software configurations into 'virtual desktop clouds' that are accessible via thin-clients. In this paper, we describe experiences from our research and development of virtual desktop cloud experiments in GENI. Our experimentation goal is to investigate and develop optimal resource allocation frameworks and performance bench- marking tools that can enable provisioning (i.e., resource sizing) and placement (i.e., resource mapping) of thin-client based virtual desktops at Internet-scale. We first motivate why virtual desktop cloud experiments cannot be done only at a table-top level, and why infrastructures such as GENI are essential. Next, we detail the methodology of our completed ” provisioning” experiments, and our work-in-progress ” placement” experiments in GENI that leverage multiple kinds of GENI resources such as aggregates, measurement services and experimenter workflow tools, as well as commercial software. Lastly, we present our vision on how our experiment slice setup and application development experiences, as well as outcomes can be leveraged in classroom labs, and 'living labs' that use GENI resources to foster training and wide- adoption of Future Internet applications.</td>
     766<b class="myheading" style="position: relative; left: 5%;">Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex and Faerman, Marcio</b>
     767
     768<div class="BibEntry">
     769
     770<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     771
     772
     773<tr>
     774     <td valign="top">Author</td>
     775     <td valign="top">Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex and Faerman, Marcio</td>
     776</tr>
     777
     778<tr>
     779     <td valign="top">Title</td>
     780     <td valign="top">Experiences from Virtual Desktop CloudExperiments in GENI</td>
     781</tr>
     782
     783<tr>
     784     <td valign="top">Booktitle</td>
     785     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     786</tr>
     787
     788<tr>
     789     <td valign="top">Location</td>
     790     <td valign="top">Los Angeles</td>
     791</tr>
     792
     793<tr>
     794     <td valign="top">Year</td>
     795     <td valign="top">2012</td>
     796</tr>
     797
     798<tr>
     799     <td valign="top">Abstract</td>
     800     <td valign="top">Popular applications such as email, photo/video galleries, and file storage are increasingly being supported by cloud platforms in residential, academia and industry communities. The next frontier for these user communities will be to transition 'traditional desktops' that have dedicated hardware and software configurations into 'virtual desktop clouds' that are accessible via thin-clients. In this paper, we describe experiences from our research and development of virtual desktop cloud experiments in GENI. Our experimentation goal is to investigate and develop optimal resource allocation frameworks and performance bench- marking tools that can enable provisioning (i.e., resource sizing) and placement (i.e., resource mapping) of thin-client based virtual desktops at Internet-scale. We first motivate why virtual desktop cloud experiments cannot be done only at a table-top level, and why infrastructures such as GENI are essential. Next, we detail the methodology of our completed ” provisioning” experiments, and our work-in-progress ” placement” experiments in GENI that leverage multiple kinds of GENI resources such as aggregates, measurement services and experimenter workflow tools, as well as commercial software. Lastly, we present our vision on how our experiment slice setup and application development experiences, as well as outcomes can be leveraged in classroom labs, and 'living labs' that use GENI resources to foster training and wide- adoption of Future Internet applications.</td>
    801801</tr>
    802802
    … …  
    812812
    813813<a class="EntryGoto" id="Cameron, Katherine and Brooks, R. R. and Deng, Juan and Yu, Lu and Wang, K. C. and Martin, James"></a>
    814 <b class="myheading" style="position: relative; left: 10%;">Cameron, Katherine and Brooks, R. R. and Deng, Juan and Yu, Lu and Wang, K. C. and Martin, James</b>
    815 
    816 <div class="BibEntry">
    817 
    818 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    819 
    820 
    821 <tr>
    822      <td>Author</td>
    823      <td>Cameron, Katherine and Brooks, R. R. and Deng, Juan and Yu, Lu and Wang, K. C. and Martin, James</td>
    824 </tr>
    825 
    826 <tr>
    827      <td>Title</td>
    828      <td>WiMAX: Bandwidth Contention Resolution Vulnerability to Denial of Service Attacks</td>
    829 </tr>
    830 
    831 <tr>
    832      <td>Booktitle</td>
    833      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    834 </tr>
    835 
    836 <tr>
    837      <td>Location</td>
    838      <td>Los Angeles</td>
    839 </tr>
    840 
    841 <tr>
    842      <td>Year</td>
    843      <td>2012</td>
    844 </tr>
    845 
    846 <tr>
    847      <td>Abstract</td>
    848      <td>Wireless communications is part of everyday life and 4G technology, including WiMAX, offers higher data rates and wider coverage than predecessor 3G technologies. Many security vulnerabilities have been discovered in 3G protocols and these vulnerabilities may still exist in next generation 4G protocols. This paper examines how system parameters for the WiMAX Bandwidth Contention Resolution process can affect network vulnerability to DoS attacks. It will present software simulations that explore system parameter settings and will cover the current phase of hardware simulations.</td>
     814<b class="myheading" style="position: relative; left: 5%;">Cameron, Katherine and Brooks, R. R. and Deng, Juan and Yu, Lu and Wang, K. C. and Martin, James</b>
     815
     816<div class="BibEntry">
     817
     818<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     819
     820
     821<tr>
     822     <td valign="top">Author</td>
     823     <td valign="top">Cameron, Katherine and Brooks, R. R. and Deng, Juan and Yu, Lu and Wang, K. C. and Martin, James</td>
     824</tr>
     825
     826<tr>
     827     <td valign="top">Title</td>
     828     <td valign="top">WiMAX: Bandwidth Contention Resolution Vulnerability to Denial of Service Attacks</td>
     829</tr>
     830
     831<tr>
     832     <td valign="top">Booktitle</td>
     833     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     834</tr>
     835
     836<tr>
     837     <td valign="top">Location</td>
     838     <td valign="top">Los Angeles</td>
     839</tr>
     840
     841<tr>
     842     <td valign="top">Year</td>
     843     <td valign="top">2012</td>
     844</tr>
     845
     846<tr>
     847     <td valign="top">Abstract</td>
     848     <td valign="top">Wireless communications is part of everyday life and 4G technology, including WiMAX, offers higher data rates and wider coverage than predecessor 3G technologies. Many security vulnerabilities have been discovered in 3G protocols and these vulnerabilities may still exist in next generation 4G protocols. This paper examines how system parameters for the WiMAX Bandwidth Contention Resolution process can affect network vulnerability to DoS attacks. It will present software simulations that explore system parameter settings and will cover the current phase of hardware simulations.</td>
    849849</tr>
    850850
    … …  
    860860
    861861<a class="EntryGoto" id="Chen, Kang and Shen, Haiying and Zhang, Haibo"></a>
    862 <b class="myheading" style="position: relative; left: 10%;">Chen, Kang and Shen, Haiying and Zhang, Haibo</b>
    863 
    864 <div class="BibEntry">
    865 
    866 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    867 
    868 
    869 <tr>
    870      <td>Author</td>
    871      <td>Chen, Kang and Shen, Haiying and Zhang, Haibo</td>
    872 </tr>
    873 
    874 <tr>
    875      <td>Title</td>
    876      <td>Leveraging Social Networks for P2P Content-Based File Sharing in Mobile Ad Hoc Networks</td>
    877 </tr>
    878 
    879 <tr>
    880      <td>Booktitle</td>
    881      <td>2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems</td>
    882 </tr>
    883 
    884 <tr>
    885      <td>Location</td>
    886      <td>Valencia, Spain</td>
    887 </tr>
    888 
    889 <tr>
    890      <td>Publisher</td>
    891      <td>IEEE</td>
    892 </tr>
    893 
    894 <tr>
    895      <td>Year</td>
    896      <td>2011</td>
    897 </tr>
    898 
    899 <tr>
    900      <td>Abstract</td>
    901      <td>Current P2P file sharing methods in mobile ad hoc networks (MANETs) can be classified into three groups: flooding-based, advertisement-based and social contact-based. The first two groups of methods can easily generate high overhead and low scalability, and the third group fails to consider the social interests (content) of mobile nodes, which otherwise can improve file searching efficiency. In this paper, we propose a P2P content-based file sharing system for MANETs. The system uses an interest extraction algorithm to derive a node's interests from its files for complex queries. For efficient file searching, it groups common-interest nodes that frequently meet with each other as communities. Further, it takes advantage of node mobility by designating stable nodes, which has frequent contact with community members, as community coordinators for intra-community searching, and highly-mobile nodes as community ambassadors for inter-community searching. An interest-oriented file searching scheme further enhances the file searching success rate. We first deployed our system on the real-world GENI Orbit testbed with a real trace and then conducted experiment on the ns2 simulator with both real trace and simulated disconnected and connected MANET scenario. The test results show that our system significantly lowers transmission cost and improves file searching success rate compared to current methods.</td>
    902 </tr>
    903 
    904 
    905 
    906 <tr>
    907      <td>DOI</td>
    908      <td>10.1109/MASS.2011.24</td>
    909 </tr>
    910 
    911 
    912 
    913 <tr>
    914      <td>URL</td>
    915      <td><a href="http://dx.doi.org/10.1109/MASS.2011.24">http://dx.doi.org/10.1109/MASS.2011.24</a></td>
     862<b class="myheading" style="position: relative; left: 5%;">Chen, Kang and Shen, Haiying and Zhang, Haibo</b>
     863
     864<div class="BibEntry">
     865
     866<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     867
     868
     869<tr>
     870     <td valign="top">Author</td>
     871     <td valign="top">Chen, Kang and Shen, Haiying and Zhang, Haibo</td>
     872</tr>
     873
     874<tr>
     875     <td valign="top">Title</td>
     876     <td valign="top">Leveraging Social Networks for P2P Content-Based File Sharing in Mobile Ad Hoc Networks</td>
     877</tr>
     878
     879<tr>
     880     <td valign="top">Booktitle</td>
     881     <td valign="top">2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems</td>
     882</tr>
     883
     884<tr>
     885     <td valign="top">Location</td>
     886     <td valign="top">Valencia, Spain</td>
     887</tr>
     888
     889<tr>
     890     <td valign="top">Publisher</td>
     891     <td valign="top">IEEE</td>
     892</tr>
     893
     894<tr>
     895     <td valign="top">Year</td>
     896     <td valign="top">2011</td>
     897</tr>
     898
     899<tr>
     900     <td valign="top">Abstract</td>
     901     <td valign="top">Current P2P file sharing methods in mobile ad hoc networks (MANETs) can be classified into three groups: flooding-based, advertisement-based and social contact-based. The first two groups of methods can easily generate high overhead and low scalability, and the third group fails to consider the social interests (content) of mobile nodes, which otherwise can improve file searching efficiency. In this paper, we propose a P2P content-based file sharing system for MANETs. The system uses an interest extraction algorithm to derive a node's interests from its files for complex queries. For efficient file searching, it groups common-interest nodes that frequently meet with each other as communities. Further, it takes advantage of node mobility by designating stable nodes, which has frequent contact with community members, as community coordinators for intra-community searching, and highly-mobile nodes as community ambassadors for inter-community searching. An interest-oriented file searching scheme further enhances the file searching success rate. We first deployed our system on the real-world GENI Orbit testbed with a real trace and then conducted experiment on the ns2 simulator with both real trace and simulated disconnected and connected MANET scenario. The test results show that our system significantly lowers transmission cost and improves file searching success rate compared to current methods.</td>
     902</tr>
     903
     904
     905
     906<tr>
     907     <td valign="top">DOI</td>
     908     <td valign="top">10.1109/MASS.2011.24</td>
     909</tr>
     910
     911
     912
     913<tr>
     914     <td valign="top">URL</td>
     915     <td valign="top"><a href="http://dx.doi.org/10.1109/MASS.2011.24">http://dx.doi.org/10.1109/MASS.2011.24</a></td>
    916916</tr>
    917917
    … …  
    923923
    924924<a class="EntryGoto" id="Chen, Kang and Xu, Ke and Winburn, Steven and Shen, Haiying and Wang, Kuang-Ching and Li, Ze"></a>
    925 <b class="myheading" style="position: relative; left: 10%;">Chen, Kang and Xu, Ke and Winburn, Steven and Shen, Haiying and Wang, Kuang-Ching and Li, Ze</b>
    926 
    927 <div class="BibEntry">
    928 
    929 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    930 
    931 
    932 <tr>
    933      <td>Author</td>
    934      <td>Chen, Kang and Xu, Ke and Winburn, Steven and Shen, Haiying and Wang, Kuang-Ching and Li, Ze</td>
    935 </tr>
    936 
    937 <tr>
    938      <td>Title</td>
    939      <td>Experimentation of a MANET Routing Algorithm on the GENI ORBIT Testbed</td>
    940 </tr>
    941 
    942 <tr>
    943      <td>Booktitle</td>
    944      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    945 </tr>
    946 
    947 <tr>
    948      <td>Location</td>
    949      <td>Los Angeles</td>
    950 </tr>
    951 
    952 <tr>
    953      <td>Year</td>
    954      <td>2012</td>
    955 </tr>
    956 
    957 <tr>
    958      <td>Abstract</td>
    959      <td>This paper proposes a systematic procedure for experimentation of Mobile ad hoc networks (MANETs) on the ORBIT testbed. MANETs have attracted significant re- search interests in recent years. Most of routing or file sharing algorithms in MANETs were only evaluated by theoretical analysis or simulations because of the requirement of large scale networks. However, due to the distinctive properties of MANETs, such as mobility and decentralized structure, it has been non-trivial to deploy a real testbed for the verification. The Global Environment for Network Innovations (GENI) project sponsored by the National Science Foundation (NSF) provides an exploratory environment for academic real-world experiments, such as the ORBIT testbed. A stable and repeatable procedure for experimentation on real testbeds is necessary and important to assure the validity of results. In this paper, a MANET routing algorithm, namely LORD, was tested on the ORBIT testbed, using the proposed procedure. Specifically, we first configure the wireless interface on each node to enable the communication between each pair of nodes. Then a set of methods are adopted to construct the MANETs scenario for test. The network status is monitored throughout the entire duration of experiments. Finally, the experiment results of LORD on the GENI ORBIT testbed are demonstrated.</td>
     925<b class="myheading" style="position: relative; left: 5%;">Chen, Kang and Xu, Ke and Winburn, Steven and Shen, Haiying and Wang, Kuang-Ching and Li, Ze</b>
     926
     927<div class="BibEntry">
     928
     929<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     930
     931
     932<tr>
     933     <td valign="top">Author</td>
     934     <td valign="top">Chen, Kang and Xu, Ke and Winburn, Steven and Shen, Haiying and Wang, Kuang-Ching and Li, Ze</td>
     935</tr>
     936
     937<tr>
     938     <td valign="top">Title</td>
     939     <td valign="top">Experimentation of a MANET Routing Algorithm on the GENI ORBIT Testbed</td>
     940</tr>
     941
     942<tr>
     943     <td valign="top">Booktitle</td>
     944     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     945</tr>
     946
     947<tr>
     948     <td valign="top">Location</td>
     949     <td valign="top">Los Angeles</td>
     950</tr>
     951
     952<tr>
     953     <td valign="top">Year</td>
     954     <td valign="top">2012</td>
     955</tr>
     956
     957<tr>
     958     <td valign="top">Abstract</td>
     959     <td valign="top">This paper proposes a systematic procedure for experimentation of Mobile ad hoc networks (MANETs) on the ORBIT testbed. MANETs have attracted significant re- search interests in recent years. Most of routing or file sharing algorithms in MANETs were only evaluated by theoretical analysis or simulations because of the requirement of large scale networks. However, due to the distinctive properties of MANETs, such as mobility and decentralized structure, it has been non-trivial to deploy a real testbed for the verification. The Global Environment for Network Innovations (GENI) project sponsored by the National Science Foundation (NSF) provides an exploratory environment for academic real-world experiments, such as the ORBIT testbed. A stable and repeatable procedure for experimentation on real testbeds is necessary and important to assure the validity of results. In this paper, a MANET routing algorithm, namely LORD, was tested on the ORBIT testbed, using the proposed procedure. Specifically, we first configure the wireless interface on each node to enable the communication between each pair of nodes. Then a set of methods are adopted to construct the MANETs scenario for test. The network status is monitored throughout the entire duration of experiments. Finally, the experiment results of LORD on the GENI ORBIT testbed are demonstrated.</td>
    960960</tr>
    961961
    … …  
    971971
    972972<a class="EntryGoto" id="Cherukuri, Ramkumar and Liu, Xuan and Bavier, Andy and Sterbenz, James P. G. and Medhi, Deep"></a>
    973 <b class="myheading" style="position: relative; left: 10%;">Cherukuri, Ramkumar and Liu, Xuan and Bavier, Andy and Sterbenz, James P. G. and Medhi, Deep</b>
    974 
    975 <div class="BibEntry">
    976 
    977 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    978 
    979 
    980 <tr>
    981      <td>Author</td>
    982      <td>Cherukuri, Ramkumar and Liu, Xuan and Bavier, Andy and Sterbenz, James P. G. and Medhi, Deep</td>
    983 </tr>
    984 
    985 <tr>
    986      <td>Title</td>
    987      <td>Network virtualization in GpENI: Framework, implementation &#x0026;amp; integration experience</td>
    988 </tr>
    989 
    990 <tr>
    991      <td>Booktitle</td>
    992      <td>12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops</td>
    993 </tr>
    994 
    995 <tr>
    996      <td>Location</td>
    997      <td>Dublin, Ireland</td>
    998 </tr>
    999 
    1000 <tr>
    1001      <td>Publisher</td>
    1002      <td>IEEE</td>
    1003 </tr>
    1004 
    1005 <tr>
    1006      <td>Year</td>
    1007      <td>2011</td>
    1008 </tr>
    1009 
    1010 <tr>
    1011      <td>Abstract</td>
    1012      <td>Great Plains Environment for Network Innovation (GpENI) is an international testbed for future Internet research. A key component of GpENI is programmable network virtualization (GpENI-VINI). The scope of this paper is to present the framework, implementation and integration experience with network virtualization in GpENI. In particular, this is described through our experience of implementing and integrating the XORP (eXtensible Open Router Platform) routing platform into GpENI-VINI. Preliminary results on measurements and validation are presented.</td>
    1013 </tr>
    1014 
    1015 
    1016 
    1017 <tr>
    1018      <td>DOI</td>
    1019      <td>10.1109/INM.2011.5990568</td>
    1020 </tr>
    1021 
    1022 
    1023 
    1024 <tr>
    1025      <td>URL</td>
    1026      <td><a href="http://dx.doi.org/10.1109/INM.2011.5990568">http://dx.doi.org/10.1109/INM.2011.5990568</a></td>
     973<b class="myheading" style="position: relative; left: 5%;">Cherukuri, Ramkumar and Liu, Xuan and Bavier, Andy and Sterbenz, James P. G. and Medhi, Deep</b>
     974
     975<div class="BibEntry">
     976
     977<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     978
     979
     980<tr>
     981     <td valign="top">Author</td>
     982     <td valign="top">Cherukuri, Ramkumar and Liu, Xuan and Bavier, Andy and Sterbenz, James P. G. and Medhi, Deep</td>
     983</tr>
     984
     985<tr>
     986     <td valign="top">Title</td>
     987     <td valign="top">Network virtualization in GpENI: Framework, implementation &#x0026;amp; integration experience</td>
     988</tr>
     989
     990<tr>
     991     <td valign="top">Booktitle</td>
     992     <td valign="top">12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011) and Workshops</td>
     993</tr>
     994
     995<tr>
     996     <td valign="top">Location</td>
     997     <td valign="top">Dublin, Ireland</td>
     998</tr>
     999
     1000<tr>
     1001     <td valign="top">Publisher</td>
     1002     <td valign="top">IEEE</td>
     1003</tr>
     1004
     1005<tr>
     1006     <td valign="top">Year</td>
     1007     <td valign="top">2011</td>
     1008</tr>
     1009
     1010<tr>
     1011     <td valign="top">Abstract</td>
     1012     <td valign="top">Great Plains Environment for Network Innovation (GpENI) is an international testbed for future Internet research. A key component of GpENI is programmable network virtualization (GpENI-VINI). The scope of this paper is to present the framework, implementation and integration experience with network virtualization in GpENI. In particular, this is described through our experience of implementing and integrating the XORP (eXtensible Open Router Platform) routing platform into GpENI-VINI. Preliminary results on measurements and validation are presented.</td>
     1013</tr>
     1014
     1015
     1016
     1017<tr>
     1018     <td valign="top">DOI</td>
     1019     <td valign="top">10.1109/INM.2011.5990568</td>
     1020</tr>
     1021
     1022
     1023
     1024<tr>
     1025     <td valign="top">URL</td>
     1026     <td valign="top"><a href="http://dx.doi.org/10.1109/INM.2011.5990568">http://dx.doi.org/10.1109/INM.2011.5990568</a></td>
    10271027</tr>
    10281028
    … …  
    10341034
    10351035<a class="EntryGoto" id="Deng, Juan and Brooks, Richard R. and Martin, James"></a>
    1036 <b class="myheading" style="position: relative; left: 10%;">Deng, Juan and Brooks, Richard R. and Martin, James</b>
    1037 
    1038 <div class="BibEntry">
    1039 
    1040 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1041 
    1042 
    1043 <tr>
    1044      <td>Author</td>
    1045      <td>Deng, Juan and Brooks, Richard R. and Martin, James</td>
    1046 </tr>
    1047 
    1048 <tr>
    1049      <td>Title</td>
    1050      <td>Assessing the Effect of WiMAX System Parameter Settings on MAC-level Local DoS Vulnerability</td>
    1051 </tr>
    1052 
    1053 <tr>
    1054      <td>Journal</td>
    1055      <td>International Journal of Performability Engineering</td>
    1056 </tr>
    1057 
    1058 <tr>
    1059      <td>Year</td>
    1060      <td>2012</td>
    1061 </tr>
    1062 
    1063 <tr>
    1064      <td>Abstract</td>
    1065      <td>The research community has established that WiMAX networks suffer from Denial of Service (DoS) vulnerabilities. In this paper, we analyze how WiMAX system parameter settings increase or decrease DoS vulnerabilities of WiMAX networks. The behavior of the WiMAX MAC level protocol is sensitive to the settings of core system parameters. Unlike traditional network-based DoS attacks, attacks resulting from parameter misconfiguration are difficult for network operators to detect. We focus on bandwidth contention resolution aspects of the WiMAX MAC protocol. Simulations are performed using the ns-2 simulator. Analysis of Variance (ANOVA) techniques on the resulting simulation data identify which bandwidth contention resolution parameter combinations are crucial for configuring WiMAX to be less vulnerable to DoS attacks.</td>
     1036<b class="myheading" style="position: relative; left: 5%;">Deng, Juan and Brooks, Richard R. and Martin, James</b>
     1037
     1038<div class="BibEntry">
     1039
     1040<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1041
     1042
     1043<tr>
     1044     <td valign="top">Author</td>
     1045     <td valign="top">Deng, Juan and Brooks, Richard R. and Martin, James</td>
     1046</tr>
     1047
     1048<tr>
     1049     <td valign="top">Title</td>
     1050     <td valign="top">Assessing the Effect of WiMAX System Parameter Settings on MAC-level Local DoS Vulnerability</td>
     1051</tr>
     1052
     1053<tr>
     1054     <td valign="top">Journal</td>
     1055     <td valign="top">International Journal of Performability Engineering</td>
     1056</tr>
     1057
     1058<tr>
     1059     <td valign="top">Year</td>
     1060     <td valign="top">2012</td>
     1061</tr>
     1062
     1063<tr>
     1064     <td valign="top">Abstract</td>
     1065     <td valign="top">The research community has established that WiMAX networks suffer from Denial of Service (DoS) vulnerabilities. In this paper, we analyze how WiMAX system parameter settings increase or decrease DoS vulnerabilities of WiMAX networks. The behavior of the WiMAX MAC level protocol is sensitive to the settings of core system parameters. Unlike traditional network-based DoS attacks, attacks resulting from parameter misconfiguration are difficult for network operators to detect. We focus on bandwidth contention resolution aspects of the WiMAX MAC protocol. Simulations are performed using the ns-2 simulator. Analysis of Variance (ANOVA) techniques on the resulting simulation data identify which bandwidth contention resolution parameter combinations are crucial for configuring WiMAX to be less vulnerable to DoS attacks.</td>
    10661066</tr>
    10671067
    … …  
    10771077
    10781078<a class="EntryGoto" id="Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Strum, Matt and Wong, Gary and Carpenter, Charles and Fei, Zongming and Griffioen, James and Nasir, Hussamuddin and Reed, Jeremy and Wu, Xiongqi"></a>
    1079 <b class="myheading" style="position: relative; left: 10%;">Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Strum, Matt and Wong, Gary and Carpenter, Charles and Fei, Zongming and Griffioen, James and Nasir, Hussamuddin and Reed, Jeremy and Wu, Xiongqi</b>
    1080 
    1081 <div class="BibEntry">
    1082 
    1083 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1084 
    1085 
    1086 <tr>
    1087      <td>Author</td>
    1088      <td>Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Strum, Matt and Wong, Gary and Carpenter, Charles and Fei, Zongming and Griffioen, James and Nasir, Hussamuddin and Reed, Jeremy and Wu, Xiongqi</td>
    1089 </tr>
    1090 
    1091 <tr>
    1092      <td>Title</td>
    1093      <td>Getting started with GENI: a user tutorial</td>
    1094 </tr>
    1095 
    1096 <tr>
    1097      <td>Journal</td>
    1098      <td>SIGCOMM Comput. Commun. Rev.</td>
    1099 </tr>
    1100 
    1101 <tr>
    1102      <td>Publisher</td>
    1103      <td>ACM</td>
    1104 </tr>
    1105 
    1106 <tr>
    1107      <td>Address</td>
    1108      <td>New York, NY, USA</td>
    1109 </tr>
    1110 
    1111 <tr>
    1112      <td>Year</td>
    1113      <td>2012</td>
    1114 </tr>
    1115 
    1116 <tr>
    1117      <td>Abstract</td>
    1118      <td>GENI, the Global Environment for Network Innovations, is a National Science Foundation project to create a &#x76;&#x0308;irtual laboratory at the frontiers of network science and engineering for exploring future internets at scale.&#x20;&#x0308;It provides researchers, educators, and students with resources that they can use to build their own networks that span the country and - through federation - the world. GENI enables experimenters to try out bold new network architectures and designs for networked systems, and to deploy and evaluate these systems on a diverse set of resources over a large footprint. This tutorial is a starting point for running experiments on GENI. It provides an overview of GENI and covers the process of creating a network and running a simple experiment using two tools: the Flack GUI and the INSTOOLS instrumentation service.</td>
    1119 </tr>
    1120 
    1121 
    1122 
    1123 <tr>
    1124      <td>DOI</td>
    1125      <td>10.1145/2096149.2096161</td>
    1126 </tr>
    1127 
    1128 
    1129 
    1130 <tr>
    1131      <td>URL</td>
    1132      <td><a href="http://dx.doi.org/10.1145/2096149.2096161">http://dx.doi.org/10.1145/2096149.2096161</a></td>
     1079<b class="myheading" style="position: relative; left: 5%;">Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Strum, Matt and Wong, Gary and Carpenter, Charles and Fei, Zongming and Griffioen, James and Nasir, Hussamuddin and Reed, Jeremy and Wu, Xiongqi</b>
     1080
     1081<div class="BibEntry">
     1082
     1083<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1084
     1085
     1086<tr>
     1087     <td valign="top">Author</td>
     1088     <td valign="top">Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Strum, Matt and Wong, Gary and Carpenter, Charles and Fei, Zongming and Griffioen, James and Nasir, Hussamuddin and Reed, Jeremy and Wu, Xiongqi</td>
     1089</tr>
     1090
     1091<tr>
     1092     <td valign="top">Title</td>
     1093     <td valign="top">Getting started with GENI: a user tutorial</td>
     1094</tr>
     1095
     1096<tr>
     1097     <td valign="top">Journal</td>
     1098     <td valign="top">SIGCOMM Comput. Commun. Rev.</td>
     1099</tr>
     1100
     1101<tr>
     1102     <td valign="top">Publisher</td>
     1103     <td valign="top">ACM</td>
     1104</tr>
     1105
     1106<tr>
     1107     <td valign="top">Address</td>
     1108     <td valign="top">New York, NY, USA</td>
     1109</tr>
     1110
     1111<tr>
     1112     <td valign="top">Year</td>
     1113     <td valign="top">2012</td>
     1114</tr>
     1115
     1116<tr>
     1117     <td valign="top">Abstract</td>
     1118     <td valign="top">GENI, the Global Environment for Network Innovations, is a National Science Foundation project to create a &#x76;&#x0308;irtual laboratory at the frontiers of network science and engineering for exploring future internets at scale.&#x20;&#x0308;It provides researchers, educators, and students with resources that they can use to build their own networks that span the country and - through federation - the world. GENI enables experimenters to try out bold new network architectures and designs for networked systems, and to deploy and evaluate these systems on a diverse set of resources over a large footprint. This tutorial is a starting point for running experiments on GENI. It provides an overview of GENI and covers the process of creating a network and running a simple experiment using two tools: the Flack GUI and the INSTOOLS instrumentation service.</td>
     1119</tr>
     1120
     1121
     1122
     1123<tr>
     1124     <td valign="top">DOI</td>
     1125     <td valign="top">10.1145/2096149.2096161</td>
     1126</tr>
     1127
     1128
     1129
     1130<tr>
     1131     <td valign="top">URL</td>
     1132     <td valign="top"><a href="http://dx.doi.org/10.1145/2096149.2096161">http://dx.doi.org/10.1145/2096149.2096161</a></td>
    11331133</tr>
    11341134
    … …  
    11401140
    11411141<a class="EntryGoto" id="Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Wong, Gary and Chikkulapelly, Srikanth and Seok, Woojin"></a>
    1142 <b class="myheading" style="position: relative; left: 10%;">Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Wong, Gary and Chikkulapelly, Srikanth and Seok, Woojin</b>
    1143 
    1144 <div class="BibEntry">
    1145 
    1146 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1147 
    1148 
    1149 <tr>
    1150      <td>Author</td>
    1151      <td>Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Wong, Gary and Chikkulapelly, Srikanth and Seok, Woojin</td>
    1152 </tr>
    1153 
    1154 <tr>
    1155      <td>Title</td>
    1156      <td>Designing a Federated Testbed as a Distributed System</td>
    1157 </tr>
    1158 
    1159 <tr>
    1160      <td>Journal</td>
    1161      <td>8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM 2012)</td>
    1162 </tr>
    1163 
    1164 <tr>
    1165      <td>Year</td>
    1166      <td>2012</td>
    1167 </tr>
    1168 
    1169 <tr>
    1170      <td>Abstract</td>
    1171      <td>Traditionally, testbeds for networking and systems research have been stand-alone facilities: each is owned and operated by a single administrative entity, and is intended to be used independently of other testbeds. However, this isolated facility model is at odds with researchers' ever-increasing needs for experiments at larger scale and with a broader diversity of network technologies. The research community will be much better served by a federated model. In this model, each federated testbed maintains its own autonomy and unique strengths, but all federates work together to make their resources available under a common framework. Our challenge, then, is to design a federated testbed framework that balances competing needs: We must establish trust, but at the same time maintain the autonomy of each federated facility. While providing a unified interface to a broad set of resources, we need to expose the diversity that makes them valuable. Finally, our federation should work smoothly in a coordinated fashion, but avoid central points of failure and inter-facility dependencies. We argue that treating testbed design as a federated distributed systems problem is an effective approach to achieving this balance. The technique is illustrated through the example of ProtoGENI, a system we have designed, built, and operated according to the federated model.</td>
     1142<b class="myheading" style="position: relative; left: 5%;">Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Wong, Gary and Chikkulapelly, Srikanth and Seok, Woojin</b>
     1143
     1144<div class="BibEntry">
     1145
     1146<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1147
     1148
     1149<tr>
     1150     <td valign="top">Author</td>
     1151     <td valign="top">Duerig, Jonathon and Ricci, Robert and Stoller, Leigh and Wong, Gary and Chikkulapelly, Srikanth and Seok, Woojin</td>
     1152</tr>
     1153
     1154<tr>
     1155     <td valign="top">Title</td>
     1156     <td valign="top">Designing a Federated Testbed as a Distributed System</td>
     1157</tr>
     1158
     1159<tr>
     1160     <td valign="top">Journal</td>
     1161     <td valign="top">8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM 2012)</td>
     1162</tr>
     1163
     1164<tr>
     1165     <td valign="top">Year</td>
     1166     <td valign="top">2012</td>
     1167</tr>
     1168
     1169<tr>
     1170     <td valign="top">Abstract</td>
     1171     <td valign="top">Traditionally, testbeds for networking and systems research have been stand-alone facilities: each is owned and operated by a single administrative entity, and is intended to be used independently of other testbeds. However, this isolated facility model is at odds with researchers' ever-increasing needs for experiments at larger scale and with a broader diversity of network technologies. The research community will be much better served by a federated model. In this model, each federated testbed maintains its own autonomy and unique strengths, but all federates work together to make their resources available under a common framework. Our challenge, then, is to design a federated testbed framework that balances competing needs: We must establish trust, but at the same time maintain the autonomy of each federated facility. While providing a unified interface to a broad set of resources, we need to expose the diversity that makes them valuable. Finally, our federation should work smoothly in a coordinated fashion, but avoid central points of failure and inter-facility dependencies. We argue that treating testbed design as a federated distributed systems problem is an effective approach to achieving this balance. The technique is illustrated through the example of ProtoGENI, a system we have designed, built, and operated according to the federated model.</td>
    11721172</tr>
    11731173
    … …  
    11831183
    11841184<a class="EntryGoto" id="Elliott, Chip and Falk, Aaron"></a>
    1185 <b class="myheading" style="position: relative; left: 10%;">Elliott, Chip and Falk, Aaron</b>
    1186 
    1187 <div class="BibEntry">
    1188 
    1189 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1190 
    1191 
    1192 <tr>
    1193      <td>Author</td>
    1194      <td>Elliott, Chip and Falk, Aaron</td>
    1195 </tr>
    1196 
    1197 <tr>
    1198      <td>Title</td>
    1199      <td>An update on the GENI project</td>
    1200 </tr>
    1201 
    1202 <tr>
    1203      <td>Journal</td>
    1204      <td>SIGCOMM Comput. Commun. Rev.</td>
    1205 </tr>
    1206 
    1207 <tr>
    1208      <td>Publisher</td>
    1209      <td>ACM</td>
    1210 </tr>
    1211 
    1212 <tr>
    1213      <td>Address</td>
    1214      <td>New York, NY, USA</td>
    1215 </tr>
    1216 
    1217 <tr>
    1218      <td>Year</td>
    1219      <td>2009</td>
    1220 </tr>
    1221 
    1222 <tr>
    1223      <td>Abstract</td>
    1224      <td>Environment for Network Innovations. Early prototypes of GENI are starting to come online as an end-to-end system and network researchers are invited to participate by engaging in the design process or using GENI to conduct experiments.</td>
    1225 </tr>
    1226 
    1227 
    1228 
    1229 <tr>
    1230      <td>DOI</td>
    1231      <td>10.1145/1568613.1568620</td>
    1232 </tr>
    1233 
    1234 
    1235 
    1236 <tr>
    1237      <td>URL</td>
    1238      <td><a href="http://dx.doi.org/10.1145/1568613.1568620">http://dx.doi.org/10.1145/1568613.1568620</a></td>
     1185<b class="myheading" style="position: relative; left: 5%;">Elliott, Chip and Falk, Aaron</b>
     1186
     1187<div class="BibEntry">
     1188
     1189<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1190
     1191
     1192<tr>
     1193     <td valign="top">Author</td>
     1194     <td valign="top">Elliott, Chip and Falk, Aaron</td>
     1195</tr>
     1196
     1197<tr>
     1198     <td valign="top">Title</td>
     1199     <td valign="top">An update on the GENI project</td>
     1200</tr>
     1201
     1202<tr>
     1203     <td valign="top">Journal</td>
     1204     <td valign="top">SIGCOMM Comput. Commun. Rev.</td>
     1205</tr>
     1206
     1207<tr>
     1208     <td valign="top">Publisher</td>
     1209     <td valign="top">ACM</td>
     1210</tr>
     1211
     1212<tr>
     1213     <td valign="top">Address</td>
     1214     <td valign="top">New York, NY, USA</td>
     1215</tr>
     1216
     1217<tr>
     1218     <td valign="top">Year</td>
     1219     <td valign="top">2009</td>
     1220</tr>
     1221
     1222<tr>
     1223     <td valign="top">Abstract</td>
     1224     <td valign="top">Environment for Network Innovations. Early prototypes of GENI are starting to come online as an end-to-end system and network researchers are invited to participate by engaging in the design process or using GENI to conduct experiments.</td>
     1225</tr>
     1226
     1227
     1228
     1229<tr>
     1230     <td valign="top">DOI</td>
     1231     <td valign="top">10.1145/1568613.1568620</td>
     1232</tr>
     1233
     1234
     1235
     1236<tr>
     1237     <td valign="top">URL</td>
     1238     <td valign="top"><a href="http://dx.doi.org/10.1145/1568613.1568620">http://dx.doi.org/10.1145/1568613.1568620</a></td>
    12391239</tr>
    12401240
    … …  
    12461246
    12471247<a class="EntryGoto" id="Erazo, Miguel A. and Liu, Jason"></a>
    1248 <b class="myheading" style="position: relative; left: 10%;">Erazo, Miguel A. and Liu, Jason</b>
    1249 
    1250 <div class="BibEntry">
    1251 
    1252 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1253 
    1254 
    1255 <tr>
    1256      <td>Author</td>
    1257      <td>Erazo, Miguel A. and Liu, Jason</td>
    1258 </tr>
    1259 
    1260 <tr>
    1261      <td>Title</td>
    1262      <td>On enabling real-time large-scale network simulation in GENI: the PrimoGENI approach</td>
    1263 </tr>
    1264 
    1265 <tr>
    1266      <td>Booktitle</td>
    1267      <td>Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques</td>
    1268 </tr>
    1269 
    1270 <tr>
    1271      <td>Location</td>
    1272      <td>Torremolinos, Malaga, Spain</td>
    1273 </tr>
    1274 
    1275 <tr>
    1276      <td>Publisher</td>
    1277      <td>ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)</td>
    1278 </tr>
    1279 
    1280 <tr>
    1281      <td>Address</td>
    1282      <td>ICST, Brussels, Belgium, Belgium</td>
    1283 </tr>
    1284 
    1285 <tr>
    1286      <td>Year</td>
    1287      <td>2010</td>
    1288 </tr>
    1289 
    1290 <tr>
    1291      <td>Abstract</td>
    1292      <td>The Global Environment for Network Innovations (GENI) is a community-driven research and development effort to build a collaborative and exploratory network experimentation platform, a &#x76;&#x0308;irtual laboratory&#x20;&#x0308;for the design, implementation and evaluation of future Internets. In this paper, we present an overview of PrimoGENI, a GENI project with the goal of extending the GENI suite of interoperable infrastructure to allow network experiments at scale, involving physical, simulated and emulated network entities.</td>
    1293 </tr>
    1294 
    1295 
    1296 
    1297 <tr>
    1298      <td>DOI</td>
    1299      <td>10.4108/ICST.SIMUTOOLS2010.8636</td>
    1300 </tr>
    1301 
    1302 
    1303 
    1304 <tr>
    1305      <td>URL</td>
    1306      <td><a href="http://dx.doi.org/10.4108/ICST.SIMUTOOLS2010.8636">http://dx.doi.org/10.4108/ICST.SIMUTOOLS2010.8636</a></td>
     1248<b class="myheading" style="position: relative; left: 5%;">Erazo, Miguel A. and Liu, Jason</b>
     1249
     1250<div class="BibEntry">
     1251
     1252<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1253
     1254
     1255<tr>
     1256     <td valign="top">Author</td>
     1257     <td valign="top">Erazo, Miguel A. and Liu, Jason</td>
     1258</tr>
     1259
     1260<tr>
     1261     <td valign="top">Title</td>
     1262     <td valign="top">On enabling real-time large-scale network simulation in GENI: the PrimoGENI approach</td>
     1263</tr>
     1264
     1265<tr>
     1266     <td valign="top">Booktitle</td>
     1267     <td valign="top">Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques</td>
     1268</tr>
     1269
     1270<tr>
     1271     <td valign="top">Location</td>
     1272     <td valign="top">Torremolinos, Malaga, Spain</td>
     1273</tr>
     1274
     1275<tr>
     1276     <td valign="top">Publisher</td>
     1277     <td valign="top">ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)</td>
     1278</tr>
     1279
     1280<tr>
     1281     <td valign="top">Address</td>
     1282     <td valign="top">ICST, Brussels, Belgium, Belgium</td>
     1283</tr>
     1284
     1285<tr>
     1286     <td valign="top">Year</td>
     1287     <td valign="top">2010</td>
     1288</tr>
     1289
     1290<tr>
     1291     <td valign="top">Abstract</td>
     1292     <td valign="top">The Global Environment for Network Innovations (GENI) is a community-driven research and development effort to build a collaborative and exploratory network experimentation platform, a &#x76;&#x0308;irtual laboratory&#x20;&#x0308;for the design, implementation and evaluation of future Internets. In this paper, we present an overview of PrimoGENI, a GENI project with the goal of extending the GENI suite of interoperable infrastructure to allow network experiments at scale, involving physical, simulated and emulated network entities.</td>
     1293</tr>
     1294
     1295
     1296
     1297<tr>
     1298     <td valign="top">DOI</td>
     1299     <td valign="top">10.4108/ICST.SIMUTOOLS2010.8636</td>
     1300</tr>
     1301
     1302
     1303
     1304<tr>
     1305     <td valign="top">URL</td>
     1306     <td valign="top"><a href="http://dx.doi.org/10.4108/ICST.SIMUTOOLS2010.8636">http://dx.doi.org/10.4108/ICST.SIMUTOOLS2010.8636</a></td>
    13071307</tr>
    13081308
    … …  
    13141314
    13151315<a class="EntryGoto" id="Feamster, Nick and Nayak, Ankur and Kim, Hyojoon and Clark, Russell and Mundada, Yogesh and Ramachandran, Anirudh and bin Tariq, Mukarram"></a>
    1316 <b class="myheading" style="position: relative; left: 10%;">Feamster, Nick and Nayak, Ankur and Kim, Hyojoon and Clark, Russell and Mundada, Yogesh and Ramachandran, Anirudh and bin Tariq, Mukarram</b>
    1317 
    1318 <div class="BibEntry">
    1319 
    1320 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1321 
    1322 
    1323 <tr>
    1324      <td>Author</td>
    1325      <td>Feamster, Nick and Nayak, Ankur and Kim, Hyojoon and Clark, Russell and Mundada, Yogesh and Ramachandran, Anirudh and bin Tariq, Mukarram</td>
    1326 </tr>
    1327 
    1328 <tr>
    1329      <td>Title</td>
    1330      <td>Decoupling policy from configuration in campus and enterprise networks</td>
    1331 </tr>
    1332 
    1333 <tr>
    1334      <td>Booktitle</td>
    1335      <td>2010 17th IEEE Workshop on Local &#x0026; Metropolitan Area Networks (LANMAN)</td>
    1336 </tr>
    1337 
    1338 <tr>
    1339      <td>Location</td>
    1340      <td>Long Branch, NJ, USA</td>
    1341 </tr>
    1342 
    1343 <tr>
    1344      <td>Publisher</td>
    1345      <td>IEEE</td>
    1346 </tr>
    1347 
    1348 <tr>
    1349      <td>Year</td>
    1350      <td>2010</td>
    1351 </tr>
    1352 
    1353 <tr>
    1354      <td>Abstract</td>
    1355      <td>This paper surveys our ongoing work on the use of software-defined networking to simplify two acute policy problems in campus and enterprise network operations: access control and information flow control. We describe how the current coupling of high-level policy with low-level configuration makes these problems challenging today. We describe the specific policy problems faced by campus and enterprise network operators; illustrate our approach, which leverages recent trends in separating the network's ” control plane” from the data plane; and show how this approach can be applied to simplify these two enterprise network management tasks. We also describe our ongoing deployment efforts to build a campus network testbed where trial designs can be deployed and evaluated. We close with a summary of current and future research challenges for solving challenges within enterprise networks within the context of this new paradigm.</td>
    1356 </tr>
    1357 
    1358 
    1359 
    1360 <tr>
    1361      <td>DOI</td>
    1362      <td>10.1109/LANMAN.2010.5507162</td>
    1363 </tr>
    1364 
    1365 
    1366 
    1367 <tr>
    1368      <td>URL</td>
    1369      <td><a href="http://dx.doi.org/10.1109/LANMAN.2010.5507162">http://dx.doi.org/10.1109/LANMAN.2010.5507162</a></td>
     1316<b class="myheading" style="position: relative; left: 5%;">Feamster, Nick and Nayak, Ankur and Kim, Hyojoon and Clark, Russell and Mundada, Yogesh and Ramachandran, Anirudh and bin Tariq, Mukarram</b>
     1317
     1318<div class="BibEntry">
     1319
     1320<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1321
     1322
     1323<tr>
     1324     <td valign="top">Author</td>
     1325     <td valign="top">Feamster, Nick and Nayak, Ankur and Kim, Hyojoon and Clark, Russell and Mundada, Yogesh and Ramachandran, Anirudh and bin Tariq, Mukarram</td>
     1326</tr>
     1327
     1328<tr>
     1329     <td valign="top">Title</td>
     1330     <td valign="top">Decoupling policy from configuration in campus and enterprise networks</td>
     1331</tr>
     1332
     1333<tr>
     1334     <td valign="top">Booktitle</td>
     1335     <td valign="top">2010 17th IEEE Workshop on Local &#x0026; Metropolitan Area Networks (LANMAN)</td>
     1336</tr>
     1337
     1338<tr>
     1339     <td valign="top">Location</td>
     1340     <td valign="top">Long Branch, NJ, USA</td>
     1341</tr>
     1342
     1343<tr>
     1344     <td valign="top">Publisher</td>
     1345     <td valign="top">IEEE</td>
     1346</tr>
     1347
     1348<tr>
     1349     <td valign="top">Year</td>
     1350     <td valign="top">2010</td>
     1351</tr>
     1352
     1353<tr>
     1354     <td valign="top">Abstract</td>
     1355     <td valign="top">This paper surveys our ongoing work on the use of software-defined networking to simplify two acute policy problems in campus and enterprise network operations: access control and information flow control. We describe how the current coupling of high-level policy with low-level configuration makes these problems challenging today. We describe the specific policy problems faced by campus and enterprise network operators; illustrate our approach, which leverages recent trends in separating the network's ” control plane” from the data plane; and show how this approach can be applied to simplify these two enterprise network management tasks. We also describe our ongoing deployment efforts to build a campus network testbed where trial designs can be deployed and evaluated. We close with a summary of current and future research challenges for solving challenges within enterprise networks within the context of this new paradigm.</td>
     1356</tr>
     1357
     1358
     1359
     1360<tr>
     1361     <td valign="top">DOI</td>
     1362     <td valign="top">10.1109/LANMAN.2010.5507162</td>
     1363</tr>
     1364
     1365
     1366
     1367<tr>
     1368     <td valign="top">URL</td>
     1369     <td valign="top"><a href="http://dx.doi.org/10.1109/LANMAN.2010.5507162">http://dx.doi.org/10.1109/LANMAN.2010.5507162</a></td>
    13701370</tr>
    13711371
    … …  
    13771377
    13781378<a class="EntryGoto" id="Femminella, Mauro and Francescangeli, Roberto and Reali, Gianluca and Lee, Jae W. and Schulzrinne, Henning"></a>
    1379 <b class="myheading" style="position: relative; left: 10%;">Femminella, Mauro and Francescangeli, Roberto and Reali, Gianluca and Lee, Jae W. and Schulzrinne, Henning</b>
    1380 
    1381 <div class="BibEntry">
    1382 
    1383 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1384 
    1385 
    1386 <tr>
    1387      <td>Author</td>
    1388      <td>Femminella, Mauro and Francescangeli, Roberto and Reali, Gianluca and Lee, Jae W. and Schulzrinne, Henning</td>
    1389 </tr>
    1390 
    1391 <tr>
    1392      <td>Title</td>
    1393      <td>An enabling platform for autonomic management of the future internet</td>
    1394 </tr>
    1395 
    1396 <tr>
    1397      <td>Journal</td>
    1398      <td>IEEE Network</td>
    1399 </tr>
    1400 
    1401 <tr>
    1402      <td>Year</td>
    1403      <td>2011</td>
    1404 </tr>
    1405 
    1406 <tr>
    1407      <td>Abstract</td>
    1408      <td>This article shows an autonomic management solution based on the recently defined programmable node architecture NetServ. The article starts with a general description of the classical network management requirements and their adaptation to the expected network evolution. After a description of the major issues characterizing the management of the expected Future Internet, the main autonomic management paradigms, and some recently introduced autonomic service platforms, we show and demonstrate the effectiveness of the NetServ architecture. Born as a means to deploy and execute networked services at runtime over programmable routers, NetServ has proved to be a suitable environment for hosting an autonomic management architecture.</td>
    1409 </tr>
    1410 
    1411 
    1412 
    1413 <tr>
    1414      <td>DOI</td>
    1415      <td>10.1109/MNET.2011.6085639</td>
    1416 </tr>
    1417 
    1418 
    1419 
    1420 <tr>
    1421      <td>URL</td>
    1422      <td><a href="http://dx.doi.org/10.1109/MNET.2011.6085639">http://dx.doi.org/10.1109/MNET.2011.6085639</a></td>
     1379<b class="myheading" style="position: relative; left: 5%;">Femminella, Mauro and Francescangeli, Roberto and Reali, Gianluca and Lee, Jae W. and Schulzrinne, Henning</b>
     1380
     1381<div class="BibEntry">
     1382
     1383<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1384
     1385
     1386<tr>
     1387     <td valign="top">Author</td>
     1388     <td valign="top">Femminella, Mauro and Francescangeli, Roberto and Reali, Gianluca and Lee, Jae W. and Schulzrinne, Henning</td>
     1389</tr>
     1390
     1391<tr>
     1392     <td valign="top">Title</td>
     1393     <td valign="top">An enabling platform for autonomic management of the future internet</td>
     1394</tr>
     1395
     1396<tr>
     1397     <td valign="top">Journal</td>
     1398     <td valign="top">IEEE Network</td>
     1399</tr>
     1400
     1401<tr>
     1402     <td valign="top">Year</td>
     1403     <td valign="top">2011</td>
     1404</tr>
     1405
     1406<tr>
     1407     <td valign="top">Abstract</td>
     1408     <td valign="top">This article shows an autonomic management solution based on the recently defined programmable node architecture NetServ. The article starts with a general description of the classical network management requirements and their adaptation to the expected network evolution. After a description of the major issues characterizing the management of the expected Future Internet, the main autonomic management paradigms, and some recently introduced autonomic service platforms, we show and demonstrate the effectiveness of the NetServ architecture. Born as a means to deploy and execute networked services at runtime over programmable routers, NetServ has proved to be a suitable environment for hosting an autonomic management architecture.</td>
     1409</tr>
     1410
     1411
     1412
     1413<tr>
     1414     <td valign="top">DOI</td>
     1415     <td valign="top">10.1109/MNET.2011.6085639</td>
     1416</tr>
     1417
     1418
     1419
     1420<tr>
     1421     <td valign="top">URL</td>
     1422     <td valign="top"><a href="http://dx.doi.org/10.1109/MNET.2011.6085639">http://dx.doi.org/10.1109/MNET.2011.6085639</a></td>
    14231423</tr>
    14241424
    … …  
    14301430
    14311431<a class="EntryGoto" id="Gangam, Sriharsha and Blanton, Ethan and Fahmy, Sonia"></a>
    1432 <b class="myheading" style="position: relative; left: 10%;">Gangam, Sriharsha and Blanton, Ethan and Fahmy, Sonia</b>
    1433 
    1434 <div class="BibEntry">
    1435 
    1436 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1437 
    1438 
    1439 <tr>
    1440      <td>Author</td>
    1441      <td>Gangam, Sriharsha and Blanton, Ethan and Fahmy, Sonia</td>
    1442 </tr>
    1443 
    1444 <tr>
    1445      <td>Title</td>
    1446      <td>Exercises for Graduate Students using GENI</td>
    1447 </tr>
    1448 
    1449 <tr>
    1450      <td>Booktitle</td>
    1451      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    1452 </tr>
    1453 
    1454 <tr>
    1455      <td>Location</td>
    1456      <td>Los Angeles</td>
    1457 </tr>
    1458 
    1459 <tr>
    1460      <td>Year</td>
    1461      <td>2012</td>
    1462 </tr>
    1463 
    1464 <tr>
    1465      <td>Abstract</td>
    1466      <td>GENI brings together a wide variety of heterogeneous networking infrastructure and technologies under a common platform. We propose programming exercises for graduate students to introduce GENI and enable students to conduct high fidelity networking experiments. In this paper, we focus on an exercise to study congestion control and reliability using the ProtoGENI aggregate. A planned second exercise aims to leverage GENI OpenFlow aggregates to study firewalls and QoS mechanisms. We believe that these lab exercises will expose students to key networking concepts and recent research directions, e.g., in the data center context.</td>
     1432<b class="myheading" style="position: relative; left: 5%;">Gangam, Sriharsha and Blanton, Ethan and Fahmy, Sonia</b>
     1433
     1434<div class="BibEntry">
     1435
     1436<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1437
     1438
     1439<tr>
     1440     <td valign="top">Author</td>
     1441     <td valign="top">Gangam, Sriharsha and Blanton, Ethan and Fahmy, Sonia</td>
     1442</tr>
     1443
     1444<tr>
     1445     <td valign="top">Title</td>
     1446     <td valign="top">Exercises for Graduate Students using GENI</td>
     1447</tr>
     1448
     1449<tr>
     1450     <td valign="top">Booktitle</td>
     1451     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     1452</tr>
     1453
     1454<tr>
     1455     <td valign="top">Location</td>
     1456     <td valign="top">Los Angeles</td>
     1457</tr>
     1458
     1459<tr>
     1460     <td valign="top">Year</td>
     1461     <td valign="top">2012</td>
     1462</tr>
     1463
     1464<tr>
     1465     <td valign="top">Abstract</td>
     1466     <td valign="top">GENI brings together a wide variety of heterogeneous networking infrastructure and technologies under a common platform. We propose programming exercises for graduate students to introduce GENI and enable students to conduct high fidelity networking experiments. In this paper, we focus on an exercise to study congestion control and reliability using the ProtoGENI aggregate. A planned second exercise aims to leverage GENI OpenFlow aggregates to study firewalls and QoS mechanisms. We believe that these lab exercises will expose students to key networking concepts and recent research directions, e.g., in the data center context.</td>
    14671467</tr>
    14681468
    … …  
    14781478
    14791479<a class="EntryGoto" id="Gangam, Sriharsha and Fahmy, Sonia"></a>
    1480 <b class="myheading" style="position: relative; left: 10%;">Gangam, Sriharsha and Fahmy, Sonia</b>
    1481 
    1482 <div class="BibEntry">
    1483 
    1484 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1485 
    1486 
    1487 <tr>
    1488      <td>Author</td>
    1489      <td>Gangam, Sriharsha and Fahmy, Sonia</td>
    1490 </tr>
    1491 
    1492 <tr>
    1493      <td>Title</td>
    1494      <td>Mitigating interference in a network measurement service</td>
    1495 </tr>
    1496 
    1497 <tr>
    1498      <td>Booktitle</td>
    1499      <td>2011 IEEE Nineteenth IEEE International Workshop on Quality of Service</td>
    1500 </tr>
    1501 
    1502 <tr>
    1503      <td>Location</td>
    1504      <td>San Jose, CA, USA</td>
    1505 </tr>
    1506 
    1507 <tr>
    1508      <td>Publisher</td>
    1509      <td>IEEE</td>
    1510 </tr>
    1511 
    1512 <tr>
    1513      <td>Year</td>
    1514      <td>2011</td>
    1515 </tr>
    1516 
    1517 <tr>
    1518      <td>Abstract</td>
    1519      <td>Shared measurement services offer key advantages over conventional ad-hoc techniques for network monitoring. A measurement service may receive measurement requests concurrently from different applications and network administrators. These measurement requests are often served by injecting active network measurement traffic between two hosts. Two active measurements are said to interfere when the probe packets of one measurement tool are viewed as network traffic by the other. This may lead to faulty measurement readings. In this paper, we model the measurement interference problem, and show how to schedule measurement tasks to reduce interference and hence increase measurement accuracy. We propose twelve computationally tractable algorithms that decrease the total completion time (makespan) of measurement tasks, while avoiding interference. Our evaluation shows that the algorithm we refer to as Largest Area First, Busiest Node First - Earliest Interval Schedule (LAFBNF-EIS) has a mean makespan of about 5&#x0025; more than the theoretical lower bound over our set of measurement workloads.</td>
    1520 </tr>
    1521 
    1522 
    1523 
    1524 <tr>
    1525      <td>DOI</td>
    1526      <td>10.1109/IWQOS.2011.5931347</td>
    1527 </tr>
    1528 
    1529 
    1530 
    1531 <tr>
    1532      <td>URL</td>
    1533      <td><a href="http://dx.doi.org/10.1109/IWQOS.2011.5931347">http://dx.doi.org/10.1109/IWQOS.2011.5931347</a></td>
     1480<b class="myheading" style="position: relative; left: 5%;">Gangam, Sriharsha and Fahmy, Sonia</b>
     1481
     1482<div class="BibEntry">
     1483
     1484<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1485
     1486
     1487<tr>
     1488     <td valign="top">Author</td>
     1489     <td valign="top">Gangam, Sriharsha and Fahmy, Sonia</td>
     1490</tr>
     1491
     1492<tr>
     1493     <td valign="top">Title</td>
     1494     <td valign="top">Mitigating interference in a network measurement service</td>
     1495</tr>
     1496
     1497<tr>
     1498     <td valign="top">Booktitle</td>
     1499     <td valign="top">2011 IEEE Nineteenth IEEE International Workshop on Quality of Service</td>
     1500</tr>
     1501
     1502<tr>
     1503     <td valign="top">Location</td>
     1504     <td valign="top">San Jose, CA, USA</td>
     1505</tr>
     1506
     1507<tr>
     1508     <td valign="top">Publisher</td>
     1509     <td valign="top">IEEE</td>
     1510</tr>
     1511
     1512<tr>
     1513     <td valign="top">Year</td>
     1514     <td valign="top">2011</td>
     1515</tr>
     1516
     1517<tr>
     1518     <td valign="top">Abstract</td>
     1519     <td valign="top">Shared measurement services offer key advantages over conventional ad-hoc techniques for network monitoring. A measurement service may receive measurement requests concurrently from different applications and network administrators. These measurement requests are often served by injecting active network measurement traffic between two hosts. Two active measurements are said to interfere when the probe packets of one measurement tool are viewed as network traffic by the other. This may lead to faulty measurement readings. In this paper, we model the measurement interference problem, and show how to schedule measurement tasks to reduce interference and hence increase measurement accuracy. We propose twelve computationally tractable algorithms that decrease the total completion time (makespan) of measurement tasks, while avoiding interference. Our evaluation shows that the algorithm we refer to as Largest Area First, Busiest Node First - Earliest Interval Schedule (LAFBNF-EIS) has a mean makespan of about 5&#x0025; more than the theoretical lower bound over our set of measurement workloads.</td>
     1520</tr>
     1521
     1522
     1523
     1524<tr>
     1525     <td valign="top">DOI</td>
     1526     <td valign="top">10.1109/IWQOS.2011.5931347</td>
     1527</tr>
     1528
     1529
     1530
     1531<tr>
     1532     <td valign="top">URL</td>
     1533     <td valign="top"><a href="http://dx.doi.org/10.1109/IWQOS.2011.5931347">http://dx.doi.org/10.1109/IWQOS.2011.5931347</a></td>
    15341534</tr>
    15351535
    … …  
    15411541
    15421542<a class="EntryGoto" id="Gao, Jingcheng and Xiao, Yang"></a>
    1543 <b class="myheading" style="position: relative; left: 10%;">Gao, Jingcheng and Xiao, Yang</b>
    1544 
    1545 <div class="BibEntry">
    1546 
    1547 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1548 
    1549 
    1550 <tr>
    1551      <td>Author</td>
    1552      <td>Gao, Jingcheng and Xiao, Yang</td>
    1553 </tr>
    1554 
    1555 <tr>
    1556      <td>Title</td>
    1557      <td>ProtoGENI DoS/DDoS Security Tests and Experiments</td>
    1558 </tr>
    1559 
    1560 <tr>
    1561      <td>Booktitle</td>
    1562      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    1563 </tr>
    1564 
    1565 <tr>
    1566      <td>Location</td>
    1567      <td>Los Angeles</td>
    1568 </tr>
    1569 
    1570 <tr>
    1571      <td>Year</td>
    1572      <td>2012</td>
    1573 </tr>
    1574 
    1575 <tr>
    1576      <td>Abstract</td>
    1577      <td>his paper will explain some tests and experiments to investigate selected security issues through ProtoGENI mainly during Spiral 3 time period and the beginning of Spiral 4. In this paper, we conduct multiple sets of DoS/ DDoS attacks in the current ProtoGENI testbed. These attacks show that it is very possible that ProtoGENI nodes may render vulnerabilities to such attacks.</td>
     1543<b class="myheading" style="position: relative; left: 5%;">Gao, Jingcheng and Xiao, Yang</b>
     1544
     1545<div class="BibEntry">
     1546
     1547<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1548
     1549
     1550<tr>
     1551     <td valign="top">Author</td>
     1552     <td valign="top">Gao, Jingcheng and Xiao, Yang</td>
     1553</tr>
     1554
     1555<tr>
     1556     <td valign="top">Title</td>
     1557     <td valign="top">ProtoGENI DoS/DDoS Security Tests and Experiments</td>
     1558</tr>
     1559
     1560<tr>
     1561     <td valign="top">Booktitle</td>
     1562     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     1563</tr>
     1564
     1565<tr>
     1566     <td valign="top">Location</td>
     1567     <td valign="top">Los Angeles</td>
     1568</tr>
     1569
     1570<tr>
     1571     <td valign="top">Year</td>
     1572     <td valign="top">2012</td>
     1573</tr>
     1574
     1575<tr>
     1576     <td valign="top">Abstract</td>
     1577     <td valign="top">his paper will explain some tests and experiments to investigate selected security issues through ProtoGENI mainly during Spiral 3 time period and the beginning of Spiral 4. In this paper, we conduct multiple sets of DoS/ DDoS attacks in the current ProtoGENI testbed. These attacks show that it is very possible that ProtoGENI nodes may render vulnerabilities to such attacks.</td>
    15781578</tr>
    15791579
    … …  
    15891589
    15901590<a class="EntryGoto" id="Gember, Aaron and Dragga, Chris and Akella, Aditya"></a>
    1591 <b class="myheading" style="position: relative; left: 10%;">Gember, Aaron and Dragga, Chris and Akella, Aditya</b>
    1592 
    1593 <div class="BibEntry">
    1594 
    1595 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1596 
    1597 
    1598 <tr>
    1599      <td>Author</td>
    1600      <td>Gember, Aaron and Dragga, Chris and Akella, Aditya</td>
    1601 </tr>
    1602 
    1603 <tr>
    1604      <td>Title</td>
    1605      <td>ECOS: Practical Mobile Application Offloading for Enterprises</td>
    1606 </tr>
    1607 
    1608 <tr>
    1609      <td>Booktitle</td>
    1610      <td>2nd USENIX Workshop on Hot Topics in Management of Internet, Cloud, and Enterprise Networks and Services (Hot-ICE '12)</td>
    1611 </tr>
    1612 
    1613 <tr>
    1614      <td>Year</td>
    1615      <td>2012</td>
    1616 </tr>
    1617 
    1618 <tr>
    1619      <td>Abstract</td>
    1620      <td>Offloading has emerged as a promising idea to allow handheld devices to access intensive applications without performance or energy costs. This could be particularly useful for enterprises seeking to run line-of-business applications on handhelds. However, we must address two practical roadblocks in order to make offloading amenable for enterprises: (i) ensuring data privacy and the use of trusted offloading resources, and (ii) accommodating offload at scale with diverse handheld objectives and compute resource capabilities. We present the design and implementation of an Enterprise-Centric Offloading System (ECOS) which augments prior offloading proposals to address these issues. ECOS uses a logically central controller to opportunistically leverage diverse compute resources, while tightly controlling where specific applications offload depending on privacy, performance, and energy constraints of users and applications. A wide range of experiments using a real prototype establish the effectiveness of our approach.</td>
    1621 </tr>
    1622 
    1623 
    1624 
    1625 
    1626 
    1627 <tr>
    1628      <td>URL</td>
    1629      <td><a href="http://www.usenix.org/conference/hot-ice12/ecos-practical-mobile-application-of&#x0025;EF&#x0025;AC&#x0025;82oading-enterprises">http://www.usenix.org/conference/hot-ice12/ecos-practical-mobile-application-of&#x0025;EF&#x0025;AC&#x0025;82oading-enterprises</a></td>
     1591<b class="myheading" style="position: relative; left: 5%;">Gember, Aaron and Dragga, Chris and Akella, Aditya</b>
     1592
     1593<div class="BibEntry">
     1594
     1595<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1596
     1597
     1598<tr>
     1599     <td valign="top">Author</td>
     1600     <td valign="top">Gember, Aaron and Dragga, Chris and Akella, Aditya</td>
     1601</tr>
     1602
     1603<tr>
     1604     <td valign="top">Title</td>
     1605     <td valign="top">ECOS: Practical Mobile Application Offloading for Enterprises</td>
     1606</tr>
     1607
     1608<tr>
     1609     <td valign="top">Booktitle</td>
     1610     <td valign="top">2nd USENIX Workshop on Hot Topics in Management of Internet, Cloud, and Enterprise Networks and Services (Hot-ICE '12)</td>
     1611</tr>
     1612
     1613<tr>
     1614     <td valign="top">Year</td>
     1615     <td valign="top">2012</td>
     1616</tr>
     1617
     1618<tr>
     1619     <td valign="top">Abstract</td>
     1620     <td valign="top">Offloading has emerged as a promising idea to allow handheld devices to access intensive applications without performance or energy costs. This could be particularly useful for enterprises seeking to run line-of-business applications on handhelds. However, we must address two practical roadblocks in order to make offloading amenable for enterprises: (i) ensuring data privacy and the use of trusted offloading resources, and (ii) accommodating offload at scale with diverse handheld objectives and compute resource capabilities. We present the design and implementation of an Enterprise-Centric Offloading System (ECOS) which augments prior offloading proposals to address these issues. ECOS uses a logically central controller to opportunistically leverage diverse compute resources, while tightly controlling where specific applications offload depending on privacy, performance, and energy constraints of users and applications. A wide range of experiments using a real prototype establish the effectiveness of our approach.</td>
     1621</tr>
     1622
     1623
     1624
     1625
     1626
     1627<tr>
     1628     <td valign="top">URL</td>
     1629     <td valign="top"><a href="http://www.usenix.org/conference/hot-ice12/ecos-practical-mobile-application-of&#x0025;EF&#x0025;AC&#x0025;82oading-enterprises">http://www.usenix.org/conference/hot-ice12/ecos-practical-mobile-application-of&#x0025;EF&#x0025;AC&#x0025;82oading-enterprises</a></td>
     1630</tr>
     1631
     1632
     1633</table></div><br><br>
     1634
     1635
     1636
     1637
     1638<a class="EntryGoto" id="Grandl, Robert and Han, Dongsu and Lee, Suk B. and Lim, Hyeontaek and Machado, Michel and Mukerjee, Matthew and Naylor, David"></a>
     1639<b class="myheading" style="position: relative; left: 5%;">Grandl, Robert and Han, Dongsu and Lee, Suk B. and Lim, Hyeontaek and Machado, Michel and Mukerjee, Matthew and Naylor, David</b>
     1640
     1641<div class="BibEntry">
     1642
     1643<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1644
     1645
     1646<tr>
     1647     <td valign="top">Author</td>
     1648     <td valign="top">Grandl, Robert and Han, Dongsu and Lee, Suk B. and Lim, Hyeontaek and Machado, Michel and Mukerjee, Matthew and Naylor, David</td>
     1649</tr>
     1650
     1651<tr>
     1652     <td valign="top">Title</td>
     1653     <td valign="top">Supporting network evolution and incremental deployment with XIA</td>
     1654</tr>
     1655
     1656<tr>
     1657     <td valign="top">Booktitle</td>
     1658     <td valign="top">Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication</td>
     1659</tr>
     1660
     1661<tr>
     1662     <td valign="top">Location</td>
     1663     <td valign="top">Helsinki, Finland</td>
     1664</tr>
     1665
     1666<tr>
     1667     <td valign="top">Publisher</td>
     1668     <td valign="top">ACM</td>
     1669</tr>
     1670
     1671<tr>
     1672     <td valign="top">Address</td>
     1673     <td valign="top">New York, NY, USA</td>
     1674</tr>
     1675
     1676<tr>
     1677     <td valign="top">Year</td>
     1678     <td valign="top">2012</td>
     1679</tr>
     1680
     1681<tr>
     1682     <td valign="top">Abstract</td>
     1683     <td valign="top">eXpressive Internet Architecture (XIA) [1] is an architecture that natively supports multiple communication types and allows networks to evolve their abstractions and functionality to accommodate new styles of communication over time. XIA embeds an elegant mechanism for handling unforeseen communication types for legacy routers. In this demonstration, we show that XIA overcomes three key barriers in network evolution (outlined below) by (1) allowing end-hosts and applications to start using new communication types (e.g., service and content) before the network supports them, (2) ensuring that upgrading a subset of routers to support new functionalities immediately benefits applications, and (3) using the same mechanisms we employ for 1 and 2 to incrementally deploy XIA in IP networks.</td>
     1684</tr>
     1685
     1686
     1687
     1688<tr>
     1689     <td valign="top">DOI</td>
     1690     <td valign="top">10.1145/2342356.2342410</td>
     1691</tr>
     1692
     1693
     1694
     1695<tr>
     1696     <td valign="top">URL</td>
     1697     <td valign="top"><a href="http://dx.doi.org/10.1145/2342356.2342410">http://dx.doi.org/10.1145/2342356.2342410</a></td>
    16301698</tr>
    16311699
    … …  
    16371705
    16381706<a class="EntryGoto" id="Griffioen, J. and Fei, Zongming and Nasir, H. and Wu, Xiongqi and Reed, J. and Carpenter, C."></a>
    1639 <b class="myheading" style="position: relative; left: 10%;">Griffioen, J. and Fei, Zongming and Nasir, H. and Wu, Xiongqi and Reed, J. and Carpenter, C.</b>
    1640 
    1641 <div class="BibEntry">
    1642 
    1643 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1644 
    1645 
    1646 <tr>
    1647      <td>Author</td>
    1648      <td>Griffioen, J. and Fei, Zongming and Nasir, H. and Wu, Xiongqi and Reed, J. and Carpenter, C.</td>
    1649 </tr>
    1650 
    1651 <tr>
    1652      <td>Title</td>
    1653      <td>The design of an instrumentation system for federated and virtualized network testbeds</td>
    1654 </tr>
    1655 
    1656 <tr>
    1657      <td>Booktitle</td>
    1658      <td>Network Operations and Management Symposium (NOMS), 2012 IEEE</td>
    1659 </tr>
    1660 
    1661 <tr>
    1662      <td>Publisher</td>
    1663      <td>IEEE</td>
    1664 </tr>
    1665 
    1666 <tr>
    1667      <td>Year</td>
    1668      <td>2012</td>
    1669 </tr>
    1670 
    1671 <tr>
    1672      <td>Abstract</td>
    1673      <td>Much of the GENI effort in developing network testbeds has been focused on building the control frameworks needed to allocate and initialize the network resources that make up an experiment. We argue that building the instrumentation and measurement system to monitor and capture the behavior of the network is just as important and challenging as setting up the network itself, especially in a virtualized and federated environment where getting information from experimental nodes is too complicated and too much to handle for a typical user. In this paper, we describe the design of an instrumentation and measurement infrastructure that allows users to monitor their experiments. The challenge that virtualization and federation of GENI testbeds bring to instrumentation and monitoring is how to hide the details of instrumentation setup from users so that users do not need to be experts in system administration or network management of virtualized and federated systems, but are still able to ” see” what is going on with their experiments. Our instrumentation tool sets up experiment-specific monitoring infrastructure that is tailored to capture, record, and display only information associated with that experiment. Our tools are currently available in GENI, and we present a simple example of how to use them to instrument an experiment.</td>
    1674 </tr>
    1675 
    1676 
    1677 
    1678 <tr>
    1679      <td>DOI</td>
    1680      <td>10.1109/NOMS.2012.6212061</td>
    1681 </tr>
    1682 
    1683 
    1684 
    1685 <tr>
    1686      <td>URL</td>
    1687      <td><a href="http://dx.doi.org/10.1109/NOMS.2012.6212061">http://dx.doi.org/10.1109/NOMS.2012.6212061</a></td>
     1707<b class="myheading" style="position: relative; left: 5%;">Griffioen, J. and Fei, Zongming and Nasir, H. and Wu, Xiongqi and Reed, J. and Carpenter, C.</b>
     1708
     1709<div class="BibEntry">
     1710
     1711<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1712
     1713
     1714<tr>
     1715     <td valign="top">Author</td>
     1716     <td valign="top">Griffioen, J. and Fei, Zongming and Nasir, H. and Wu, Xiongqi and Reed, J. and Carpenter, C.</td>
     1717</tr>
     1718
     1719<tr>
     1720     <td valign="top">Title</td>
     1721     <td valign="top">The design of an instrumentation system for federated and virtualized network testbeds</td>
     1722</tr>
     1723
     1724<tr>
     1725     <td valign="top">Booktitle</td>
     1726     <td valign="top">Network Operations and Management Symposium (NOMS), 2012 IEEE</td>
     1727</tr>
     1728
     1729<tr>
     1730     <td valign="top">Publisher</td>
     1731     <td valign="top">IEEE</td>
     1732</tr>
     1733
     1734<tr>
     1735     <td valign="top">Year</td>
     1736     <td valign="top">2012</td>
     1737</tr>
     1738
     1739<tr>
     1740     <td valign="top">Abstract</td>
     1741     <td valign="top">Much of the GENI effort in developing network testbeds has been focused on building the control frameworks needed to allocate and initialize the network resources that make up an experiment. We argue that building the instrumentation and measurement system to monitor and capture the behavior of the network is just as important and challenging as setting up the network itself, especially in a virtualized and federated environment where getting information from experimental nodes is too complicated and too much to handle for a typical user. In this paper, we describe the design of an instrumentation and measurement infrastructure that allows users to monitor their experiments. The challenge that virtualization and federation of GENI testbeds bring to instrumentation and monitoring is how to hide the details of instrumentation setup from users so that users do not need to be experts in system administration or network management of virtualized and federated systems, but are still able to ” see” what is going on with their experiments. Our instrumentation tool sets up experiment-specific monitoring infrastructure that is tailored to capture, record, and display only information associated with that experiment. Our tools are currently available in GENI, and we present a simple example of how to use them to instrument an experiment.</td>
     1742</tr>
     1743
     1744
     1745
     1746<tr>
     1747     <td valign="top">DOI</td>
     1748     <td valign="top">10.1109/NOMS.2012.6212061</td>
     1749</tr>
     1750
     1751
     1752
     1753<tr>
     1754     <td valign="top">URL</td>
     1755     <td valign="top"><a href="http://dx.doi.org/10.1109/NOMS.2012.6212061">http://dx.doi.org/10.1109/NOMS.2012.6212061</a></td>
    16881756</tr>
    16891757
    … …  
    16951763
    16961764<a class="EntryGoto" id="Griffioen, James and Fei, Zongming and Nasir, Hussanmuddin and Wu, Xiongqi and Reed, Jeremy and Carpenter, Charles"></a>
    1697 <b class="myheading" style="position: relative; left: 10%;">Griffioen, James and Fei, Zongming and Nasir, Hussanmuddin and Wu, Xiongqi and Reed, Jeremy and Carpenter, Charles</b>
    1698 
    1699 <div class="BibEntry">
    1700 
    1701 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1702 
    1703 
    1704 <tr>
    1705      <td>Author</td>
    1706      <td>Griffioen, James and Fei, Zongming and Nasir, Hussanmuddin and Wu, Xiongqi and Reed, Jeremy and Carpenter, Charles</td>
    1707 </tr>
    1708 
    1709 <tr>
    1710      <td>Title</td>
    1711      <td>Teaching with the Emerging GENI Network</td>
    1712 </tr>
    1713 
    1714 <tr>
    1715      <td>Booktitle</td>
    1716      <td>Proceedings of the 2012 International Conference on Frontiers in Education: Computer Science and Computer Engineering (FECS)</td>
    1717 </tr>
    1718 
    1719 <tr>
    1720      <td>Location</td>
    1721      <td>Las Vegas</td>
    1722 </tr>
    1723 
    1724 <tr>
    1725      <td>Year</td>
    1726      <td>2012</td>
     1765<b class="myheading" style="position: relative; left: 5%;">Griffioen, James and Fei, Zongming and Nasir, Hussanmuddin and Wu, Xiongqi and Reed, Jeremy and Carpenter, Charles</b>
     1766
     1767<div class="BibEntry">
     1768
     1769<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1770
     1771
     1772<tr>
     1773     <td valign="top">Author</td>
     1774     <td valign="top">Griffioen, James and Fei, Zongming and Nasir, Hussanmuddin and Wu, Xiongqi and Reed, Jeremy and Carpenter, Charles</td>
     1775</tr>
     1776
     1777<tr>
     1778     <td valign="top">Title</td>
     1779     <td valign="top">Teaching with the Emerging GENI Network</td>
     1780</tr>
     1781
     1782<tr>
     1783     <td valign="top">Booktitle</td>
     1784     <td valign="top">Proceedings of the 2012 International Conference on Frontiers in Education: Computer Science and Computer Engineering (FECS)</td>
     1785</tr>
     1786
     1787<tr>
     1788     <td valign="top">Location</td>
     1789     <td valign="top">Las Vegas</td>
     1790</tr>
     1791
     1792<tr>
     1793     <td valign="top">Year</td>
     1794     <td valign="top">2012</td>
    17271795</tr>
    17281796
    … …  
    17381806
    17391807<a class="EntryGoto" id="Herron, Jon-Paul"></a>
    1740 <b class="myheading" style="position: relative; left: 10%;">Herron, Jon-Paul</b>
    1741 
    1742 <div class="BibEntry">
    1743 
    1744 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1745 
    1746 
    1747 <tr>
    1748      <td>Author</td>
    1749      <td>Herron, Jon-Paul</td>
    1750 </tr>
    1751 
    1752 <tr>
    1753      <td>Title</td>
    1754      <td>GENI Meta-Operations Center</td>
    1755 </tr>
    1756 
    1757 <tr>
    1758      <td>Booktitle</td>
    1759      <td>2008 IEEE Fourth International Conference on eScience</td>
    1760 </tr>
    1761 
    1762 <tr>
    1763      <td>Location</td>
    1764      <td>Indianapolis, IN, USA</td>
    1765 </tr>
    1766 
    1767 <tr>
    1768      <td>Publisher</td>
    1769      <td>IEEE</td>
    1770 </tr>
    1771 
    1772 <tr>
    1773      <td>Year</td>
    1774      <td>2008</td>
    1775 </tr>
    1776 
    1777 <tr>
    1778      <td>Abstract</td>
    1779      <td>NSF's GENI program represents an opportunity to build the kind of programmable, virtualized testbed scientists exploring the future of networking will need to support their research. As with any other scientific instrument, it will be crucial that the GENI infrastructure offer repeatable, consistent results to the researchers using it.The GENI Meta-Operations Center, operated by the Global Research NOC at Indiana University, will develop the software, protocols, and processes needed to ensure the repeatability, consistency, and efficiency of GENI.</td>
    1780 </tr>
    1781 
    1782 
    1783 
    1784 <tr>
    1785      <td>DOI</td>
    1786      <td>10.1109/eScience.2008.103</td>
    1787 </tr>
    1788 
    1789 
    1790 
    1791 <tr>
    1792      <td>URL</td>
    1793      <td><a href="http://dx.doi.org/10.1109/eScience.2008.103">http://dx.doi.org/10.1109/eScience.2008.103</a></td>
     1808<b class="myheading" style="position: relative; left: 5%;">Herron, Jon-Paul</b>
     1809
     1810<div class="BibEntry">
     1811
     1812<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1813
     1814
     1815<tr>
     1816     <td valign="top">Author</td>
     1817     <td valign="top">Herron, Jon-Paul</td>
     1818</tr>
     1819
     1820<tr>
     1821     <td valign="top">Title</td>
     1822     <td valign="top">GENI Meta-Operations Center</td>
     1823</tr>
     1824
     1825<tr>
     1826     <td valign="top">Booktitle</td>
     1827     <td valign="top">2008 IEEE Fourth International Conference on eScience</td>
     1828</tr>
     1829
     1830<tr>
     1831     <td valign="top">Location</td>
     1832     <td valign="top">Indianapolis, IN, USA</td>
     1833</tr>
     1834
     1835<tr>
     1836     <td valign="top">Publisher</td>
     1837     <td valign="top">IEEE</td>
     1838</tr>
     1839
     1840<tr>
     1841     <td valign="top">Year</td>
     1842     <td valign="top">2008</td>
     1843</tr>
     1844
     1845<tr>
     1846     <td valign="top">Abstract</td>
     1847     <td valign="top">NSF's GENI program represents an opportunity to build the kind of programmable, virtualized testbed scientists exploring the future of networking will need to support their research. As with any other scientific instrument, it will be crucial that the GENI infrastructure offer repeatable, consistent results to the researchers using it.The GENI Meta-Operations Center, operated by the Global Research NOC at Indiana University, will develop the software, protocols, and processes needed to ensure the repeatability, consistency, and efficiency of GENI.</td>
     1848</tr>
     1849
     1850
     1851
     1852<tr>
     1853     <td valign="top">DOI</td>
     1854     <td valign="top">10.1109/eScience.2008.103</td>
     1855</tr>
     1856
     1857
     1858
     1859<tr>
     1860     <td valign="top">URL</td>
     1861     <td valign="top"><a href="http://dx.doi.org/10.1109/eScience.2008.103">http://dx.doi.org/10.1109/eScience.2008.103</a></td>
    17941862</tr>
    17951863
    … …  
    18011869
    18021870<a class="EntryGoto" id="Ju, Xi and Zhang, Hongwei and Zeng, Wenjie and Sridharan, Mukundan and Li, Jing and Arora, Anish and Ramnath, Rajiv and Xin, Yufeng"></a>
    1803 <b class="myheading" style="position: relative; left: 10%;">Ju, Xi and Zhang, Hongwei and Zeng, Wenjie and Sridharan, Mukundan and Li, Jing and Arora, Anish and Ramnath, Rajiv and Xin, Yufeng</b>
    1804 
    1805 <div class="BibEntry">
    1806 
    1807 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1808 
    1809 
    1810 <tr>
    1811      <td>Author</td>
    1812      <td>Ju, Xi and Zhang, Hongwei and Zeng, Wenjie and Sridharan, Mukundan and Li, Jing and Arora, Anish and Ramnath, Rajiv and Xin, Yufeng</td>
    1813 </tr>
    1814 
    1815 <tr>
    1816      <td>Title</td>
    1817      <td>LENS: resource specification for wireless sensor network experimentation infrastructures</td>
    1818 </tr>
    1819 
    1820 <tr>
    1821      <td>Booktitle</td>
    1822      <td>Proceedings of the 6th ACM international workshop on Wireless network testbeds, experimental evaluation and characterization</td>
    1823 </tr>
    1824 
    1825 <tr>
    1826      <td>Location</td>
    1827      <td>Las Vegas, Nevada, USA</td>
    1828 </tr>
    1829 
    1830 <tr>
    1831      <td>Publisher</td>
    1832      <td>ACM</td>
    1833 </tr>
    1834 
    1835 <tr>
    1836      <td>Address</td>
    1837      <td>New York, NY, USA</td>
    1838 </tr>
    1839 
    1840 <tr>
    1841      <td>Year</td>
    1842      <td>2011</td>
    1843 </tr>
    1844 
    1845 <tr>
    1846      <td>Abstract</td>
    1847      <td>As a first step towards predictable, repeatable WSN experimentation, we propose the resource specification language LENS (a.k.a. Language for Embedded Networked Sensing) for WSN experimentation infrastructures. Using the Resource Description Framework (RDF) and the Web Ontology Language (OWL), LENS defines a semantic ontology for WSN resources; LENS enables explicit control and measurement of uncertainty factors, and it enables reasoning about the relationships between WSN resources. Focusing on basic concepts of WSNs, LENS supports resource specification in a wide range of WSN experimentation infrastructures, and it is extensible to support potentially unforeseen technologies. LENS is also compatible with specification languages for other network resources such as optical networks. As a part of the NSF GENI initiative, we have implemented LENS in the KanseiGenie control framework, and LENS has been actively used to support experimentation in the federated WSN infrastructure involving Kansei and NetEye. Enabling reasoning about uncertainty factors in experimentation, LENS is expected to serve as a basis for developing methodologies and tools for predictable, repeatable WSN experimentation.</td>
    1848 </tr>
    1849 
    1850 
    1851 
    1852 <tr>
    1853      <td>DOI</td>
    1854      <td>10.1145/2030718.2030727</td>
    1855 </tr>
    1856 
    1857 
    1858 
    1859 <tr>
    1860      <td>URL</td>
    1861      <td><a href="http://dx.doi.org/10.1145/2030718.2030727">http://dx.doi.org/10.1145/2030718.2030727</a></td>
     1871<b class="myheading" style="position: relative; left: 5%;">Ju, Xi and Zhang, Hongwei and Zeng, Wenjie and Sridharan, Mukundan and Li, Jing and Arora, Anish and Ramnath, Rajiv and Xin, Yufeng</b>
     1872
     1873<div class="BibEntry">
     1874
     1875<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1876
     1877
     1878<tr>
     1879     <td valign="top">Author</td>
     1880     <td valign="top">Ju, Xi and Zhang, Hongwei and Zeng, Wenjie and Sridharan, Mukundan and Li, Jing and Arora, Anish and Ramnath, Rajiv and Xin, Yufeng</td>
     1881</tr>
     1882
     1883<tr>
     1884     <td valign="top">Title</td>
     1885     <td valign="top">LENS: resource specification for wireless sensor network experimentation infrastructures</td>
     1886</tr>
     1887
     1888<tr>
     1889     <td valign="top">Booktitle</td>
     1890     <td valign="top">Proceedings of the 6th ACM international workshop on Wireless network testbeds, experimental evaluation and characterization</td>
     1891</tr>
     1892
     1893<tr>
     1894     <td valign="top">Location</td>
     1895     <td valign="top">Las Vegas, Nevada, USA</td>
     1896</tr>
     1897
     1898<tr>
     1899     <td valign="top">Publisher</td>
     1900     <td valign="top">ACM</td>
     1901</tr>
     1902
     1903<tr>
     1904     <td valign="top">Address</td>
     1905     <td valign="top">New York, NY, USA</td>
     1906</tr>
     1907
     1908<tr>
     1909     <td valign="top">Year</td>
     1910     <td valign="top">2011</td>
     1911</tr>
     1912
     1913<tr>
     1914     <td valign="top">Abstract</td>
     1915     <td valign="top">As a first step towards predictable, repeatable WSN experimentation, we propose the resource specification language LENS (a.k.a. Language for Embedded Networked Sensing) for WSN experimentation infrastructures. Using the Resource Description Framework (RDF) and the Web Ontology Language (OWL), LENS defines a semantic ontology for WSN resources; LENS enables explicit control and measurement of uncertainty factors, and it enables reasoning about the relationships between WSN resources. Focusing on basic concepts of WSNs, LENS supports resource specification in a wide range of WSN experimentation infrastructures, and it is extensible to support potentially unforeseen technologies. LENS is also compatible with specification languages for other network resources such as optical networks. As a part of the NSF GENI initiative, we have implemented LENS in the KanseiGenie control framework, and LENS has been actively used to support experimentation in the federated WSN infrastructure involving Kansei and NetEye. Enabling reasoning about uncertainty factors in experimentation, LENS is expected to serve as a basis for developing methodologies and tools for predictable, repeatable WSN experimentation.</td>
     1916</tr>
     1917
     1918
     1919
     1920<tr>
     1921     <td valign="top">DOI</td>
     1922     <td valign="top">10.1145/2030718.2030727</td>
     1923</tr>
     1924
     1925
     1926
     1927<tr>
     1928     <td valign="top">URL</td>
     1929     <td valign="top"><a href="http://dx.doi.org/10.1145/2030718.2030727">http://dx.doi.org/10.1145/2030718.2030727</a></td>
    18621930</tr>
    18631931
    … …  
    18691937
    18701938<a class="EntryGoto" id="Kim, Dae Y. and Mathy, Laurent and Campanella, Mauro and Summerhill, Rick and Williams, James and Shimojo, Shinji and Kitamura, Yasuichi and Otsuki, Hideaki"></a>
    1871 <b class="myheading" style="position: relative; left: 10%;">Kim, Dae Y. and Mathy, Laurent and Campanella, Mauro and Summerhill, Rick and Williams, James and Shimojo, Shinji and Kitamura, Yasuichi and Otsuki, Hideaki</b>
    1872 
    1873 <div class="BibEntry">
    1874 
    1875 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1876 
    1877 
    1878 <tr>
    1879      <td>Author</td>
    1880      <td>Kim, Dae Y. and Mathy, Laurent and Campanella, Mauro and Summerhill, Rick and Williams, James and Shimojo, Shinji and Kitamura, Yasuichi and Otsuki, Hideaki</td>
    1881 </tr>
    1882 
    1883 <tr>
    1884      <td>Title</td>
    1885      <td>Future Internet: Challenges in Virtualization and Federation</td>
    1886 </tr>
    1887 
    1888 <tr>
    1889      <td>Booktitle</td>
    1890      <td>2009 Fifth Advanced International Conference on Telecommunications</td>
    1891 </tr>
    1892 
    1893 <tr>
    1894      <td>Location</td>
    1895      <td>Venice/Mestre, Italy</td>
    1896 </tr>
    1897 
    1898 <tr>
    1899      <td>Publisher</td>
    1900      <td>IEEE</td>
    1901 </tr>
    1902 
    1903 <tr>
    1904      <td>Year</td>
    1905      <td>2009</td>
    1906 </tr>
    1907 
    1908 <tr>
    1909      <td>Abstract</td>
    1910      <td>Future Internet is a clean-slate research activity in the quest of new networking technologies to overcome the limits of the current Internet. In its experimental research, virtualization and federation are emerging as essential features, especially in the construction and operation of the testbeds. Moreover, they are believed to sustain as the fundamental features of the Future Internet itself. Visions and experiences on virtualization and federation are given by leading experts from US, EU, and Asia.</td>
    1911 </tr>
    1912 
    1913 
    1914 
    1915 <tr>
    1916      <td>DOI</td>
    1917      <td>10.1109/AICT.2009.8</td>
    1918 </tr>
    1919 
    1920 
    1921 
    1922 <tr>
    1923      <td>URL</td>
    1924      <td><a href="http://dx.doi.org/10.1109/AICT.2009.8">http://dx.doi.org/10.1109/AICT.2009.8</a></td>
     1939<b class="myheading" style="position: relative; left: 5%;">Kim, Dae Y. and Mathy, Laurent and Campanella, Mauro and Summerhill, Rick and Williams, James and Shimojo, Shinji and Kitamura, Yasuichi and Otsuki, Hideaki</b>
     1940
     1941<div class="BibEntry">
     1942
     1943<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     1944
     1945
     1946<tr>
     1947     <td valign="top">Author</td>
     1948     <td valign="top">Kim, Dae Y. and Mathy, Laurent and Campanella, Mauro and Summerhill, Rick and Williams, James and Shimojo, Shinji and Kitamura, Yasuichi and Otsuki, Hideaki</td>
     1949</tr>
     1950
     1951<tr>
     1952     <td valign="top">Title</td>
     1953     <td valign="top">Future Internet: Challenges in Virtualization and Federation</td>
     1954</tr>
     1955
     1956<tr>
     1957     <td valign="top">Booktitle</td>
     1958     <td valign="top">2009 Fifth Advanced International Conference on Telecommunications</td>
     1959</tr>
     1960
     1961<tr>
     1962     <td valign="top">Location</td>
     1963     <td valign="top">Venice/Mestre, Italy</td>
     1964</tr>
     1965
     1966<tr>
     1967     <td valign="top">Publisher</td>
     1968     <td valign="top">IEEE</td>
     1969</tr>
     1970
     1971<tr>
     1972     <td valign="top">Year</td>
     1973     <td valign="top">2009</td>
     1974</tr>
     1975
     1976<tr>
     1977     <td valign="top">Abstract</td>
     1978     <td valign="top">Future Internet is a clean-slate research activity in the quest of new networking technologies to overcome the limits of the current Internet. In its experimental research, virtualization and federation are emerging as essential features, especially in the construction and operation of the testbeds. Moreover, they are believed to sustain as the fundamental features of the Future Internet itself. Visions and experiences on virtualization and federation are given by leading experts from US, EU, and Asia.</td>
     1979</tr>
     1980
     1981
     1982
     1983<tr>
     1984     <td valign="top">DOI</td>
     1985     <td valign="top">10.1109/AICT.2009.8</td>
     1986</tr>
     1987
     1988
     1989
     1990<tr>
     1991     <td valign="top">URL</td>
     1992     <td valign="top"><a href="http://dx.doi.org/10.1109/AICT.2009.8">http://dx.doi.org/10.1109/AICT.2009.8</a></td>
    19251993</tr>
    19261994
    … …  
    19322000
    19332001<a class="EntryGoto" id="Kim, Hyunjun and Lee, Sungwon"></a>
    1934 <b class="myheading" style="position: relative; left: 10%;">Kim, Hyunjun and Lee, Sungwon</b>
    1935 
    1936 <div class="BibEntry">
    1937 
    1938 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    1939 
    1940 
    1941 <tr>
    1942      <td>Author</td>
    1943      <td>Kim, Hyunjun and Lee, Sungwon</td>
    1944 </tr>
    1945 
    1946 <tr>
    1947      <td>Title</td>
    1948      <td>FiRST Cloud Aggregate Manager development over FiRST: Future Internet testbed</td>
    1949 </tr>
    1950 
    1951 <tr>
    1952      <td>Booktitle</td>
    1953      <td>The International Conference on Information Network 2012</td>
    1954 </tr>
    1955 
    1956 <tr>
    1957      <td>Location</td>
    1958      <td>Bali, Indonesia</td>
    1959 </tr>
    1960 
    1961 <tr>
    1962      <td>Publisher</td>
    1963      <td>IEEE</td>
    1964 </tr>
    1965 
    1966 <tr>
    1967      <td>Year</td>
    1968      <td>2012</td>
    1969 </tr>
    1970 
    1971 <tr>
    1972      <td>Abstract</td>
    1973      <td>FiRST (Future Internet Research for Sustainable Test-bed) is the future internet platform development project being performed in Korea. The goal of the project is to create the virtualized and dynamic service creation environments over future internet networks; it is an experimental project to realize future innovative service ideas over real network environments. Among this, cloud computing is the key enabler to control and allocate virtualized network resources (such as CPU, storage, and virtualized network configuration) for the requested services. However, researches on interworking between future internet and cloud computing is in initial phase. In this paper, we propose the FiRST Cloud Aggregate Manager (AM) based on GENI (Global Environment for Network Innovation) AM Application Programming Interface (API) for the federation between future internet test-bed and open source OpenStack cloud computing platform. After that, we propose the zero-client service for mobile cloud management. In order to control the zero-client service, we develop Cloud Mobility Client/Server. And, we validate and verified our FiRST Cloud AM and zero-client service by developing experimental test-bed. Through this test-bed, we confirm that the proposed FiRST Cloud AM and zero-client service efficiently interworks with future internet control plane framework by using GENI Control Framework (GCF) tools.</td>
    1974 </tr>
    1975 
    1976 
    1977 
    1978 <tr>
    1979      <td>DOI</td>
    1980      <td>10.1109/ICOIN.2012.6164436</td>
    1981 </tr>
    1982 
    1983 
    1984 
    1985 <tr>
    1986      <td>URL</td>
    1987      <td><a href="http://dx.doi.org/10.1109/ICOIN.2012.6164436">http://dx.doi.org/10.1109/ICOIN.2012.6164436</a></td>
     2002<b class="myheading" style="position: relative; left: 5%;">Kim, Hyunjun and Lee, Sungwon</b>
     2003
     2004<div class="BibEntry">
     2005
     2006<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2007
     2008
     2009<tr>
     2010     <td valign="top">Author</td>
     2011     <td valign="top">Kim, Hyunjun and Lee, Sungwon</td>
     2012</tr>
     2013
     2014<tr>
     2015     <td valign="top">Title</td>
     2016     <td valign="top">FiRST Cloud Aggregate Manager development over FiRST: Future Internet testbed</td>
     2017</tr>
     2018
     2019<tr>
     2020     <td valign="top">Booktitle</td>
     2021     <td valign="top">The International Conference on Information Network 2012</td>
     2022</tr>
     2023
     2024<tr>
     2025     <td valign="top">Location</td>
     2026     <td valign="top">Bali, Indonesia</td>
     2027</tr>
     2028
     2029<tr>
     2030     <td valign="top">Publisher</td>
     2031     <td valign="top">IEEE</td>
     2032</tr>
     2033
     2034<tr>
     2035     <td valign="top">Year</td>
     2036     <td valign="top">2012</td>
     2037</tr>
     2038
     2039<tr>
     2040     <td valign="top">Abstract</td>
     2041     <td valign="top">FiRST (Future Internet Research for Sustainable Test-bed) is the future internet platform development project being performed in Korea. The goal of the project is to create the virtualized and dynamic service creation environments over future internet networks; it is an experimental project to realize future innovative service ideas over real network environments. Among this, cloud computing is the key enabler to control and allocate virtualized network resources (such as CPU, storage, and virtualized network configuration) for the requested services. However, researches on interworking between future internet and cloud computing is in initial phase. In this paper, we propose the FiRST Cloud Aggregate Manager (AM) based on GENI (Global Environment for Network Innovation) AM Application Programming Interface (API) for the federation between future internet test-bed and open source OpenStack cloud computing platform. After that, we propose the zero-client service for mobile cloud management. In order to control the zero-client service, we develop Cloud Mobility Client/Server. And, we validate and verified our FiRST Cloud AM and zero-client service by developing experimental test-bed. Through this test-bed, we confirm that the proposed FiRST Cloud AM and zero-client service efficiently interworks with future internet control plane framework by using GENI Control Framework (GCF) tools.</td>
     2042</tr>
     2043
     2044
     2045
     2046<tr>
     2047     <td valign="top">DOI</td>
     2048     <td valign="top">10.1109/ICOIN.2012.6164436</td>
     2049</tr>
     2050
     2051
     2052
     2053<tr>
     2054     <td valign="top">URL</td>
     2055     <td valign="top"><a href="http://dx.doi.org/10.1109/ICOIN.2012.6164436">http://dx.doi.org/10.1109/ICOIN.2012.6164436</a></td>
    19882056</tr>
    19892057
    … …  
    19952063
    19962064<a class="EntryGoto" id="Kline, Donald and Quan, John"></a>
    1997 <b class="myheading" style="position: relative; left: 10%;">Kline, Donald and Quan, John</b>
    1998 
    1999 <div class="BibEntry">
    2000 
    2001 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2002 
    2003 
    2004 <tr>
    2005      <td>Author</td>
    2006      <td>Kline, Donald and Quan, John</td>
    2007 </tr>
    2008 
    2009 <tr>
    2010      <td>Title</td>
    2011      <td>Attribute description service for large-scale networks</td>
    2012 </tr>
    2013 
    2014 <tr>
    2015      <td>Booktitle</td>
    2016      <td>Proceedings of the 2nd international conference on Human centered design</td>
    2017 </tr>
    2018 
    2019 <tr>
    2020      <td>Location</td>
    2021      <td>Orlando, FL, USA</td>
    2022 </tr>
    2023 
    2024 <tr>
    2025      <td>Publisher</td>
    2026      <td>Springer-Verlag</td>
    2027 </tr>
    2028 
    2029 <tr>
    2030      <td>Address</td>
    2031      <td>Berlin, Heidelberg</td>
    2032 </tr>
    2033 
    2034 <tr>
    2035      <td>Year</td>
    2036      <td>2011</td>
    2037 </tr>
    2038 
    2039 <tr>
    2040      <td>Abstract</td>
    2041      <td>An analysis of requesting resources from large-scale networks reveals a fundamental challenge. As the network grows, more and more resources become available, and so finding resources that fit experimental test criteria becomes difficult and time consuming. For example, the National Science Foundation sponsors GENI--an experimental network with a goal to gain enough resources to model the Internet at scale. Currently, GENI contains relatively few contributed resources donated from businesses and academia, and so matching resources to tests is rather simple. However, experimenters plan to conduct network experiments that are very complex and difficult to accurately model by using the vast numbers of resources expected in GENI. When GENI reaches its final state, finding the right resources that fit experimental test criteria out of many thousands of donated resources may be as difficult as conducting the experiment itself. This dilemma underscores the importance of establishing an attribute description service that promotes a standardized language for all interactions between the end users and the large-scale network.</td>
    2042 </tr>
    2043 
    2044 
    2045 
    2046 <tr>
    2047      <td>DOI</td>
    2048      <td>10.1007/978-3-642-21753-1&#x005F;58</td>
    2049 </tr>
    2050 
    2051 
    2052 
    2053 <tr>
    2054      <td>URL</td>
    2055      <td><a href="http://portal.acm.org/citation.cfm?id=2021672.2021735">http://portal.acm.org/citation.cfm?id=2021672.2021735</a></td>
     2065<b class="myheading" style="position: relative; left: 5%;">Kline, Donald and Quan, John</b>
     2066
     2067<div class="BibEntry">
     2068
     2069<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2070
     2071
     2072<tr>
     2073     <td valign="top">Author</td>
     2074     <td valign="top">Kline, Donald and Quan, John</td>
     2075</tr>
     2076
     2077<tr>
     2078     <td valign="top">Title</td>
     2079     <td valign="top">Attribute description service for large-scale networks</td>
     2080</tr>
     2081
     2082<tr>
     2083     <td valign="top">Booktitle</td>
     2084     <td valign="top">Proceedings of the 2nd international conference on Human centered design</td>
     2085</tr>
     2086
     2087<tr>
     2088     <td valign="top">Location</td>
     2089     <td valign="top">Orlando, FL, USA</td>
     2090</tr>
     2091
     2092<tr>
     2093     <td valign="top">Publisher</td>
     2094     <td valign="top">Springer-Verlag</td>
     2095</tr>
     2096
     2097<tr>
     2098     <td valign="top">Address</td>
     2099     <td valign="top">Berlin, Heidelberg</td>
     2100</tr>
     2101
     2102<tr>
     2103     <td valign="top">Year</td>
     2104     <td valign="top">2011</td>
     2105</tr>
     2106
     2107<tr>
     2108     <td valign="top">Abstract</td>
     2109     <td valign="top">An analysis of requesting resources from large-scale networks reveals a fundamental challenge. As the network grows, more and more resources become available, and so finding resources that fit experimental test criteria becomes difficult and time consuming. For example, the National Science Foundation sponsors GENI--an experimental network with a goal to gain enough resources to model the Internet at scale. Currently, GENI contains relatively few contributed resources donated from businesses and academia, and so matching resources to tests is rather simple. However, experimenters plan to conduct network experiments that are very complex and difficult to accurately model by using the vast numbers of resources expected in GENI. When GENI reaches its final state, finding the right resources that fit experimental test criteria out of many thousands of donated resources may be as difficult as conducting the experiment itself. This dilemma underscores the importance of establishing an attribute description service that promotes a standardized language for all interactions between the end users and the large-scale network.</td>
     2110</tr>
     2111
     2112
     2113
     2114<tr>
     2115     <td valign="top">DOI</td>
     2116     <td valign="top">10.1007/978-3-642-21753-1&#x005F;58</td>
     2117</tr>
     2118
     2119
     2120
     2121<tr>
     2122     <td valign="top">URL</td>
     2123     <td valign="top"><a href="http://portal.acm.org/citation.cfm?id=2021672.2021735">http://portal.acm.org/citation.cfm?id=2021672.2021735</a></td>
    20562124</tr>
    20572125
    … …  
    20632131
    20642132<a class="EntryGoto" id="Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael"></a>
    2065 <b class="myheading" style="position: relative; left: 10%;">Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
    2066 
    2067 <div class="BibEntry">
    2068 
    2069 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2070 
    2071 
    2072 <tr>
    2073      <td>Author</td>
    2074      <td>Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</td>
    2075 </tr>
    2076 
    2077 <tr>
    2078      <td>Title</td>
    2079      <td>Performance of GENI Cloud Testbeds for Real Time Scientific Application</td>
    2080 </tr>
    2081 
    2082 <tr>
    2083      <td>Booktitle</td>
    2084      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    2085 </tr>
    2086 
    2087 <tr>
    2088      <td>Location</td>
    2089      <td>Los Angeles</td>
    2090 </tr>
    2091 
    2092 <tr>
    2093      <td>Year</td>
    2094      <td>2012</td>
    2095 </tr>
    2096 
    2097 <tr>
    2098      <td>Abstract</td>
    2099      <td>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.</td>
     2133<b class="myheading" style="position: relative; left: 5%;">Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</b>
     2134
     2135<div class="BibEntry">
     2136
     2137<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2138
     2139
     2140<tr>
     2141     <td valign="top">Author</td>
     2142     <td valign="top">Krishnappa, Dilip K. and Lyons, Eric and Irwin, David and Zink, Michael</td>
     2143</tr>
     2144
     2145<tr>
     2146     <td valign="top">Title</td>
     2147     <td valign="top">Performance of GENI Cloud Testbeds for Real Time Scientific Application</td>
     2148</tr>
     2149
     2150<tr>
     2151     <td valign="top">Booktitle</td>
     2152     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     2153</tr>
     2154
     2155<tr>
     2156     <td valign="top">Location</td>
     2157     <td valign="top">Los Angeles</td>
     2158</tr>
     2159
     2160<tr>
     2161     <td valign="top">Year</td>
     2162     <td valign="top">2012</td>
     2163</tr>
     2164
     2165<tr>
     2166     <td valign="top">Abstract</td>
     2167     <td valign="top">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.</td>
    21002168</tr>
    21012169
    … …  
    21112179
    21122180<a class="EntryGoto" id="Lee, Jae W."></a>
    2113 <b class="myheading" style="position: relative; left: 10%;">Lee, Jae W.</b>
    2114 
    2115 <div class="BibEntry">
    2116 
    2117 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2118 
    2119 
    2120 <tr>
    2121      <td>Author</td>
    2122      <td>Lee, Jae W.</td>
    2123 </tr>
    2124 
    2125 <tr>
    2126      <td>Title</td>
    2127      <td>Towards a Common System Architecture for Dynamically Deploying Network Services in Routers and End Hosts</td>
    2128 </tr>
    2129 
    2130 <tr>
    2131      <td>Year</td>
    2132      <td>2012</td>
    2133 </tr>
    2134 
    2135 <tr>
    2136      <td>Abstract</td>
    2137      <td>The architectural simplicity of the core Internet is a double-edged sword. On the one hand, its agnostic nature paved the way for endless innovations of end-to-end applications. On the other hand, the inherent limitation of this simplicity makes it difficult to add new functions to the network core itself. This is exacerbated by the conservative tendency of commercial entities to &#x6c;&#x0308;eave well-enough alone&#x2c;&#x0308; leading to the current situation often referred to as the ossification of the Internet. For decades, there has been practically no new functionality that has been added to the core Internet on a large scale. This thesis explores the possibility of enabling in-network services towards the goal of overcoming the ossification of the Internet. Our ultimate goal is to provide a common run-time environment supported by all Internet nodes and a wide-area deployment mechanism, so that network services can be freely installed, removed, and migrated among Internet nodes of all kinds–from a backbone router to a set-top box at home. In that vision of a future Internet, there is little difference between servers and routers for the purpose of running network services. Services can run anywhere on the Internet. Application service providers will have the freedom to choose the best place to run their code. This thesis presents NetServ, our first step to realize the vision of network services running anywhere on the Internet. NetServ is a node architecture for dynamically deploying in-network services on edge routers. Network functions and applications are implemented as software modules which can be deployed at any NetServ-enabled node on the Internet, subject to policy restrictions. The NetServ framework provides a common execution environment for service modules and the ability to dynamically install and remove the services without restarting the nodes. There are many challenges in designing such a system. The main contribution of this thesis lies in meeting those challenges. First, we recognize that the primary impetus for adopting new technologies is economics. To address the challenge of providing economic incentives for enabling in-network services, we demonstrate how NetServ can facilitate an economic alliance between content providers and ISPs. Using NetServ, content providers and the ISPs operating at the network edge (aka eyeball ISPs) can enter into a mutually beneficial economic relationship. ISPs make their NetServ-enabled edge routers available for hosting content providers' applications and contents. Content providers can operate closer to end users by deploying code modules on NetServ-enabled edge routers. We make our case by presenting NetServ applications which represent four concrete use cases. Second, our node architecture must support both traditional server applications and in-network packet processing applications since content providers' applications running on ISPs' routers will combine the traits of both. To address this challenge, NetServ framework can host a packet processing module that sits in the data path, a server module that uses the TCP/IP stack in the traditional way, or a combined module that does both. NetServ provides a unified runtime environment between routers and servers, taking us a step closer to the vision of the unified runtime available on all Internet nodes. Third, we must provide a fast and streamlined deployment mechanism. Content providers should be able to deploy their applications at any NetServ-enabled edge router on the Inter- net, given that they have proper authorizations. Moreover, in some application scenarios, content providers may not know the exact locations of the target routers. Content providers need a way to send a message to install or remove an application module towards a network destination, and have the NetServ-enabled routers located in the path catch and act on the message. To address this challenge, we adopted on-path signaling as the deployment mechanism for NetServ. A NetServ signaling message is sent in an IP packet towards a destination. The packet gets forwarded by IP routers as usual, but when it transits a NetServ-enabled router, the message gets intercepted and passed to the NetServ control layer. Fourth, a NetServ-enabled router must support the concurrent executions of multiple without restarting the nodes. There are many challenges in designing such a system. The main contribution of this thesis lies in meeting those challenges. First, we recognize that the primary impetus for adopting new technologies is economics. To address the challenge of providing economic incentives for enabling in-network services, we demonstrate how NetServ can facilitate an economic alliance between content providers and ISPs. Using NetServ, content providers and the ISPs operating at the network edge (aka eyeball ISPs) can enter into a mutually beneficial economic relationship. ISPs make their NetServ-enabled edge routers available for hosting content providers' applications and contents. Content providers can operate closer to end users by deploying code modules on NetServ-enabled edge routers. We make our case by presenting NetServ applications which represent four concrete use cases. Second, our node architecture must support both traditional server applications and in-network packet processing applications since content providers' applications running on ISPs' routers will combine the traits of both. To address this challenge, NetServ framework can host a packet processing module that sits in the data path, a server module that uses the TCP/IP stack in the traditional way, or a combined module that does both. NetServ provides a unified runtime environment between routers and servers, taking us a step closer to the vision of the unified runtime available on all Internet nodes. Third, we must provide a fast and streamlined deployment mechanism. Content providers should be able to deploy their applications at any NetServ-enabled edge router on the Internet, given that they have proper authorizations. Moreover, in some application scenarios, content providers may not know the exact locations of the target routers. Content providers need a way to send a message to install or remove an application module towards a network destination, and have the NetServ-enabled routers located in the path catch and act on the message. To address this challenge, we adopted on-path signaling as the deployment mechanism for NetServ. A NetServ signaling message is sent in an IP packet towards a destination. The packet gets forwarded by IP routers as usual, but when it transits a NetServ-enabled router, the message gets intercepted and passed to the NetServ control layer. Fourth, a NetServ-enabled router must support the concurrent executions of multiple content providers' applications. Each content provider's execution environment must be isolated from one another, and the resource usage of each must be controlled. To address the challenge of providing a robust multi-user execution environment, we chose to run NetServ modules in user space. This is in stark contrast to most programmable routers, which run service modules in kernel space for fast packet processing. Furthermore, NetServ modules are written in Java and run in Java Virtual Machines (JVMs). Our choice of user space execution and JVM allows us to leverage the decades of technology advances in operating systems, virtualization, and Java. Lastly, in order to host the services of a large number of content providers, NetServ must be able to scale beyond the single-box architecture. We address this challenge with the multi-box lateral expansion of NetServ using the OpenFlow forwarding engine. In this extended architecture, multiple NetServ nodes are attached to an OpenFlow switch, which provides a physically separate forwarding plane. The scalability of user services is no longer limited to a single NetServ box. Additionally, this thesis presents our prior work on improving service discovery in local and global networks. The service discovery work makes indirect contribution because the limitations of local and overlay networks encountered during those studies eventually led us to investigate in-network services, which resulted in NetServ. Specifically, we investigate the issues involved in bootstrapping large-scale structured overlay networks, present a tool to merge service announcements from multiple local networks, and propose an enhancement to structured overlay networks using link-local multicast.</td>
    2138 </tr>
    2139 
    2140 
    2141 
    2142 
    2143 
    2144 <tr>
    2145      <td>URL</td>
    2146      <td><a href="http://academiccommons.columbia.edu/download/fedora&#x005F;content/download/ac:147210/CONTENT/Lee&#x005F;columbia&#x005F;0054D&#x005F;10773.pdf">http://academiccommons.columbia.edu/download/fedora&#x005F;content/download/ac:147210/CONTENT/Lee&#x005F;columbia&#x005F;0054D&#x005F;10773.pdf</a></td>
     2181<b class="myheading" style="position: relative; left: 5%;">Lee, Jae W.</b>
     2182
     2183<div class="BibEntry">
     2184
     2185<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2186
     2187
     2188<tr>
     2189     <td valign="top">Author</td>
     2190     <td valign="top">Lee, Jae W.</td>
     2191</tr>
     2192
     2193<tr>
     2194     <td valign="top">Title</td>
     2195     <td valign="top">Towards a Common System Architecture for Dynamically Deploying Network Services in Routers and End Hosts</td>
     2196</tr>
     2197
     2198<tr>
     2199     <td valign="top">Year</td>
     2200     <td valign="top">2012</td>
     2201</tr>
     2202
     2203<tr>
     2204     <td valign="top">Abstract</td>
     2205     <td valign="top">The architectural simplicity of the core Internet is a double-edged sword. On the one hand, its agnostic nature paved the way for endless innovations of end-to-end applications. On the other hand, the inherent limitation of this simplicity makes it difficult to add new functions to the network core itself. This is exacerbated by the conservative tendency of commercial entities to &#x6c;&#x0308;eave well-enough alone&#x2c;&#x0308; leading to the current situation often referred to as the ossification of the Internet. For decades, there has been practically no new functionality that has been added to the core Internet on a large scale. This thesis explores the possibility of enabling in-network services towards the goal of overcoming the ossification of the Internet. Our ultimate goal is to provide a common run-time environment supported by all Internet nodes and a wide-area deployment mechanism, so that network services can be freely installed, removed, and migrated among Internet nodes of all kinds–from a backbone router to a set-top box at home. In that vision of a future Internet, there is little difference between servers and routers for the purpose of running network services. Services can run anywhere on the Internet. Application service providers will have the freedom to choose the best place to run their code. This thesis presents NetServ, our first step to realize the vision of network services running anywhere on the Internet. NetServ is a node architecture for dynamically deploying in-network services on edge routers. Network functions and applications are implemented as software modules which can be deployed at any NetServ-enabled node on the Internet, subject to policy restrictions. The NetServ framework provides a common execution environment for service modules and the ability to dynamically install and remove the services without restarting the nodes. There are many challenges in designing such a system. The main contribution of this thesis lies in meeting those challenges. First, we recognize that the primary impetus for adopting new technologies is economics. To address the challenge of providing economic incentives for enabling in-network services, we demonstrate how NetServ can facilitate an economic alliance between content providers and ISPs. Using NetServ, content providers and the ISPs operating at the network edge (aka eyeball ISPs) can enter into a mutually beneficial economic relationship. ISPs make their NetServ-enabled edge routers available for hosting content providers' applications and contents. Content providers can operate closer to end users by deploying code modules on NetServ-enabled edge routers. We make our case by presenting NetServ applications which represent four concrete use cases. Second, our node architecture must support both traditional server applications and in-network packet processing applications since content providers' applications running on ISPs' routers will combine the traits of both. To address this challenge, NetServ framework can host a packet processing module that sits in the data path, a server module that uses the TCP/IP stack in the traditional way, or a combined module that does both. NetServ provides a unified runtime environment between routers and servers, taking us a step closer to the vision of the unified runtime available on all Internet nodes. Third, we must provide a fast and streamlined deployment mechanism. Content providers should be able to deploy their applications at any NetServ-enabled edge router on the Inter- net, given that they have proper authorizations. Moreover, in some application scenarios, content providers may not know the exact locations of the target routers. Content providers need a way to send a message to install or remove an application module towards a network destination, and have the NetServ-enabled routers located in the path catch and act on the message. To address this challenge, we adopted on-path signaling as the deployment mechanism for NetServ. A NetServ signaling message is sent in an IP packet towards a destination. The packet gets forwarded by IP routers as usual, but when it transits a NetServ-enabled router, the message gets intercepted and passed to the NetServ control layer. Fourth, a NetServ-enabled router must support the concurrent executions of multiple without restarting the nodes. There are many challenges in designing such a system. The main contribution of this thesis lies in meeting those challenges. First, we recognize that the primary impetus for adopting new technologies is economics. To address the challenge of providing economic incentives for enabling in-network services, we demonstrate how NetServ can facilitate an economic alliance between content providers and ISPs. Using NetServ, content providers and the ISPs operating at the network edge (aka eyeball ISPs) can enter into a mutually beneficial economic relationship. ISPs make their NetServ-enabled edge routers available for hosting content providers' applications and contents. Content providers can operate closer to end users by deploying code modules on NetServ-enabled edge routers. We make our case by presenting NetServ applications which represent four concrete use cases. Second, our node architecture must support both traditional server applications and in-network packet processing applications since content providers' applications running on ISPs' routers will combine the traits of both. To address this challenge, NetServ framework can host a packet processing module that sits in the data path, a server module that uses the TCP/IP stack in the traditional way, or a combined module that does both. NetServ provides a unified runtime environment between routers and servers, taking us a step closer to the vision of the unified runtime available on all Internet nodes. Third, we must provide a fast and streamlined deployment mechanism. Content providers should be able to deploy their applications at any NetServ-enabled edge router on the Internet, given that they have proper authorizations. Moreover, in some application scenarios, content providers may not know the exact locations of the target routers. Content providers need a way to send a message to install or remove an application module towards a network destination, and have the NetServ-enabled routers located in the path catch and act on the message. To address this challenge, we adopted on-path signaling as the deployment mechanism for NetServ. A NetServ signaling message is sent in an IP packet towards a destination. The packet gets forwarded by IP routers as usual, but when it transits a NetServ-enabled router, the message gets intercepted and passed to the NetServ control layer. Fourth, a NetServ-enabled router must support the concurrent executions of multiple content providers' applications. Each content provider's execution environment must be isolated from one another, and the resource usage of each must be controlled. To address the challenge of providing a robust multi-user execution environment, we chose to run NetServ modules in user space. This is in stark contrast to most programmable routers, which run service modules in kernel space for fast packet processing. Furthermore, NetServ modules are written in Java and run in Java Virtual Machines (JVMs). Our choice of user space execution and JVM allows us to leverage the decades of technology advances in operating systems, virtualization, and Java. Lastly, in order to host the services of a large number of content providers, NetServ must be able to scale beyond the single-box architecture. We address this challenge with the multi-box lateral expansion of NetServ using the OpenFlow forwarding engine. In this extended architecture, multiple NetServ nodes are attached to an OpenFlow switch, which provides a physically separate forwarding plane. The scalability of user services is no longer limited to a single NetServ box. Additionally, this thesis presents our prior work on improving service discovery in local and global networks. The service discovery work makes indirect contribution because the limitations of local and overlay networks encountered during those studies eventually led us to investigate in-network services, which resulted in NetServ. Specifically, we investigate the issues involved in bootstrapping large-scale structured overlay networks, present a tool to merge service announcements from multiple local networks, and propose an enhancement to structured overlay networks using link-local multicast.</td>
     2206</tr>
     2207
     2208
     2209
     2210
     2211
     2212<tr>
     2213     <td valign="top">URL</td>
     2214     <td valign="top"><a href="http://academiccommons.columbia.edu/download/fedora&#x005F;content/download/ac:147210/CONTENT/Lee&#x005F;columbia&#x005F;0054D&#x005F;10773.pdf">http://academiccommons.columbia.edu/download/fedora&#x005F;content/download/ac:147210/CONTENT/Lee&#x005F;columbia&#x005F;0054D&#x005F;10773.pdf</a></td>
    21472215</tr>
    21482216
    … …  
    21542222
    21552223<a class="EntryGoto" id="Lee, Jae W. and Francescangeli, Roberto and Janak, Jan and Srinivasan, Suman and Baset, Salman A. and Schulzrinne, Henning and Despotovic, Zoran and Kellerer, Wolfgang"></a>
    2156 <b class="myheading" style="position: relative; left: 10%;">Lee, Jae W. and Francescangeli, Roberto and Janak, Jan and Srinivasan, Suman and Baset, Salman A. and Schulzrinne, Henning and Despotovic, Zoran and Kellerer, Wolfgang</b>
    2157 
    2158 <div class="BibEntry">
    2159 
    2160 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2161 
    2162 
    2163 <tr>
    2164      <td>Author</td>
    2165      <td>Lee, Jae W. and Francescangeli, Roberto and Janak, Jan and Srinivasan, Suman and Baset, Salman A. and Schulzrinne, Henning and Despotovic, Zoran and Kellerer, Wolfgang</td>
    2166 </tr>
    2167 
    2168 <tr>
    2169      <td>Title</td>
    2170      <td>NetServ: Active Networking 2.0</td>
    2171 </tr>
    2172 
    2173 <tr>
    2174      <td>Booktitle</td>
    2175      <td>2011 IEEE International Conference on Communications Workshops (ICC)</td>
    2176 </tr>
    2177 
    2178 <tr>
    2179      <td>Location</td>
    2180      <td>Kyoto, Japan</td>
    2181 </tr>
    2182 
    2183 <tr>
    2184      <td>Publisher</td>
    2185      <td>IEEE</td>
    2186 </tr>
    2187 
    2188 <tr>
    2189      <td>Year</td>
    2190      <td>2011</td>
    2191 </tr>
    2192 
    2193 <tr>
    2194      <td>Abstract</td>
    2195      <td>We present NetServ, a node architecture for deploying in-network services in the next generation Internet. NetServ-enabled network nodes provide a common execution environment, where network services implemented as modules can be dynamically installed and removed. We demonstrate three such modules. MicroCDN is a dynamic content distribution network (CDN) service which implements a content caching strategy specific to a content provider. The NAT Keep-alive module offloads the processing of keep-alive messages from SIP servers. The Media Relay module allows any NetServ node to act as a media relay, eliminating the need to manage standalone relay servers. NetServ aims to revive the Active Networking vision. It was too far ahead of its time a decade ago, but we believe its time has finally arrived.</td>
    2196 </tr>
    2197 
    2198 
    2199 
    2200 <tr>
    2201      <td>DOI</td>
    2202      <td>10.1109/iccw.2011.5963554</td>
    2203 </tr>
    2204 
    2205 
    2206 
    2207 <tr>
    2208      <td>URL</td>
    2209      <td><a href="http://dx.doi.org/10.1109/iccw.2011.5963554">http://dx.doi.org/10.1109/iccw.2011.5963554</a></td>
     2224<b class="myheading" style="position: relative; left: 5%;">Lee, Jae W. and Francescangeli, Roberto and Janak, Jan and Srinivasan, Suman and Baset, Salman A. and Schulzrinne, Henning and Despotovic, Zoran and Kellerer, Wolfgang</b>
     2225
     2226<div class="BibEntry">
     2227
     2228<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2229
     2230
     2231<tr>
     2232     <td valign="top">Author</td>
     2233     <td valign="top">Lee, Jae W. and Francescangeli, Roberto and Janak, Jan and Srinivasan, Suman and Baset, Salman A. and Schulzrinne, Henning and Despotovic, Zoran and Kellerer, Wolfgang</td>
     2234</tr>
     2235
     2236<tr>
     2237     <td valign="top">Title</td>
     2238     <td valign="top">NetServ: Active Networking 2.0</td>
     2239</tr>
     2240
     2241<tr>
     2242     <td valign="top">Booktitle</td>
     2243     <td valign="top">2011 IEEE International Conference on Communications Workshops (ICC)</td>
     2244</tr>
     2245
     2246<tr>
     2247     <td valign="top">Location</td>
     2248     <td valign="top">Kyoto, Japan</td>
     2249</tr>
     2250
     2251<tr>
     2252     <td valign="top">Publisher</td>
     2253     <td valign="top">IEEE</td>
     2254</tr>
     2255
     2256<tr>
     2257     <td valign="top">Year</td>
     2258     <td valign="top">2011</td>
     2259</tr>
     2260
     2261<tr>
     2262     <td valign="top">Abstract</td>
     2263     <td valign="top">We present NetServ, a node architecture for deploying in-network services in the next generation Internet. NetServ-enabled network nodes provide a common execution environment, where network services implemented as modules can be dynamically installed and removed. We demonstrate three such modules. MicroCDN is a dynamic content distribution network (CDN) service which implements a content caching strategy specific to a content provider. The NAT Keep-alive module offloads the processing of keep-alive messages from SIP servers. The Media Relay module allows any NetServ node to act as a media relay, eliminating the need to manage standalone relay servers. NetServ aims to revive the Active Networking vision. It was too far ahead of its time a decade ago, but we believe its time has finally arrived.</td>
     2264</tr>
     2265
     2266
     2267
     2268<tr>
     2269     <td valign="top">DOI</td>
     2270     <td valign="top">10.1109/iccw.2011.5963554</td>
     2271</tr>
     2272
     2273
     2274
     2275<tr>
     2276     <td valign="top">URL</td>
     2277     <td valign="top"><a href="http://dx.doi.org/10.1109/iccw.2011.5963554">http://dx.doi.org/10.1109/iccw.2011.5963554</a></td>
    22102278</tr>
    22112279
    … …  
    22172285
    22182286<a class="EntryGoto" id="Li, Dawei and Hong, Xiaoyan"></a>
    2219 <b class="myheading" style="position: relative; left: 10%;">Li, Dawei and Hong, Xiaoyan</b>
    2220 
    2221 <div class="BibEntry">
    2222 
    2223 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2224 
    2225 
    2226 <tr>
    2227      <td>Author</td>
    2228      <td>Li, Dawei and Hong, Xiaoyan</td>
    2229 </tr>
    2230 
    2231 <tr>
    2232      <td>Title</td>
    2233      <td>Practical exploitation on system vulnerability of ProtoGENI</td>
    2234 </tr>
    2235 
    2236 <tr>
    2237      <td>Booktitle</td>
    2238      <td>Proceedings of the 49th Annual Southeast Regional Conference</td>
    2239 </tr>
    2240 
    2241 <tr>
    2242      <td>Location</td>
    2243      <td>Kennesaw, Georgia</td>
    2244 </tr>
    2245 
    2246 <tr>
    2247      <td>Publisher</td>
    2248      <td>ACM</td>
    2249 </tr>
    2250 
    2251 <tr>
    2252      <td>Address</td>
    2253      <td>New York, NY, USA</td>
    2254 </tr>
    2255 
    2256 <tr>
    2257      <td>Year</td>
    2258      <td>2011</td>
    2259 </tr>
    2260 
    2261 <tr>
    2262      <td>Abstract</td>
    2263      <td>Global Environment for Network Innovations (GENI) is a unique virtual laboratory for at-scale networking experimentation exploring future Internets. The successful development of GENI has to consider security problems from the design and prototyping stages. However, in many cases, system vulnerability cannot be found unless through real experimentation bearing purposeful and meaningful designs. In this paper, we introduce some of our efforts in exploring the security vulnerabilities in ProtoGENI, a prototype implementation and deployment of GENI. Our results show potential breach on security of GENI in terms of availability. We make suggestions on potential defense strategies in order to improve the ProtoGENI security and its development.</td>
    2264 </tr>
    2265 
    2266 
    2267 
    2268 <tr>
    2269      <td>DOI</td>
    2270      <td>10.1145/2016039.2016073</td>
    2271 </tr>
    2272 
    2273 
    2274 
    2275 <tr>
    2276      <td>URL</td>
    2277      <td><a href="http://dx.doi.org/10.1145/2016039.2016073">http://dx.doi.org/10.1145/2016039.2016073</a></td>
     2287<b class="myheading" style="position: relative; left: 5%;">Li, Dawei and Hong, Xiaoyan</b>
     2288
     2289<div class="BibEntry">
     2290
     2291<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2292
     2293
     2294<tr>
     2295     <td valign="top">Author</td>
     2296     <td valign="top">Li, Dawei and Hong, Xiaoyan</td>
     2297</tr>
     2298
     2299<tr>
     2300     <td valign="top">Title</td>
     2301     <td valign="top">Practical exploitation on system vulnerability of ProtoGENI</td>
     2302</tr>
     2303
     2304<tr>
     2305     <td valign="top">Booktitle</td>
     2306     <td valign="top">Proceedings of the 49th Annual Southeast Regional Conference</td>
     2307</tr>
     2308
     2309<tr>
     2310     <td valign="top">Location</td>
     2311     <td valign="top">Kennesaw, Georgia</td>
     2312</tr>
     2313
     2314<tr>
     2315     <td valign="top">Publisher</td>
     2316     <td valign="top">ACM</td>
     2317</tr>
     2318
     2319<tr>
     2320     <td valign="top">Address</td>
     2321     <td valign="top">New York, NY, USA</td>
     2322</tr>
     2323
     2324<tr>
     2325     <td valign="top">Year</td>
     2326     <td valign="top">2011</td>
     2327</tr>
     2328
     2329<tr>
     2330     <td valign="top">Abstract</td>
     2331     <td valign="top">Global Environment for Network Innovations (GENI) is a unique virtual laboratory for at-scale networking experimentation exploring future Internets. The successful development of GENI has to consider security problems from the design and prototyping stages. However, in many cases, system vulnerability cannot be found unless through real experimentation bearing purposeful and meaningful designs. In this paper, we introduce some of our efforts in exploring the security vulnerabilities in ProtoGENI, a prototype implementation and deployment of GENI. Our results show potential breach on security of GENI in terms of availability. We make suggestions on potential defense strategies in order to improve the ProtoGENI security and its development.</td>
     2332</tr>
     2333
     2334
     2335
     2336<tr>
     2337     <td valign="top">DOI</td>
     2338     <td valign="top">10.1145/2016039.2016073</td>
     2339</tr>
     2340
     2341
     2342
     2343<tr>
     2344     <td valign="top">URL</td>
     2345     <td valign="top"><a href="http://dx.doi.org/10.1145/2016039.2016073">http://dx.doi.org/10.1145/2016039.2016073</a></td>
    22782346</tr>
    22792347
    … …  
    22852353
    22862354<a class="EntryGoto" id="Li, Dawei and Hong, Xiaoyan and Bowman, Jason"></a>
    2287 <b class="myheading" style="position: relative; left: 10%;">Li, Dawei and Hong, Xiaoyan and Bowman, Jason</b>
    2288 
    2289 <div class="BibEntry">
    2290 
    2291 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2292 
    2293 
    2294 <tr>
    2295      <td>Author</td>
    2296      <td>Li, Dawei and Hong, Xiaoyan and Bowman, Jason</td>
    2297 </tr>
    2298 
    2299 <tr>
    2300      <td>Title</td>
    2301      <td>Evaluation of Security Vulnerabilities by Using ProtoGENI as a Launchpad</td>
    2302 </tr>
    2303 
    2304 <tr>
    2305      <td>Booktitle</td>
    2306      <td>IEEE Global Communications Conference (GLOBECOM 2011)</td>
    2307 </tr>
    2308 
    2309 <tr>
    2310      <td>Year</td>
    2311      <td>2011</td>
    2312 </tr>
    2313 
    2314 <tr>
    2315      <td>Abstract</td>
    2316      <td>In this paper we analyze the security architecture of ProtoGENI. ProtoGENI is a prototype control framework implementation of GENI (Global Environment for Network Innovations). We perform a variety of experiments in an effort to identify potential vulnerabilities presented in the current implementation. We classify our attacks into three types: data plane to data plane, data plane to control plane, and data plane to Internet. Our results indicate the potential for a breach of confidentiality and availability internally within ProtoGENI, as well as risks to external Internet. We make suggestions outlining possible defense strategies to improve ProtoGENI security and aid in future development</td>
    2317 </tr>
    2318 
    2319 
    2320 
    2321 
    2322 
    2323 <tr>
    2324      <td>URL</td>
    2325      <td><a href="ftp://202.38.75.7/pub/&#x0025;D0&#x0025;C2&#x0025;CE&#x0025;C4&#x0025;BC&#x0025;FE&#x0025;BC&#x0025;D0&#x0025;20(2)/DATA/PID1102190.PDF">ftp://202.38.75.7/pub/&#x0025;D0&#x0025;C2&#x0025;CE&#x0025;C4&#x0025;BC&#x0025;FE&#x0025;BC&#x0025;D0&#x0025;20(2)/DATA/PID1102190.PDF</a></td>
     2355<b class="myheading" style="position: relative; left: 5%;">Li, Dawei and Hong, Xiaoyan and Bowman, Jason</b>
     2356
     2357<div class="BibEntry">
     2358
     2359<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2360
     2361
     2362<tr>
     2363     <td valign="top">Author</td>
     2364     <td valign="top">Li, Dawei and Hong, Xiaoyan and Bowman, Jason</td>
     2365</tr>
     2366
     2367<tr>
     2368     <td valign="top">Title</td>
     2369     <td valign="top">Evaluation of Security Vulnerabilities by Using ProtoGENI as a Launchpad</td>
     2370</tr>
     2371
     2372<tr>
     2373     <td valign="top">Booktitle</td>
     2374     <td valign="top">IEEE Global Communications Conference (GLOBECOM 2011)</td>
     2375</tr>
     2376
     2377<tr>
     2378     <td valign="top">Year</td>
     2379     <td valign="top">2011</td>
     2380</tr>
     2381
     2382<tr>
     2383     <td valign="top">Abstract</td>
     2384     <td valign="top">In this paper we analyze the security architecture of ProtoGENI. ProtoGENI is a prototype control framework implementation of GENI (Global Environment for Network Innovations). We perform a variety of experiments in an effort to identify potential vulnerabilities presented in the current implementation. We classify our attacks into three types: data plane to data plane, data plane to control plane, and data plane to Internet. Our results indicate the potential for a breach of confidentiality and availability internally within ProtoGENI, as well as risks to external Internet. We make suggestions outlining possible defense strategies to improve ProtoGENI security and aid in future development</td>
     2385</tr>
     2386
     2387
     2388
     2389
     2390
     2391<tr>
     2392     <td valign="top">URL</td>
     2393     <td valign="top"><a href="ftp://202.38.75.7/pub/&#x0025;D0&#x0025;C2&#x0025;CE&#x0025;C4&#x0025;BC&#x0025;FE&#x0025;BC&#x0025;D0&#x0025;20(2)/DATA/PID1102190.PDF">ftp://202.38.75.7/pub/&#x0025;D0&#x0025;C2&#x0025;CE&#x0025;C4&#x0025;BC&#x0025;FE&#x0025;BC&#x0025;D0&#x0025;20(2)/DATA/PID1102190.PDF</a></td>
    23262394</tr>
    23272395
    … …  
    23332401
    23342402<a class="EntryGoto" id="Li, Ting and Van Vorst, Nathanael and Rong, Rong and Liu, Jason"></a>
    2335 <b class="myheading" style="position: relative; left: 10%;">Li, Ting and Van Vorst, Nathanael and Rong, Rong and Liu, Jason</b>
    2336 
    2337 <div class="BibEntry">
    2338 
    2339 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2340 
    2341 
    2342 <tr>
    2343      <td>Author</td>
    2344      <td>Li, Ting and Van Vorst, Nathanael and Rong, Rong and Liu, Jason</td>
    2345 </tr>
    2346 
    2347 <tr>
    2348      <td>Title</td>
    2349      <td>Simulation studies of OpenFlow-based in-network caching strategies</td>
    2350 </tr>
    2351 
    2352 <tr>
    2353      <td>Booktitle</td>
    2354      <td>Proceedings of the 15th Communications and Networking Simulation Symposium</td>
    2355 </tr>
    2356 
    2357 <tr>
    2358      <td>Location</td>
    2359      <td>Orlando, Florida</td>
    2360 </tr>
    2361 
    2362 <tr>
    2363      <td>Publisher</td>
    2364      <td>Society for Computer Simulation International</td>
    2365 </tr>
    2366 
    2367 <tr>
    2368      <td>Address</td>
    2369      <td>San Diego, CA, USA</td>
    2370 </tr>
    2371 
    2372 <tr>
    2373      <td>Year</td>
    2374      <td>2012</td>
    2375 </tr>
    2376 
    2377 <tr>
    2378      <td>Abstract</td>
    2379      <td>We propose an in-network caching architecture using Open-Flow to coordinate caching decisions in the network. Our scheme, called CacheFlow, extends the cache-and-forward concept by moving contents closer to the clients hop-by-hop using TCP for sending requests and retrieving contents. As such, CacheFlow can be incrementally implemented and deployed in the real network. In this paper, we present a simulation study of several caching policies, including a random cache policy, a statically optimal cache placement policy and a new disk placement strategy that places popular contents at the &#x63;&#x0308;enter&#x20;&#x0308;of the network. Experimental results show that simple in-network caching policies can be realized using today's technology to improve network performance.</td>
    2380 </tr>
    2381 
    2382 
    2383 
    2384 
    2385 
    2386 <tr>
    2387      <td>URL</td>
    2388      <td><a href="http://portal.acm.org/citation.cfm?id=2331762.2331774">http://portal.acm.org/citation.cfm?id=2331762.2331774</a></td>
     2403<b class="myheading" style="position: relative; left: 5%;">Li, Ting and Van Vorst, Nathanael and Rong, Rong and Liu, Jason</b>
     2404
     2405<div class="BibEntry">
     2406
     2407<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2408
     2409
     2410<tr>
     2411     <td valign="top">Author</td>
     2412     <td valign="top">Li, Ting and Van Vorst, Nathanael and Rong, Rong and Liu, Jason</td>
     2413</tr>
     2414
     2415<tr>
     2416     <td valign="top">Title</td>
     2417     <td valign="top">Simulation studies of OpenFlow-based in-network caching strategies</td>
     2418</tr>
     2419
     2420<tr>
     2421     <td valign="top">Booktitle</td>
     2422     <td valign="top">Proceedings of the 15th Communications and Networking Simulation Symposium</td>
     2423</tr>
     2424
     2425<tr>
     2426     <td valign="top">Location</td>
     2427     <td valign="top">Orlando, Florida</td>
     2428</tr>
     2429
     2430<tr>
     2431     <td valign="top">Publisher</td>
     2432     <td valign="top">Society for Computer Simulation International</td>
     2433</tr>
     2434
     2435<tr>
     2436     <td valign="top">Address</td>
     2437     <td valign="top">San Diego, CA, USA</td>
     2438</tr>
     2439
     2440<tr>
     2441     <td valign="top">Year</td>
     2442     <td valign="top">2012</td>
     2443</tr>
     2444
     2445<tr>
     2446     <td valign="top">Abstract</td>
     2447     <td valign="top">We propose an in-network caching architecture using Open-Flow to coordinate caching decisions in the network. Our scheme, called CacheFlow, extends the cache-and-forward concept by moving contents closer to the clients hop-by-hop using TCP for sending requests and retrieving contents. As such, CacheFlow can be incrementally implemented and deployed in the real network. In this paper, we present a simulation study of several caching policies, including a random cache policy, a statically optimal cache placement policy and a new disk placement strategy that places popular contents at the &#x63;&#x0308;enter&#x20;&#x0308;of the network. Experimental results show that simple in-network caching policies can be realized using today's technology to improve network performance.</td>
     2448</tr>
     2449
     2450
     2451
     2452
     2453
     2454<tr>
     2455     <td valign="top">URL</td>
     2456     <td valign="top"><a href="http://portal.acm.org/citation.cfm?id=2331762.2331774">http://portal.acm.org/citation.cfm?id=2331762.2331774</a></td>
    23892457</tr>
    23902458
    … …  
    23962464
    23972465<a class="EntryGoto" id="Liu, Jun and O'Neil, Thomas and Desell, Travis and Carlson, Ross"></a>
    2398 <b class="myheading" style="position: relative; left: 10%;">Liu, Jun and O'Neil, Thomas and Desell, Travis and Carlson, Ross</b>
    2399 
    2400 <div class="BibEntry">
    2401 
    2402 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2403 
    2404 
    2405 <tr>
    2406      <td>Author</td>
    2407      <td>Liu, Jun and O'Neil, Thomas and Desell, Travis and Carlson, Ross</td>
    2408 </tr>
    2409 
    2410 <tr>
    2411      <td>Title</td>
    2412      <td>Work-in-Progress: Empirical Verification of A Subset Sum Hypothesis in GENI Cloud</td>
    2413 </tr>
    2414 
    2415 <tr>
    2416      <td>Booktitle</td>
    2417      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    2418 </tr>
    2419 
    2420 <tr>
    2421      <td>Location</td>
    2422      <td>Los Angeles</td>
    2423 </tr>
    2424 
    2425 <tr>
    2426      <td>Year</td>
    2427      <td>2012</td>
     2466<b class="myheading" style="position: relative; left: 5%;">Liu, Jun and O'Neil, Thomas and Desell, Travis and Carlson, Ross</b>
     2467
     2468<div class="BibEntry">
     2469
     2470<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2471
     2472
     2473<tr>
     2474     <td valign="top">Author</td>
     2475     <td valign="top">Liu, Jun and O'Neil, Thomas and Desell, Travis and Carlson, Ross</td>
     2476</tr>
     2477
     2478<tr>
     2479     <td valign="top">Title</td>
     2480     <td valign="top">Work-in-Progress: Empirical Verification of A Subset Sum Hypothesis in GENI Cloud</td>
     2481</tr>
     2482
     2483<tr>
     2484     <td valign="top">Booktitle</td>
     2485     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     2486</tr>
     2487
     2488<tr>
     2489     <td valign="top">Location</td>
     2490     <td valign="top">Los Angeles</td>
     2491</tr>
     2492
     2493<tr>
     2494     <td valign="top">Year</td>
     2495     <td valign="top">2012</td>
    24282496</tr>
    24292497
    … …  
    24392507
    24402508<a class="EntryGoto" id="Luna, Nicholas and Shetty, Sachin and Rogers, Tamara and Xiong, Kaiqi"></a>
    2441 <b class="myheading" style="position: relative; left: 10%;">Luna, Nicholas and Shetty, Sachin and Rogers, Tamara and Xiong, Kaiqi</b>
    2442 
    2443 <div class="BibEntry">
    2444 
    2445 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2446 
    2447 
    2448 <tr>
    2449      <td>Author</td>
    2450      <td>Luna, Nicholas and Shetty, Sachin and Rogers, Tamara and Xiong, Kaiqi</td>
    2451 </tr>
    2452 
    2453 <tr>
    2454      <td>Title</td>
    2455      <td>Assessment of Router Vulnerabilities on PlanetLab Infrastructure for Secure Cloud Computing</td>
    2456 </tr>
    2457 
    2458 <tr>
    2459      <td>Booktitle</td>
    2460      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    2461 </tr>
    2462 
    2463 <tr>
    2464      <td>Location</td>
    2465      <td>Los Angeles</td>
    2466 </tr>
    2467 
    2468 <tr>
    2469      <td>Year</td>
    2470      <td>2012</td>
    2471 </tr>
    2472 
    2473 <tr>
    2474      <td>Abstract</td>
    2475      <td>In recent times, the cloud computing based delivery model has been proven to reduce enterprise IT costs and complexities. In contrast to traditional enterprise IT solutions, the cloud computing model moves the application software and data to remote servers in large datacenters, which raises many security challenges. One of the critical challenges is the inability to characterize the impact of the vulnerabilities of routers on the cloud security and performance guarantees. In this paper, we analyze the degree of security provided by routers to data sharing applications deployed in cloud environments that span administrative and network domains. Our analysis is based on examining the security level of network applications on routers which lie between nodes on Planetlab infrastructure. We assume that some of the PlanetLab nodes will share the same wide area network path as the cloud servers. Our preliminary results confirm that the majority of the routers are plagued by insecure network protocols, leading to vulnerable routers. These results confirm our hypothesis that the security of the network infrastructure needs to be upgraded to assure the protection of information exchanged on the wide area network path.</td>
     2509<b class="myheading" style="position: relative; left: 5%;">Luna, Nicholas and Shetty, Sachin and Rogers, Tamara and Xiong, Kaiqi</b>
     2510
     2511<div class="BibEntry">
     2512
     2513<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2514
     2515
     2516<tr>
     2517     <td valign="top">Author</td>
     2518     <td valign="top">Luna, Nicholas and Shetty, Sachin and Rogers, Tamara and Xiong, Kaiqi</td>
     2519</tr>
     2520
     2521<tr>
     2522     <td valign="top">Title</td>
     2523     <td valign="top">Assessment of Router Vulnerabilities on PlanetLab Infrastructure for Secure Cloud Computing</td>
     2524</tr>
     2525
     2526<tr>
     2527     <td valign="top">Booktitle</td>
     2528     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     2529</tr>
     2530
     2531<tr>
     2532     <td valign="top">Location</td>
     2533     <td valign="top">Los Angeles</td>
     2534</tr>
     2535
     2536<tr>
     2537     <td valign="top">Year</td>
     2538     <td valign="top">2012</td>
     2539</tr>
     2540
     2541<tr>
     2542     <td valign="top">Abstract</td>
     2543     <td valign="top">In recent times, the cloud computing based delivery model has been proven to reduce enterprise IT costs and complexities. In contrast to traditional enterprise IT solutions, the cloud computing model moves the application software and data to remote servers in large datacenters, which raises many security challenges. One of the critical challenges is the inability to characterize the impact of the vulnerabilities of routers on the cloud security and performance guarantees. In this paper, we analyze the degree of security provided by routers to data sharing applications deployed in cloud environments that span administrative and network domains. Our analysis is based on examining the security level of network applications on routers which lie between nodes on Planetlab infrastructure. We assume that some of the PlanetLab nodes will share the same wide area network path as the cloud servers. Our preliminary results confirm that the majority of the routers are plagued by insecure network protocols, leading to vulnerable routers. These results confirm our hypothesis that the security of the network infrastructure needs to be upgraded to assure the protection of information exchanged on the wide area network path.</td>
    24762544</tr>
    24772545
    … …  
    24872555
    24882556<a class="EntryGoto" id="Maccherani, E. and Femminella, M. and Lee, J. W. and Francescangeli, R. and Janak, J. and Reali, G. and Schulzrinne, H."></a>
    2489 <b class="myheading" style="position: relative; left: 10%;">Maccherani, E. and Femminella, M. and Lee, J. W. and Francescangeli, R. and Janak, J. and Reali, G. and Schulzrinne, H.</b>
    2490 
    2491 <div class="BibEntry">
    2492 
    2493 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2494 
    2495 
    2496 <tr>
    2497      <td>Author</td>
    2498      <td>Maccherani, E. and Femminella, M. and Lee, J. W. and Francescangeli, R. and Janak, J. and Reali, G. and Schulzrinne, H.</td>
    2499 </tr>
    2500 
    2501 <tr>
    2502      <td>Title</td>
    2503      <td>Extending the NetServ autonomic management capabilities using OpenFlow</td>
    2504 </tr>
    2505 
    2506 <tr>
    2507      <td>Booktitle</td>
    2508      <td>2012 IEEE Network Operations and Management Symposium</td>
    2509 </tr>
    2510 
    2511 <tr>
    2512      <td>Location</td>
    2513      <td>Maui, HI</td>
    2514 </tr>
    2515 
    2516 <tr>
    2517      <td>Publisher</td>
    2518      <td>IEEE</td>
    2519 </tr>
    2520 
    2521 <tr>
    2522      <td>Year</td>
    2523      <td>2012</td>
    2524 </tr>
    2525 
    2526 <tr>
    2527      <td>Abstract</td>
    2528      <td>Autonomic management capabilities of the Future Internet can be provided through a recently proposed service architecture called NetServ. It consists of the interconnection of programmable nodes which enable dynamic deployment and execution of network and application services. This paper shows how this architecture can be further improved by introducing the OpenFlow architecture and implementing the OpenFlow controller as a NetServ service, thus improving both the NetServ management performance and its flexibility. These achievements are demonstrated experimentally on the GENI environment, showing the platform self-protecting capabilities in case of a SIP DoS attack.</td>
    2529 </tr>
    2530 
    2531 
    2532 
    2533 <tr>
    2534      <td>DOI</td>
    2535      <td>10.1109/NOMS.2012.6211961</td>
    2536 </tr>
    2537 
    2538 
    2539 
    2540 <tr>
    2541      <td>URL</td>
    2542      <td><a href="http://dx.doi.org/10.1109/NOMS.2012.6211961">http://dx.doi.org/10.1109/NOMS.2012.6211961</a></td>
     2557<b class="myheading" style="position: relative; left: 5%;">Maccherani, E. and Femminella, M. and Lee, J. W. and Francescangeli, R. and Janak, J. and Reali, G. and Schulzrinne, H.</b>
     2558
     2559<div class="BibEntry">
     2560
     2561<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2562
     2563
     2564<tr>
     2565     <td valign="top">Author</td>
     2566     <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>
     2567</tr>
     2568
     2569<tr>
     2570     <td valign="top">Title</td>
     2571     <td valign="top">Extending the NetServ autonomic management capabilities using OpenFlow</td>
     2572</tr>
     2573
     2574<tr>
     2575     <td valign="top">Booktitle</td>
     2576     <td valign="top">2012 IEEE Network Operations and Management Symposium</td>
     2577</tr>
     2578
     2579<tr>
     2580     <td valign="top">Location</td>
     2581     <td valign="top">Maui, HI</td>
     2582</tr>
     2583
     2584<tr>
     2585     <td valign="top">Publisher</td>
     2586     <td valign="top">IEEE</td>
     2587</tr>
     2588
     2589<tr>
     2590     <td valign="top">Year</td>
     2591     <td valign="top">2012</td>
     2592</tr>
     2593
     2594<tr>
     2595     <td valign="top">Abstract</td>
     2596     <td valign="top">Autonomic management capabilities of the Future Internet can be provided through a recently proposed service architecture called NetServ. It consists of the interconnection of programmable nodes which enable dynamic deployment and execution of network and application services. This paper shows how this architecture can be further improved by introducing the OpenFlow architecture and implementing the OpenFlow controller as a NetServ service, thus improving both the NetServ management performance and its flexibility. These achievements are demonstrated experimentally on the GENI environment, showing the platform self-protecting capabilities in case of a SIP DoS attack.</td>
     2597</tr>
     2598
     2599
     2600
     2601<tr>
     2602     <td valign="top">DOI</td>
     2603     <td valign="top">10.1109/NOMS.2012.6211961</td>
     2604</tr>
     2605
     2606
     2607
     2608<tr>
     2609     <td valign="top">URL</td>
     2610     <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>
    25432611</tr>
    25442612
    … …  
    25502618
    25512619<a class="EntryGoto" id="Mahindra, R. and Bhanage, G. D. and Hadjichristofi, G. and Seskar, I. and Raychaudhuri, D. and Zhang, Y. Y."></a>
    2552 <b class="myheading" style="position: relative; left: 10%;">Mahindra, R. and Bhanage, G. D. and Hadjichristofi, G. and Seskar, I. and Raychaudhuri, D. and Zhang, Y. Y.</b>
    2553 
    2554 <div class="BibEntry">
    2555 
    2556 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2557 
    2558 
    2559 <tr>
    2560      <td>Author</td>
    2561      <td>Mahindra, R. and Bhanage, G. D. and Hadjichristofi, G. and Seskar, I. and Raychaudhuri, D. and Zhang, Y. Y.</td>
    2562 </tr>
    2563 
    2564 <tr>
    2565      <td>Title</td>
    2566      <td>Space Versus Time Separation for Wireless Virtualization on an Indoor Grid</td>
    2567 </tr>
    2568 
    2569 <tr>
    2570      <td>Booktitle</td>
    2571      <td>Next Generation Internet Networks, 2008. NGI 2008</td>
    2572 </tr>
    2573 
    2574 <tr>
    2575      <td>Publisher</td>
    2576      <td>IEEE</td>
    2577 </tr>
    2578 
    2579 <tr>
    2580      <td>Year</td>
    2581      <td>2008</td>
    2582 </tr>
    2583 
    2584 <tr>
    2585      <td>Abstract</td>
    2586      <td>The decreasing cost of wireless hardware and ever increasing number of wireless testbeds has led to a shift in the protocol evaluation paradigm from simulations towards emulation. In addition, with a large number of users demanding experimental resources and lack of space and time for deploying more hardware, fair resource sharing among independent co-existing experiments is important. We study the proposed approaches to wireless virtualization with a focus on schemes conserving wireless channels rather than nodes. Our detailed comparison reveals that while experiments sharing a channel by space separation achieve better efficiency than those relying on time separation of a channel, the isolation between experiments in both cases is comparable. We propose and implement a policy manager to alleviate the isolation problem and suggest scenarios in which either of the schemes would provide a suitable virtualization solution.</td>
    2587 </tr>
    2588 
    2589 
    2590 
    2591 <tr>
    2592      <td>DOI</td>
    2593      <td>10.1109/NGI.2008.36</td>
    2594 </tr>
    2595 
    2596 
    2597 
    2598 <tr>
    2599      <td>URL</td>
    2600      <td><a href="http://dx.doi.org/10.1109/NGI.2008.36">http://dx.doi.org/10.1109/NGI.2008.36</a></td>
     2620<b class="myheading" style="position: relative; left: 5%;">Mahindra, R. and Bhanage, G. D. and Hadjichristofi, G. and Seskar, I. and Raychaudhuri, D. and Zhang, Y. Y.</b>
     2621
     2622<div class="BibEntry">
     2623
     2624<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2625
     2626
     2627<tr>
     2628     <td valign="top">Author</td>
     2629     <td valign="top">Mahindra, R. and Bhanage, G. D. and Hadjichristofi, G. and Seskar, I. and Raychaudhuri, D. and Zhang, Y. Y.</td>
     2630</tr>
     2631
     2632<tr>
     2633     <td valign="top">Title</td>
     2634     <td valign="top">Space Versus Time Separation for Wireless Virtualization on an Indoor Grid</td>
     2635</tr>
     2636
     2637<tr>
     2638     <td valign="top">Booktitle</td>
     2639     <td valign="top">Next Generation Internet Networks, 2008. NGI 2008</td>
     2640</tr>
     2641
     2642<tr>
     2643     <td valign="top">Publisher</td>
     2644     <td valign="top">IEEE</td>
     2645</tr>
     2646
     2647<tr>
     2648     <td valign="top">Year</td>
     2649     <td valign="top">2008</td>
     2650</tr>
     2651
     2652<tr>
     2653     <td valign="top">Abstract</td>
     2654     <td valign="top">The decreasing cost of wireless hardware and ever increasing number of wireless testbeds has led to a shift in the protocol evaluation paradigm from simulations towards emulation. In addition, with a large number of users demanding experimental resources and lack of space and time for deploying more hardware, fair resource sharing among independent co-existing experiments is important. We study the proposed approaches to wireless virtualization with a focus on schemes conserving wireless channels rather than nodes. Our detailed comparison reveals that while experiments sharing a channel by space separation achieve better efficiency than those relying on time separation of a channel, the isolation between experiments in both cases is comparable. We propose and implement a policy manager to alleviate the isolation problem and suggest scenarios in which either of the schemes would provide a suitable virtualization solution.</td>
     2655</tr>
     2656
     2657
     2658
     2659<tr>
     2660     <td valign="top">DOI</td>
     2661     <td valign="top">10.1109/NGI.2008.36</td>
     2662</tr>
     2663
     2664
     2665
     2666<tr>
     2667     <td valign="top">URL</td>
     2668     <td valign="top"><a href="http://dx.doi.org/10.1109/NGI.2008.36">http://dx.doi.org/10.1109/NGI.2008.36</a></td>
    26012669</tr>
    26022670
    … …  
    26082676
    26092677<a class="EntryGoto" id="Mahindra, R. and Bhanage, G. and Hadjichristofi, G. and Ganu, S. and Kamat, P. and Seskar, I. and Raychaudhuri, D."></a>
    2610 <b class="myheading" style="position: relative; left: 10%;">Mahindra, R. and Bhanage, G. and Hadjichristofi, G. and Ganu, S. and Kamat, P. and Seskar, I. and Raychaudhuri, D.</b>
    2611 
    2612 <div class="BibEntry">
    2613 
    2614 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2615 
    2616 
    2617 <tr>
    2618      <td>Author</td>
    2619      <td>Mahindra, R. and Bhanage, G. and Hadjichristofi, G. and Ganu, S. and Kamat, P. and Seskar, I. and Raychaudhuri, D.</td>
    2620 </tr>
    2621 
    2622 <tr>
    2623      <td>Title</td>
    2624      <td>Integration of heterogeneous networking testbeds</td>
    2625 </tr>
    2626 
    2627 <tr>
    2628      <td>Booktitle</td>
    2629      <td>Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks &#x0026; communities</td>
    2630 </tr>
    2631 
    2632 <tr>
    2633      <td>Location</td>
    2634      <td>Innsbruck, Austria</td>
    2635 </tr>
    2636 
    2637 <tr>
    2638      <td>Publisher</td>
    2639      <td>ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)</td>
    2640 </tr>
    2641 
    2642 <tr>
    2643      <td>Address</td>
    2644      <td>ICST, Brussels, Belgium, Belgium</td>
    2645 </tr>
    2646 
    2647 <tr>
    2648      <td>Year</td>
    2649      <td>2008</td>
    2650 </tr>
    2651 
    2652 <tr>
    2653      <td>Abstract</td>
    2654      <td>As networking research expands into new frontiers, the research community has felt a need for a heterogeneous networking research infrastructure to experiment with the interaction and integration of different types of networks, and to test the performance of various networking protocols in realistic environments. This requirement has led to the Global Environment for Network Innovations (GENI) initiative to create a global infrastructure for conducting networking experiments across diverse substrates such as wired (local and wide-area), wireless, sensor and cellular networks. In this paper, we discuss and present two models for building such an experimental infrastructure. The first model enables a wired testbed to link with wireless edge nodes during an experiment, whereas the second model enables a wireless testbed to link to wired testbeds. Proof-of-concept experiments are also presented reinforcing the usefulness of the models in terms of facilitating experiments over the integrated heterogeneous infrastructure.</td>
    2655 </tr>
    2656 
    2657 
    2658 
    2659 
    2660 
    2661 <tr>
    2662      <td>URL</td>
    2663      <td><a href="http://portal.acm.org/citation.cfm?id=1390609">http://portal.acm.org/citation.cfm?id=1390609</a></td>
     2678<b class="myheading" style="position: relative; left: 5%;">Mahindra, R. and Bhanage, G. and Hadjichristofi, G. and Ganu, S. and Kamat, P. and Seskar, I. and Raychaudhuri, D.</b>
     2679
     2680<div class="BibEntry">
     2681
     2682<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2683
     2684
     2685<tr>
     2686     <td valign="top">Author</td>
     2687     <td valign="top">Mahindra, R. and Bhanage, G. and Hadjichristofi, G. and Ganu, S. and Kamat, P. and Seskar, I. and Raychaudhuri, D.</td>
     2688</tr>
     2689
     2690<tr>
     2691     <td valign="top">Title</td>
     2692     <td valign="top">Integration of heterogeneous networking testbeds</td>
     2693</tr>
     2694
     2695<tr>
     2696     <td valign="top">Booktitle</td>
     2697     <td valign="top">Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks &#x0026; communities</td>
     2698</tr>
     2699
     2700<tr>
     2701     <td valign="top">Location</td>
     2702     <td valign="top">Innsbruck, Austria</td>
     2703</tr>
     2704
     2705<tr>
     2706     <td valign="top">Publisher</td>
     2707     <td valign="top">ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)</td>
     2708</tr>
     2709
     2710<tr>
     2711     <td valign="top">Address</td>
     2712     <td valign="top">ICST, Brussels, Belgium, Belgium</td>
     2713</tr>
     2714
     2715<tr>
     2716     <td valign="top">Year</td>
     2717     <td valign="top">2008</td>
     2718</tr>
     2719
     2720<tr>
     2721     <td valign="top">Abstract</td>
     2722     <td valign="top">As networking research expands into new frontiers, the research community has felt a need for a heterogeneous networking research infrastructure to experiment with the interaction and integration of different types of networks, and to test the performance of various networking protocols in realistic environments. This requirement has led to the Global Environment for Network Innovations (GENI) initiative to create a global infrastructure for conducting networking experiments across diverse substrates such as wired (local and wide-area), wireless, sensor and cellular networks. In this paper, we discuss and present two models for building such an experimental infrastructure. The first model enables a wired testbed to link with wireless edge nodes during an experiment, whereas the second model enables a wireless testbed to link to wired testbeds. Proof-of-concept experiments are also presented reinforcing the usefulness of the models in terms of facilitating experiments over the integrated heterogeneous infrastructure.</td>
     2723</tr>
     2724
     2725
     2726
     2727
     2728
     2729<tr>
     2730     <td valign="top">URL</td>
     2731     <td valign="top"><a href="http://portal.acm.org/citation.cfm?id=1390609">http://portal.acm.org/citation.cfm?id=1390609</a></td>
    26642732</tr>
    26652733
    … …  
    26712739
    26722740<a class="EntryGoto" id="Mandvekar, Lokesh and Sathyaraja, Anandatirtha and Qiao, Chunming"></a>
    2673 <b class="myheading" style="position: relative; left: 10%;">Mandvekar, Lokesh and Sathyaraja, Anandatirtha and Qiao, Chunming</b>
    2674 
    2675 <div class="BibEntry">
    2676 
    2677 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2678 
    2679 
    2680 <tr>
    2681      <td>Author</td>
    2682      <td>Mandvekar, Lokesh and Sathyaraja, Anandatirtha and Qiao, Chunming</td>
    2683 </tr>
    2684 
    2685 <tr>
    2686      <td>Title</td>
    2687      <td>Socially Aware Single System Images</td>
    2688 </tr>
    2689 
    2690 <tr>
    2691      <td>Booktitle</td>
    2692      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    2693 </tr>
    2694 
    2695 <tr>
    2696      <td>Location</td>
    2697      <td>Los Angeles</td>
    2698 </tr>
    2699 
    2700 <tr>
    2701      <td>Year</td>
    2702      <td>2012</td>
    2703 </tr>
    2704 
    2705 <tr>
    2706      <td>Abstract</td>
    2707      <td>Cloud computing enables users to get access to huge amounts of computing resources as desired. There are many popular commercial cloud service providers which provide resources to users at a price. These providers can not be trusted as far as privacy of data is concerned. On the other hand, people do trust their close friends, relatives and other social contacts, albeit, to varying degrees. This paper reports the work-in-progress on S3I(Socially Aware Single System Images) which allows users to form computing clusters using resources owned by their social contacts. It tries to utilize the trust found between people in real life and translate it to provide trustworthy resource sharing between them.</td>
     2741<b class="myheading" style="position: relative; left: 5%;">Mandvekar, Lokesh and Sathyaraja, Anandatirtha and Qiao, Chunming</b>
     2742
     2743<div class="BibEntry">
     2744
     2745<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2746
     2747
     2748<tr>
     2749     <td valign="top">Author</td>
     2750     <td valign="top">Mandvekar, Lokesh and Sathyaraja, Anandatirtha and Qiao, Chunming</td>
     2751</tr>
     2752
     2753<tr>
     2754     <td valign="top">Title</td>
     2755     <td valign="top">Socially Aware Single System Images</td>
     2756</tr>
     2757
     2758<tr>
     2759     <td valign="top">Booktitle</td>
     2760     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     2761</tr>
     2762
     2763<tr>
     2764     <td valign="top">Location</td>
     2765     <td valign="top">Los Angeles</td>
     2766</tr>
     2767
     2768<tr>
     2769     <td valign="top">Year</td>
     2770     <td valign="top">2012</td>
     2771</tr>
     2772
     2773<tr>
     2774     <td valign="top">Abstract</td>
     2775     <td valign="top">Cloud computing enables users to get access to huge amounts of computing resources as desired. There are many popular commercial cloud service providers which provide resources to users at a price. These providers can not be trusted as far as privacy of data is concerned. On the other hand, people do trust their close friends, relatives and other social contacts, albeit, to varying degrees. This paper reports the work-in-progress on S3I(Socially Aware Single System Images) which allows users to form computing clusters using resources owned by their social contacts. It tries to utilize the trust found between people in real life and translate it to provide trustworthy resource sharing between them.</td>
    27082776</tr>
    27092777
    … …  
    27192787
    27202788<a class="EntryGoto" id="Maziku, Hellen and Shetty, Sachin and Rogers, Tamara"></a>
    2721 <b class="myheading" style="position: relative; left: 10%;">Maziku, Hellen and Shetty, Sachin and Rogers, Tamara</b>
    2722 
    2723 <div class="BibEntry">
    2724 
    2725 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2726 
    2727 
    2728 <tr>
    2729      <td>Author</td>
    2730      <td>Maziku, Hellen and Shetty, Sachin and Rogers, Tamara</td>
    2731 </tr>
    2732 
    2733 <tr>
    2734      <td>Title</td>
    2735      <td>Measurement-based IP Geolocation of Routers on Planetlab Infrastructure</td>
    2736 </tr>
    2737 
    2738 <tr>
    2739      <td>Booktitle</td>
    2740      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    2741 </tr>
    2742 
    2743 <tr>
    2744      <td>Location</td>
    2745      <td>Los Angeles</td>
    2746 </tr>
    2747 
    2748 <tr>
    2749      <td>Year</td>
    2750      <td>2012</td>
    2751 </tr>
    2752 
    2753 <tr>
    2754      <td>Abstract</td>
    2755      <td>Location aware applications can benefit from a more accurate yet robust IP geolocation framework. Various approaches to IP geolocation have been well documented. The most recent approach casts IP geolocation as a machine learn- ing classification problem. This approach makes it possible to incorporate both delay and non delay based information. The accuracy of IP geolocation can be improved by incorporating additional types of geolocation information rather relying on network delay alone. To enhance the classification accuracy of the existing classification framework, we expand it to include 6 features (3 of which are novel). We use PlanetLab as a testbed to generate our measurement set. We select 67 PlanetLab nodes within the United States with known geographic location as our landmarks. We test the accuracy of our framework on 23,843 routers given ping measurements from the 67 landmarks. With only three features (average delay, average hops and population density) tested, our new classifier gives a reduced average error distance of 157.81 miles and a median error distance of 0 miles, compared to the present classifier that gives an average error distance of 253.34 miles. This is very promising as we move on to the next phase of incorporating data for the remaining 5 features. To the best of our knowledge, this is the first proposed framework that aims to improve the accuracy of the present classifier based IP geolocation.</td>
     2789<b class="myheading" style="position: relative; left: 5%;">Maziku, Hellen and Shetty, Sachin and Rogers, Tamara</b>
     2790
     2791<div class="BibEntry">
     2792
     2793<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2794
     2795
     2796<tr>
     2797     <td valign="top">Author</td>
     2798     <td valign="top">Maziku, Hellen and Shetty, Sachin and Rogers, Tamara</td>
     2799</tr>
     2800
     2801<tr>
     2802     <td valign="top">Title</td>
     2803     <td valign="top">Measurement-based IP Geolocation of Routers on Planetlab Infrastructure</td>
     2804</tr>
     2805
     2806<tr>
     2807     <td valign="top">Booktitle</td>
     2808     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     2809</tr>
     2810
     2811<tr>
     2812     <td valign="top">Location</td>
     2813     <td valign="top">Los Angeles</td>
     2814</tr>
     2815
     2816<tr>
     2817     <td valign="top">Year</td>
     2818     <td valign="top">2012</td>
     2819</tr>
     2820
     2821<tr>
     2822     <td valign="top">Abstract</td>
     2823     <td valign="top">Location aware applications can benefit from a more accurate yet robust IP geolocation framework. Various approaches to IP geolocation have been well documented. The most recent approach casts IP geolocation as a machine learn- ing classification problem. This approach makes it possible to incorporate both delay and non delay based information. The accuracy of IP geolocation can be improved by incorporating additional types of geolocation information rather relying on network delay alone. To enhance the classification accuracy of the existing classification framework, we expand it to include 6 features (3 of which are novel). We use PlanetLab as a testbed to generate our measurement set. We select 67 PlanetLab nodes within the United States with known geographic location as our landmarks. We test the accuracy of our framework on 23,843 routers given ping measurements from the 67 landmarks. With only three features (average delay, average hops and population density) tested, our new classifier gives a reduced average error distance of 157.81 miles and a median error distance of 0 miles, compared to the present classifier that gives an average error distance of 253.34 miles. This is very promising as we move on to the next phase of incorporating data for the remaining 5 features. To the best of our knowledge, this is the first proposed framework that aims to improve the accuracy of the present classifier based IP geolocation.</td>
    27562824</tr>
    27572825
    … …  
    27672835
    27682836<a class="EntryGoto" id="Mitroff, Sarah"></a>
    2769 <b class="myheading" style="position: relative; left: 10%;">Mitroff, Sarah</b>
    2770 
    2771 <div class="BibEntry">
    2772 
    2773 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2774 
    2775 
    2776 <tr>
    2777      <td>Author</td>
    2778      <td>Mitroff, Sarah</td>
    2779 </tr>
    2780 
    2781 <tr>
    2782      <td>Title</td>
    2783      <td>Lawrence Landweber Helped Build Today's Internet, Now He's Advising Its Future</td>
    2784 </tr>
    2785 
    2786 <tr>
    2787      <td>Journal</td>
    2788      <td>Wired</td>
    2789 </tr>
    2790 
    2791 <tr>
    2792      <td>Year</td>
    2793      <td>2012</td>
    2794 </tr>
    2795 
    2796 
    2797 
    2798 
    2799 
    2800 <tr>
    2801      <td>URL</td>
    2802      <td><a href="http://www.wired.com/business/2012/08/lawrence-landweber/">http://www.wired.com/business/2012/08/lawrence-landweber/</a></td>
     2837<b class="myheading" style="position: relative; left: 5%;">Mitroff, Sarah</b>
     2838
     2839<div class="BibEntry">
     2840
     2841<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2842
     2843
     2844<tr>
     2845     <td valign="top">Author</td>
     2846     <td valign="top">Mitroff, Sarah</td>
     2847</tr>
     2848
     2849<tr>
     2850     <td valign="top">Title</td>
     2851     <td valign="top">Lawrence Landweber Helped Build Today's Internet, Now He's Advising Its Future</td>
     2852</tr>
     2853
     2854<tr>
     2855     <td valign="top">Journal</td>
     2856     <td valign="top">Wired</td>
     2857</tr>
     2858
     2859<tr>
     2860     <td valign="top">Year</td>
     2861     <td valign="top">2012</td>
     2862</tr>
     2863
     2864
     2865
     2866
     2867
     2868<tr>
     2869     <td valign="top">URL</td>
     2870     <td valign="top"><a href="http://www.wired.com/business/2012/08/lawrence-landweber/">http://www.wired.com/business/2012/08/lawrence-landweber/</a></td>
    28032871</tr>
    28042872
    … …  
    28102878
    28112879<a class="EntryGoto" id="Muhammad, Monzur and Cappos, Justin"></a>
    2812 <b class="myheading" style="position: relative; left: 10%;">Muhammad, Monzur and Cappos, Justin</b>
    2813 
    2814 <div class="BibEntry">
    2815 
    2816 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2817 
    2818 
    2819 <tr>
    2820      <td>Author</td>
    2821      <td>Muhammad, Monzur and Cappos, Justin</td>
    2822 </tr>
    2823 
    2824 <tr>
    2825      <td>Title</td>
    2826      <td>Towards a Representive Testbed: Harnessing Volunteers for Networks Research</td>
    2827 </tr>
    2828 
    2829 <tr>
    2830      <td>Booktitle</td>
    2831      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    2832 </tr>
    2833 
    2834 <tr>
    2835      <td>Location</td>
    2836      <td>Los Angeles</td>
    2837 </tr>
    2838 
    2839 <tr>
    2840      <td>Year</td>
    2841      <td>2012</td>
    2842 </tr>
    2843 
    2844 <tr>
    2845      <td>Abstract</td>
    2846      <td>A steady rise in home systems has been seen over the past few years. As more systems are designed and deployed, an appropriate testbed is required to test these systems. Sev- eral systems exist, such as PlanetLab, that currently provide a networking testbed allowing researchers and developers to test and measure various applications. However in the long run such testbeds will be unable to keep up and meet all the demands of many of the large scale modern day peer-to-peer systems. We outline the various challenges and essentials of a networking testbed and we provide an alternate network- ing testbed that is driven by resources that are voluntarily contributed. We talk about the various advantages and dis- advantages of the Seattle system, an open source peer-to- peer computing testbed that has the potential to meet these demands. The testbed is composed of sandboxed resources that are donated by volunteers. Seattle has been deployed for about three years and supports many researchers who are interested in a networking testbed. The testbed consists of over 4100 nodes and is constantly growing. Seattle looks to grow and meet the demands of networking testbeds as they are made.</td>
     2880<b class="myheading" style="position: relative; left: 5%;">Muhammad, Monzur and Cappos, Justin</b>
     2881
     2882<div class="BibEntry">
     2883
     2884<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2885
     2886
     2887<tr>
     2888     <td valign="top">Author</td>
     2889     <td valign="top">Muhammad, Monzur and Cappos, Justin</td>
     2890</tr>
     2891
     2892<tr>
     2893     <td valign="top">Title</td>
     2894     <td valign="top">Towards a Representive Testbed: Harnessing Volunteers for Networks Research</td>
     2895</tr>
     2896
     2897<tr>
     2898     <td valign="top">Booktitle</td>
     2899     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     2900</tr>
     2901
     2902<tr>
     2903     <td valign="top">Location</td>
     2904     <td valign="top">Los Angeles</td>
     2905</tr>
     2906
     2907<tr>
     2908     <td valign="top">Year</td>
     2909     <td valign="top">2012</td>
     2910</tr>
     2911
     2912<tr>
     2913     <td valign="top">Abstract</td>
     2914     <td valign="top">A steady rise in home systems has been seen over the past few years. As more systems are designed and deployed, an appropriate testbed is required to test these systems. Sev- eral systems exist, such as PlanetLab, that currently provide a networking testbed allowing researchers and developers to test and measure various applications. However in the long run such testbeds will be unable to keep up and meet all the demands of many of the large scale modern day peer-to-peer systems. We outline the various challenges and essentials of a networking testbed and we provide an alternate network- ing testbed that is driven by resources that are voluntarily contributed. We talk about the various advantages and dis- advantages of the Seattle system, an open source peer-to- peer computing testbed that has the potential to meet these demands. The testbed is composed of sandboxed resources that are donated by volunteers. Seattle has been deployed for about three years and supports many researchers who are interested in a networking testbed. The testbed consists of over 4100 nodes and is constantly growing. Seattle looks to grow and meet the demands of networking testbeds as they are made.</td>
    28472915</tr>
    28482916
    … …  
    28582926
    28592927<a class="EntryGoto" id="Ozcelik, Ilker and Brooks, Richard R."></a>
    2860 <b class="myheading" style="position: relative; left: 10%;">Ozcelik, Ilker and Brooks, Richard R.</b>
    2861 
    2862 <div class="BibEntry">
    2863 
    2864 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2865 
    2866 
    2867 <tr>
    2868      <td>Author</td>
    2869      <td>Ozcelik, Ilker and Brooks, Richard R.</td>
    2870 </tr>
    2871 
    2872 <tr>
    2873      <td>Title</td>
    2874      <td>Security experimentation using operational systems</td>
    2875 </tr>
    2876 
    2877 <tr>
    2878      <td>Booktitle</td>
    2879      <td>Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research</td>
    2880 </tr>
    2881 
    2882 <tr>
    2883      <td>Location</td>
    2884      <td>Oak Ridge, Tennessee</td>
    2885 </tr>
    2886 
    2887 <tr>
    2888      <td>Publisher</td>
    2889      <td>ACM</td>
    2890 </tr>
    2891 
    2892 <tr>
    2893      <td>Address</td>
    2894      <td>New York, NY, USA</td>
    2895 </tr>
    2896 
    2897 <tr>
    2898      <td>Year</td>
    2899      <td>2011</td>
    2900 </tr>
    2901 
    2902 <tr>
    2903      <td>Abstract</td>
    2904      <td>Computers and Internet have evolved into necessary tools for our professional, personal and social lives. As a result of this growing dependence, there is a concern that these systems remain protected and available. This concern increases exponentially when considering systems such as smart power grids. Therefore, research should be conducted to develop effective ways of detecting system anomalies. To have realistic results, the studies should be tested on real systems. However, it is not possible to test these experiments on the live network. With the recent collaboration of Universities and research labs, a new experiment test bed has been established. As a result, experiments can now be implemented on real networks. In our study, we design an experiment to analyze Distributed Denial of Service Attacks (DDoS Attack) on a real network with real Internet traffic. The approach that we use in our study can easily be generalized to apply to smart power grids.</td>
    2905 </tr>
    2906 
    2907 
    2908 
    2909 <tr>
    2910      <td>DOI</td>
    2911      <td>10.1145/2179298.2179388</td>
    2912 </tr>
    2913 
    2914 
    2915 
    2916 <tr>
    2917      <td>URL</td>
    2918      <td><a href="http://dx.doi.org/10.1145/2179298.2179388">http://dx.doi.org/10.1145/2179298.2179388</a></td>
    2919 </tr>
    2920 
    2921 
    2922 </table></div><br><br>
    2923 
    2924 
    2925 <div class="BibEntry">
    2926 
    2927 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2928 
    2929 
    2930 <tr>
    2931      <td>Author</td>
    2932      <td>Ozcelik, Ilker and Brooks, Richard R.</td>
    2933 </tr>
    2934 
    2935 <tr>
    2936      <td>Title</td>
    2937      <td>Performance Analysis of DDoS Detection Methods on Real Network</td>
    2938 </tr>
    2939 
    2940 <tr>
    2941      <td>Booktitle</td>
    2942      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    2943 </tr>
    2944 
    2945 <tr>
    2946      <td>Location</td>
    2947      <td>Los Angeles</td>
    2948 </tr>
    2949 
    2950 <tr>
    2951      <td>Year</td>
    2952      <td>2012</td>
    2953 </tr>
    2954 
    2955 <tr>
    2956      <td>Abstract</td>
    2957      <td>Distributed Denial of Service (DDoS) attacks are major security threats to the Internet. The distributed structure of these attacks makes it difficult to distinguish between legitimate and attack traffic, making detection difficult. In addition to this challenge, researchers also have to study and find countermeasures against these attacks without using an operational network for testing, since attacks on operational networks inconvenience users. In this paper, we propose a method to perform DDoS analysis on real hardware using real traffic without jeopardizing the original network. We implement our experiments on the Geni testbed using Openflow. We present results from DDoS detection methods using operational traffic.</td>
     2928<b class="myheading" style="position: relative; left: 5%;">Ozcelik, Ilker and Brooks, Richard R.</b>
     2929
     2930<div class="BibEntry">
     2931
     2932<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2933
     2934
     2935<tr>
     2936     <td valign="top">Author</td>
     2937     <td valign="top">Ozcelik, Ilker and Brooks, Richard R.</td>
     2938</tr>
     2939
     2940<tr>
     2941     <td valign="top">Title</td>
     2942     <td valign="top">Security experimentation using operational systems</td>
     2943</tr>
     2944
     2945<tr>
     2946     <td valign="top">Booktitle</td>
     2947     <td valign="top">Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research</td>
     2948</tr>
     2949
     2950<tr>
     2951     <td valign="top">Location</td>
     2952     <td valign="top">Oak Ridge, Tennessee</td>
     2953</tr>
     2954
     2955<tr>
     2956     <td valign="top">Publisher</td>
     2957     <td valign="top">ACM</td>
     2958</tr>
     2959
     2960<tr>
     2961     <td valign="top">Address</td>
     2962     <td valign="top">New York, NY, USA</td>
     2963</tr>
     2964
     2965<tr>
     2966     <td valign="top">Year</td>
     2967     <td valign="top">2011</td>
     2968</tr>
     2969
     2970<tr>
     2971     <td valign="top">Abstract</td>
     2972     <td valign="top">Computers and Internet have evolved into necessary tools for our professional, personal and social lives. As a result of this growing dependence, there is a concern that these systems remain protected and available. This concern increases exponentially when considering systems such as smart power grids. Therefore, research should be conducted to develop effective ways of detecting system anomalies. To have realistic results, the studies should be tested on real systems. However, it is not possible to test these experiments on the live network. With the recent collaboration of Universities and research labs, a new experiment test bed has been established. As a result, experiments can now be implemented on real networks. In our study, we design an experiment to analyze Distributed Denial of Service Attacks (DDoS Attack) on a real network with real Internet traffic. The approach that we use in our study can easily be generalized to apply to smart power grids.</td>
     2973</tr>
     2974
     2975
     2976
     2977<tr>
     2978     <td valign="top">DOI</td>
     2979     <td valign="top">10.1145/2179298.2179388</td>
     2980</tr>
     2981
     2982
     2983
     2984<tr>
     2985     <td valign="top">URL</td>
     2986     <td valign="top"><a href="http://dx.doi.org/10.1145/2179298.2179388">http://dx.doi.org/10.1145/2179298.2179388</a></td>
     2987</tr>
     2988
     2989
     2990</table></div><br><br>
     2991
     2992
     2993<div class="BibEntry">
     2994
     2995<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     2996
     2997
     2998<tr>
     2999     <td valign="top">Author</td>
     3000     <td valign="top">Ozcelik, Ilker and Brooks, Richard R.</td>
     3001</tr>
     3002
     3003<tr>
     3004     <td valign="top">Title</td>
     3005     <td valign="top">Performance Analysis of DDoS Detection Methods on Real Network</td>
     3006</tr>
     3007
     3008<tr>
     3009     <td valign="top">Booktitle</td>
     3010     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     3011</tr>
     3012
     3013<tr>
     3014     <td valign="top">Location</td>
     3015     <td valign="top">Los Angeles</td>
     3016</tr>
     3017
     3018<tr>
     3019     <td valign="top">Year</td>
     3020     <td valign="top">2012</td>
     3021</tr>
     3022
     3023<tr>
     3024     <td valign="top">Abstract</td>
     3025     <td valign="top">Distributed Denial of Service (DDoS) attacks are major security threats to the Internet. The distributed structure of these attacks makes it difficult to distinguish between legitimate and attack traffic, making detection difficult. In addition to this challenge, researchers also have to study and find countermeasures against these attacks without using an operational network for testing, since attacks on operational networks inconvenience users. In this paper, we propose a method to perform DDoS analysis on real hardware using real traffic without jeopardizing the original network. We implement our experiments on the Geni testbed using Openflow. We present results from DDoS detection methods using operational traffic.</td>
    29583026</tr>
    29593027
    … …  
    29693037
    29703038<a class="EntryGoto" id="Paul, Subharthi and Pan, Jianli and Jain, Raj"></a>
    2971 <b class="myheading" style="position: relative; left: 10%;">Paul, Subharthi and Pan, Jianli and Jain, Raj</b>
    2972 
    2973 <div class="BibEntry">
    2974 
    2975 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    2976 
    2977 
    2978 <tr>
    2979      <td>Author</td>
    2980      <td>Paul, Subharthi and Pan, Jianli and Jain, Raj</td>
    2981 </tr>
    2982 
    2983 <tr>
    2984      <td>Title</td>
    2985      <td>Architectures for the future networks and the next generation Internet: A survey</td>
    2986 </tr>
    2987 
    2988 <tr>
    2989      <td>Journal</td>
    2990      <td>Computer Communications</td>
    2991 </tr>
    2992 
    2993 <tr>
    2994      <td>Publisher</td>
    2995      <td>Elsevier Science Publishers B. V.</td>
    2996 </tr>
    2997 
    2998 <tr>
    2999      <td>Address</td>
    3000      <td>Amsterdam, The Netherlands, The Netherlands</td>
    3001 </tr>
    3002 
    3003 <tr>
    3004      <td>Year</td>
    3005      <td>2011</td>
    3006 </tr>
    3007 
    3008 <tr>
    3009      <td>Abstract</td>
    3010      <td>Networking research funding agencies in USA, Europe, Japan, and other countries are encouraging research on revolutionary networking architectures that may or may not be bound by the restrictions of the current TCP/IP based Internet. We present a comprehensive survey of such research projects and activities. The topics covered include various testbeds for experimentations for new architectures, new security mechanisms, content delivery mechanisms, management and control frameworks, service architectures, and routing mechanisms. Delay/disruption tolerant networks which allow communications even when complete end-to-end path is not available are also discussed.</td>
    3011 </tr>
    3012 
    3013 
    3014 
    3015 <tr>
    3016      <td>DOI</td>
    3017      <td>10.1016/j.comcom.2010.08.001</td>
    3018 </tr>
    3019 
    3020 
    3021 
    3022 <tr>
    3023      <td>URL</td>
    3024      <td><a href="http://dx.doi.org/10.1016/j.comcom.2010.08.001">http://dx.doi.org/10.1016/j.comcom.2010.08.001</a></td>
     3039<b class="myheading" style="position: relative; left: 5%;">Paul, Subharthi and Pan, Jianli and Jain, Raj</b>
     3040
     3041<div class="BibEntry">
     3042
     3043<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3044
     3045
     3046<tr>
     3047     <td valign="top">Author</td>
     3048     <td valign="top">Paul, Subharthi and Pan, Jianli and Jain, Raj</td>
     3049</tr>
     3050
     3051<tr>
     3052     <td valign="top">Title</td>
     3053     <td valign="top">Architectures for the future networks and the next generation Internet: A survey</td>
     3054</tr>
     3055
     3056<tr>
     3057     <td valign="top">Journal</td>
     3058     <td valign="top">Computer Communications</td>
     3059</tr>
     3060
     3061<tr>
     3062     <td valign="top">Publisher</td>
     3063     <td valign="top">Elsevier Science Publishers B. V.</td>
     3064</tr>
     3065
     3066<tr>
     3067     <td valign="top">Address</td>
     3068     <td valign="top">Amsterdam, The Netherlands, The Netherlands</td>
     3069</tr>
     3070
     3071<tr>
     3072     <td valign="top">Year</td>
     3073     <td valign="top">2011</td>
     3074</tr>
     3075
     3076<tr>
     3077     <td valign="top">Abstract</td>
     3078     <td valign="top">Networking research funding agencies in USA, Europe, Japan, and other countries are encouraging research on revolutionary networking architectures that may or may not be bound by the restrictions of the current TCP/IP based Internet. We present a comprehensive survey of such research projects and activities. The topics covered include various testbeds for experimentations for new architectures, new security mechanisms, content delivery mechanisms, management and control frameworks, service architectures, and routing mechanisms. Delay/disruption tolerant networks which allow communications even when complete end-to-end path is not available are also discussed.</td>
     3079</tr>
     3080
     3081
     3082
     3083<tr>
     3084     <td valign="top">DOI</td>
     3085     <td valign="top">10.1016/j.comcom.2010.08.001</td>
     3086</tr>
     3087
     3088
     3089
     3090<tr>
     3091     <td valign="top">URL</td>
     3092     <td valign="top"><a href="http://dx.doi.org/10.1016/j.comcom.2010.08.001">http://dx.doi.org/10.1016/j.comcom.2010.08.001</a></td>
    30253093</tr>
    30263094
    … …  
    30323100
    30333101<a class="EntryGoto" id="Qin, Z. and Xiong, X. and Chuah, M."></a>
    3034 <b class="myheading" style="position: relative; left: 10%;">Qin, Z. and Xiong, X. and Chuah, M.</b>
    3035 
    3036 <div class="BibEntry">
    3037 
    3038 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3039 
    3040 
    3041 <tr>
    3042      <td>Author</td>
    3043      <td>Qin, Z. and Xiong, X. and Chuah, M.</td>
    3044 </tr>
    3045 
    3046 <tr>
    3047      <td>Title</td>
    3048      <td>Lehigh Explorer: Android Application Utilizing Content Centric Features</td>
    3049 </tr>
    3050 
    3051 <tr>
    3052      <td>Booktitle</td>
    3053      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    3054 </tr>
    3055 
    3056 <tr>
    3057      <td>Location</td>
    3058      <td>Los Angeles</td>
    3059 </tr>
    3060 
    3061 <tr>
    3062      <td>Year</td>
    3063      <td>2012</td>
    3064 </tr>
    3065 
    3066 <tr>
    3067      <td>Abstract</td>
    3068      <td>Companies, government organizations or institutions from anywhere in the world publish different types of information e.g. news, health alerts, disaster warnings at any time. Rather than consuming all published data, users only desire access to information of interest to themselves irrespective of where the data is located and who publish them. Existing publish/subscribe systems built based on IP-based network can be inefficient and are not flexible enough to meet emerging requirements e.g. deal with mobile users, dynamic contents, searching over encrypted data. Recently content-centric networks have been proposed to provide flexibility to users to access such information. We have designed secure content centric mobile networks that allow users to publish and retrieve contents securely. As with any new architecture, one important issue is to have useful applications that can utilize features provided in the new architecture. In this paper, we describe an Android application we recently developed that allows visitors to explore Lehigh campus based on their expressed interests. Our application utilizes keyword based interest messages to retrieve matching data items of interests to a user. We are giving a demo of Lehigh Explorer at GEC13.</td>
     3102<b class="myheading" style="position: relative; left: 5%;">Qin, Z. and Xiong, X. and Chuah, M.</b>
     3103
     3104<div class="BibEntry">
     3105
     3106<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3107
     3108
     3109<tr>
     3110     <td valign="top">Author</td>
     3111     <td valign="top">Qin, Z. and Xiong, X. and Chuah, M.</td>
     3112</tr>
     3113
     3114<tr>
     3115     <td valign="top">Title</td>
     3116     <td valign="top">Lehigh Explorer: Android Application Utilizing Content Centric Features</td>
     3117</tr>
     3118
     3119<tr>
     3120     <td valign="top">Booktitle</td>
     3121     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     3122</tr>
     3123
     3124<tr>
     3125     <td valign="top">Location</td>
     3126     <td valign="top">Los Angeles</td>
     3127</tr>
     3128
     3129<tr>
     3130     <td valign="top">Year</td>
     3131     <td valign="top">2012</td>
     3132</tr>
     3133
     3134<tr>
     3135     <td valign="top">Abstract</td>
     3136     <td valign="top">Companies, government organizations or institutions from anywhere in the world publish different types of information e.g. news, health alerts, disaster warnings at any time. Rather than consuming all published data, users only desire access to information of interest to themselves irrespective of where the data is located and who publish them. Existing publish/subscribe systems built based on IP-based network can be inefficient and are not flexible enough to meet emerging requirements e.g. deal with mobile users, dynamic contents, searching over encrypted data. Recently content-centric networks have been proposed to provide flexibility to users to access such information. We have designed secure content centric mobile networks that allow users to publish and retrieve contents securely. As with any new architecture, one important issue is to have useful applications that can utilize features provided in the new architecture. In this paper, we describe an Android application we recently developed that allows visitors to explore Lehigh campus based on their expressed interests. Our application utilizes keyword based interest messages to retrieve matching data items of interests to a user. We are giving a demo of Lehigh Explorer at GEC13.</td>
    30693137</tr>
    30703138
    … …  
    30803148
    30813149<a class="EntryGoto" id="Quan, John and Nance, Kara and Hay, Brian"></a>
    3082 <b class="myheading" style="position: relative; left: 10%;">Quan, John and Nance, Kara and Hay, Brian</b>
    3083 
    3084 <div class="BibEntry">
    3085 
    3086 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3087 
    3088 
    3089 <tr>
    3090      <td>Author</td>
    3091      <td>Quan, John and Nance, Kara and Hay, Brian</td>
    3092 </tr>
    3093 
    3094 <tr>
    3095      <td>Title</td>
    3096      <td>A Mutualistic Security Service Model: Supporting Large-Scale Virtualized Environments</td>
    3097 </tr>
    3098 
    3099 <tr>
    3100      <td>Journal</td>
    3101      <td>IT Professional</td>
    3102 </tr>
    3103 
    3104 <tr>
    3105      <td>Year</td>
    3106      <td>2011</td>
    3107 </tr>
    3108 
    3109 <tr>
    3110      <td>Abstract</td>
    3111      <td>Applying a mutualistic security service model to large-scale virtualized environments that rely on contributed hardware lets researchers improve security in exchange for resources. The authors discuss this model in the context of the Global Environment for Network Innovation (GENI) project.</td>
    3112 </tr>
    3113 
    3114 
    3115 
    3116 <tr>
    3117      <td>DOI</td>
    3118      <td>10.1109/MITP.2011.36</td>
    3119 </tr>
    3120 
    3121 
    3122 
    3123 <tr>
    3124      <td>URL</td>
    3125      <td><a href="http://dx.doi.org/10.1109/MITP.2011.36">http://dx.doi.org/10.1109/MITP.2011.36</a></td>
     3150<b class="myheading" style="position: relative; left: 5%;">Quan, John and Nance, Kara and Hay, Brian</b>
     3151
     3152<div class="BibEntry">
     3153
     3154<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3155
     3156
     3157<tr>
     3158     <td valign="top">Author</td>
     3159     <td valign="top">Quan, John and Nance, Kara and Hay, Brian</td>
     3160</tr>
     3161
     3162<tr>
     3163     <td valign="top">Title</td>
     3164     <td valign="top">A Mutualistic Security Service Model: Supporting Large-Scale Virtualized Environments</td>
     3165</tr>
     3166
     3167<tr>
     3168     <td valign="top">Journal</td>
     3169     <td valign="top">IT Professional</td>
     3170</tr>
     3171
     3172<tr>
     3173     <td valign="top">Year</td>
     3174     <td valign="top">2011</td>
     3175</tr>
     3176
     3177<tr>
     3178     <td valign="top">Abstract</td>
     3179     <td valign="top">Applying a mutualistic security service model to large-scale virtualized environments that rely on contributed hardware lets researchers improve security in exchange for resources. The authors discuss this model in the context of the Global Environment for Network Innovation (GENI) project.</td>
     3180</tr>
     3181
     3182
     3183
     3184<tr>
     3185     <td valign="top">DOI</td>
     3186     <td valign="top">10.1109/MITP.2011.36</td>
     3187</tr>
     3188
     3189
     3190
     3191<tr>
     3192     <td valign="top">URL</td>
     3193     <td valign="top"><a href="http://dx.doi.org/10.1109/MITP.2011.36">http://dx.doi.org/10.1109/MITP.2011.36</a></td>
    31263194</tr>
    31273195
    … …  
    31333201
    31343202<a class="EntryGoto" id="Rohrer, Justin P. and &#x43;&#x0327;etinkaya, Egemen K. and Sterbenz, James P. G."></a>
    3135 <b class="myheading" style="position: relative; left: 10%;">Rohrer, Justin P. and &#x43;&#x0327;etinkaya, Egemen K. and Sterbenz, James P. G.</b>
    3136 
    3137 <div class="BibEntry">
    3138 
    3139 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3140 
    3141 
    3142 <tr>
    3143      <td>Author</td>
    3144      <td>Rohrer, Justin P. and &#x43;&#x0327;etinkaya, Egemen K. and Sterbenz, James P. G.</td>
    3145 </tr>
    3146 
    3147 <tr>
    3148      <td>Title</td>
    3149      <td>Progress and challenges in large-scale future internet experimentation using the GpENI programmable testbed</td>
    3150 </tr>
    3151 
    3152 <tr>
    3153      <td>Booktitle</td>
    3154      <td>Proceedings of the 6th International Conference on Future Internet Technologies</td>
    3155 </tr>
    3156 
    3157 <tr>
    3158      <td>Location</td>
    3159      <td>Seoul, Republic of Korea</td>
    3160 </tr>
    3161 
    3162 <tr>
    3163      <td>Publisher</td>
    3164      <td>ACM</td>
    3165 </tr>
    3166 
    3167 <tr>
    3168      <td>Address</td>
    3169      <td>New York, NY, USA</td>
    3170 </tr>
    3171 
    3172 <tr>
    3173      <td>Year</td>
    3174      <td>2011</td>
    3175 </tr>
    3176 
    3177 <tr>
    3178      <td>Abstract</td>
    3179      <td>GpENI is evolving to provide a promising environment in which to do experimental research in the resilience and survivability of future networks, by allowing programmable control over topology and mechanism, while providing the scale and global reach needed to conduct network experiments far beyond the capabilities of a conventional testbed. Addressing this need at scale introduces a number of challenges both in deployment and in collecting results that can be directly compared to simulation results for cross-verification purposes. In this short paper we present the scope, design goals, challenges, and current status of the GpENI programmable testbed, as well as an overview and examples of the types of experiments we are beginning to run.</td>
    3180 </tr>
    3181 
    3182 
    3183 
    3184 <tr>
    3185      <td>DOI</td>
    3186      <td>10.1145/2002396.2002409</td>
    3187 </tr>
    3188 
    3189 
    3190 
    3191 <tr>
    3192      <td>URL</td>
    3193      <td><a href="http://dx.doi.org/10.1145/2002396.2002409">http://dx.doi.org/10.1145/2002396.2002409</a></td>
     3203<b class="myheading" style="position: relative; left: 5%;">Rohrer, Justin P. and &#x43;&#x0327;etinkaya, Egemen K. and Sterbenz, James P. G.</b>
     3204
     3205<div class="BibEntry">
     3206
     3207<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3208
     3209
     3210<tr>
     3211     <td valign="top">Author</td>
     3212     <td valign="top">Rohrer, Justin P. and &#x43;&#x0327;etinkaya, Egemen K. and Sterbenz, James P. G.</td>
     3213</tr>
     3214
     3215<tr>
     3216     <td valign="top">Title</td>
     3217     <td valign="top">Progress and challenges in large-scale future internet experimentation using the GpENI programmable testbed</td>
     3218</tr>
     3219
     3220<tr>
     3221     <td valign="top">Booktitle</td>
     3222     <td valign="top">Proceedings of the 6th International Conference on Future Internet Technologies</td>
     3223</tr>
     3224
     3225<tr>
     3226     <td valign="top">Location</td>
     3227     <td valign="top">Seoul, Republic of Korea</td>
     3228</tr>
     3229
     3230<tr>
     3231     <td valign="top">Publisher</td>
     3232     <td valign="top">ACM</td>
     3233</tr>
     3234
     3235<tr>
     3236     <td valign="top">Address</td>
     3237     <td valign="top">New York, NY, USA</td>
     3238</tr>
     3239
     3240<tr>
     3241     <td valign="top">Year</td>
     3242     <td valign="top">2011</td>
     3243</tr>
     3244
     3245<tr>
     3246     <td valign="top">Abstract</td>
     3247     <td valign="top">GpENI is evolving to provide a promising environment in which to do experimental research in the resilience and survivability of future networks, by allowing programmable control over topology and mechanism, while providing the scale and global reach needed to conduct network experiments far beyond the capabilities of a conventional testbed. Addressing this need at scale introduces a number of challenges both in deployment and in collecting results that can be directly compared to simulation results for cross-verification purposes. In this short paper we present the scope, design goals, challenges, and current status of the GpENI programmable testbed, as well as an overview and examples of the types of experiments we are beginning to run.</td>
     3248</tr>
     3249
     3250
     3251
     3252<tr>
     3253     <td valign="top">DOI</td>
     3254     <td valign="top">10.1145/2002396.2002409</td>
     3255</tr>
     3256
     3257
     3258
     3259<tr>
     3260     <td valign="top">URL</td>
     3261     <td valign="top"><a href="http://dx.doi.org/10.1145/2002396.2002409">http://dx.doi.org/10.1145/2002396.2002409</a></td>
    31943262</tr>
    31953263
    … …  
    32013269
    32023270<a class="EntryGoto" id="Rosen, Aaron and Wang, Kuang-Ching"></a>
    3203 <b class="myheading" style="position: relative; left: 10%;">Rosen, Aaron and Wang, Kuang-Ching</b>
    3204 
    3205 <div class="BibEntry">
    3206 
    3207 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3208 
    3209 
    3210 <tr>
    3211      <td>Author</td>
    3212      <td>Rosen, Aaron and Wang, Kuang-Ching</td>
    3213 </tr>
    3214 
    3215 <tr>
    3216      <td>Title</td>
    3217      <td>Steroid OpenFlow Service: Seamless Network Service Delivery in Software Defined Networks</td>
    3218 </tr>
    3219 
    3220 <tr>
    3221      <td>Booktitle</td>
    3222      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    3223 </tr>
    3224 
    3225 <tr>
    3226      <td>Location</td>
    3227      <td>Los Angeles</td>
    3228 </tr>
    3229 
    3230 <tr>
    3231      <td>Year</td>
    3232      <td>2012</td>
    3233 </tr>
    3234 
    3235 <tr>
    3236      <td>Abstract</td>
    3237      <td>In a software defined network (SDN), packet forwarding is controlled by software controllers. In an OpenFlow SDN, a controller can control the forwarding, rewriting, and dropping of packets based on their header attributes. The ability to handle packets in customizable ways in software has significant implications for both network users and operators. Via software, users can convey application specific expectations while operators can deliver application specific services to enhance user experiences. In this paper, we present the Steroid OpenFlow Services (SOS) paradigm for network services delivery. The paradigm enables operators to deliver network services without any setup requirements on user machines. SOS utilizes OpenFlow to redirect application specific traffic to application specific service agents; SOS also rewrites packet headers for a service to remain seamless to users. This paper presents an example SOS service for optimizing large volume TCP download across a large delay-bandwidth-product wide area network. SOS service agents on both ends of the connection seamlessly terminate a user TCP connection, launch a set of parallel TCP connections, and leverage multiple paths when available to maximize throughput. With the NSF GENI future Internet testbed, a prototype implementation achieved up to 320 times throughput enhancement seamless to the end users.</td>
     3271<b class="myheading" style="position: relative; left: 5%;">Rosen, Aaron and Wang, Kuang-Ching</b>
     3272
     3273<div class="BibEntry">
     3274
     3275<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3276
     3277
     3278<tr>
     3279     <td valign="top">Author</td>
     3280     <td valign="top">Rosen, Aaron and Wang, Kuang-Ching</td>
     3281</tr>
     3282
     3283<tr>
     3284     <td valign="top">Title</td>
     3285     <td valign="top">Steroid OpenFlow Service: Seamless Network Service Delivery in Software Defined Networks</td>
     3286</tr>
     3287
     3288<tr>
     3289     <td valign="top">Booktitle</td>
     3290     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     3291</tr>
     3292
     3293<tr>
     3294     <td valign="top">Location</td>
     3295     <td valign="top">Los Angeles</td>
     3296</tr>
     3297
     3298<tr>
     3299     <td valign="top">Year</td>
     3300     <td valign="top">2012</td>
     3301</tr>
     3302
     3303<tr>
     3304     <td valign="top">Abstract</td>
     3305     <td valign="top">In a software defined network (SDN), packet forwarding is controlled by software controllers. In an OpenFlow SDN, a controller can control the forwarding, rewriting, and dropping of packets based on their header attributes. The ability to handle packets in customizable ways in software has significant implications for both network users and operators. Via software, users can convey application specific expectations while operators can deliver application specific services to enhance user experiences. In this paper, we present the Steroid OpenFlow Services (SOS) paradigm for network services delivery. The paradigm enables operators to deliver network services without any setup requirements on user machines. SOS utilizes OpenFlow to redirect application specific traffic to application specific service agents; SOS also rewrites packet headers for a service to remain seamless to users. This paper presents an example SOS service for optimizing large volume TCP download across a large delay-bandwidth-product wide area network. SOS service agents on both ends of the connection seamlessly terminate a user TCP connection, launch a set of parallel TCP connections, and leverage multiple paths when available to maximize throughput. With the NSF GENI future Internet testbed, a prototype implementation achieved up to 320 times throughput enhancement seamless to the end users.</td>
    32383306</tr>
    32393307
    … …  
    32493317
    32503318<a class="EntryGoto" id="Seskar, Ivan and Nagaraja, Kiran and Nelson, Sam and Raychaudhuri, Dipankar"></a>
    3251 <b class="myheading" style="position: relative; left: 10%;">Seskar, Ivan and Nagaraja, Kiran and Nelson, Sam and Raychaudhuri, Dipankar</b>
    3252 
    3253 <div class="BibEntry">
    3254 
    3255 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3256 
    3257 
    3258 <tr>
    3259      <td>Author</td>
    3260      <td>Seskar, Ivan and Nagaraja, Kiran and Nelson, Sam and Raychaudhuri, Dipankar</td>
    3261 </tr>
    3262 
    3263 <tr>
    3264      <td>Title</td>
    3265      <td>MobilityFirst future internet architecture project</td>
    3266 </tr>
    3267 
    3268 <tr>
    3269      <td>Booktitle</td>
    3270      <td>Proceedings of the 7th Asian Internet Engineering Conference</td>
    3271 </tr>
    3272 
    3273 <tr>
    3274      <td>Location</td>
    3275      <td>Bangkok, Thailand</td>
    3276 </tr>
    3277 
    3278 <tr>
    3279      <td>Publisher</td>
    3280      <td>ACM</td>
    3281 </tr>
    3282 
    3283 <tr>
    3284      <td>Address</td>
    3285      <td>New York, NY, USA</td>
    3286 </tr>
    3287 
    3288 <tr>
    3289      <td>Year</td>
    3290      <td>2011</td>
    3291 </tr>
    3292 
    3293 <tr>
    3294      <td>Abstract</td>
    3295      <td>This short paper presents an overview of the MobilityFirst network architecture, which is a clean-slate project being conducted as part of the NSF Future Internet Architecture (FIA) program. The proposed architecture is intended to directly address the challenges of wireless access and mobility at scale, while also providing new multicast, anycast, multi-path and context-aware services needed for emerging mobile Internet application scenarios. Key protocol components of the proposed architecture are: (a) separation of naming from addressing; (b) public key based self-certifying names (called globally unique identifiers or GUIDs) for network-attached objects; (c) global name resolution service (GNRS) for dynamic name-to-address binding; (d) delay-tolerant and storage-aware routing (GSTAR) capable of dealing with wireless link quality fluctuations and disconnections; (e) hop-by-hop transport of large protocol data units; and (f) location or context-aware services. The basic operations of a MobilityFirst router are outlined. This is followed by a discussion of ongoing proof-of-concept prototyping and experimental evaluation efforts for the MobilityFirst protocol stack. In conclusion, a brief description of an ongoing multi-site experimental deployment of the MobilityFirst protocol stack on the GENI testbed is provided.</td>
    3296 </tr>
    3297 
    3298 
    3299 
    3300 <tr>
    3301      <td>DOI</td>
    3302      <td>10.1145/2089016.2089017</td>
    3303 </tr>
    3304 
    3305 
    3306 
    3307 <tr>
    3308      <td>URL</td>
    3309      <td><a href="http://dx.doi.org/10.1145/2089016.2089017">http://dx.doi.org/10.1145/2089016.2089017</a></td>
     3319<b class="myheading" style="position: relative; left: 5%;">Seskar, Ivan and Nagaraja, Kiran and Nelson, Sam and Raychaudhuri, Dipankar</b>
     3320
     3321<div class="BibEntry">
     3322
     3323<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3324
     3325
     3326<tr>
     3327     <td valign="top">Author</td>
     3328     <td valign="top">Seskar, Ivan and Nagaraja, Kiran and Nelson, Sam and Raychaudhuri, Dipankar</td>
     3329</tr>
     3330
     3331<tr>
     3332     <td valign="top">Title</td>
     3333     <td valign="top">MobilityFirst future internet architecture project</td>
     3334</tr>
     3335
     3336<tr>
     3337     <td valign="top">Booktitle</td>
     3338     <td valign="top">Proceedings of the 7th Asian Internet Engineering Conference</td>
     3339</tr>
     3340
     3341<tr>
     3342     <td valign="top">Location</td>
     3343     <td valign="top">Bangkok, Thailand</td>
     3344</tr>
     3345
     3346<tr>
     3347     <td valign="top">Publisher</td>
     3348     <td valign="top">ACM</td>
     3349</tr>
     3350
     3351<tr>
     3352     <td valign="top">Address</td>
     3353     <td valign="top">New York, NY, USA</td>
     3354</tr>
     3355
     3356<tr>
     3357     <td valign="top">Year</td>
     3358     <td valign="top">2011</td>
     3359</tr>
     3360
     3361<tr>
     3362     <td valign="top">Abstract</td>
     3363     <td valign="top">This short paper presents an overview of the MobilityFirst network architecture, which is a clean-slate project being conducted as part of the NSF Future Internet Architecture (FIA) program. The proposed architecture is intended to directly address the challenges of wireless access and mobility at scale, while also providing new multicast, anycast, multi-path and context-aware services needed for emerging mobile Internet application scenarios. Key protocol components of the proposed architecture are: (a) separation of naming from addressing; (b) public key based self-certifying names (called globally unique identifiers or GUIDs) for network-attached objects; (c) global name resolution service (GNRS) for dynamic name-to-address binding; (d) delay-tolerant and storage-aware routing (GSTAR) capable of dealing with wireless link quality fluctuations and disconnections; (e) hop-by-hop transport of large protocol data units; and (f) location or context-aware services. The basic operations of a MobilityFirst router are outlined. This is followed by a discussion of ongoing proof-of-concept prototyping and experimental evaluation efforts for the MobilityFirst protocol stack. In conclusion, a brief description of an ongoing multi-site experimental deployment of the MobilityFirst protocol stack on the GENI testbed is provided.</td>
     3364</tr>
     3365
     3366
     3367
     3368<tr>
     3369     <td valign="top">DOI</td>
     3370     <td valign="top">10.1145/2089016.2089017</td>
     3371</tr>
     3372
     3373
     3374
     3375<tr>
     3376     <td valign="top">URL</td>
     3377     <td valign="top"><a href="http://dx.doi.org/10.1145/2089016.2089017">http://dx.doi.org/10.1145/2089016.2089017</a></td>
    33103378</tr>
    33113379
    … …  
    33173385
    33183386<a class="EntryGoto" id="Sharma, Navin and Gummeson, Jeremy and Irwin, David and Shenoy, Prashant"></a>
    3319 <b class="myheading" style="position: relative; left: 10%;">Sharma, Navin and Gummeson, Jeremy and Irwin, David and Shenoy, Prashant</b>
    3320 
    3321 <div class="BibEntry">
    3322 
    3323 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3324 
    3325 
    3326 <tr>
    3327      <td>Author</td>
    3328      <td>Sharma, Navin and Gummeson, Jeremy and Irwin, David and Shenoy, Prashant</td>
    3329 </tr>
    3330 
    3331 <tr>
    3332      <td>Title</td>
    3333      <td>Cloudy Computing: Leveraging Weather Forecasts in Energy Harvesting Sensor Systems</td>
    3334 </tr>
    3335 
    3336 <tr>
    3337      <td>Booktitle</td>
    3338      <td>2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)</td>
    3339 </tr>
    3340 
    3341 <tr>
    3342      <td>Location</td>
    3343      <td>Boston, MA, USA</td>
    3344 </tr>
    3345 
    3346 <tr>
    3347      <td>Publisher</td>
    3348      <td>IEEE</td>
    3349 </tr>
    3350 
    3351 <tr>
    3352      <td>Year</td>
    3353      <td>2010</td>
    3354 </tr>
    3355 
    3356 <tr>
    3357      <td>Abstract</td>
    3358      <td>To sustain perpetual operation, systems that harvest environmental energy must carefully regulate their usage to satisfy their demand. Regulating energy usage is challenging if a system's demands are not elastic and its hardware components are not energy-proportional, since it cannot precisely scale its usage to match its supply. Instead, the system must choose when to satisfy its energy demands based on its current energy reserves and predictions of its future energy supply. In this paper, we explore the use of weather forecasts to improve a system's ability to satisfy demand by improving its predictions. We analyze weather forecast, observational, and energy harvesting data to formulate a model that translates a weather forecast to a wind or solar energy harvesting prediction, and quantify its accuracy. We evaluate our model for both energy sources in the context of two different energy harvesting sensor systems with inelastic demands: a sensor testbed that leases sensors to external users and a lexicographically fair sensor network that maintains steady node sensing rates. We show that using weather forecasts in both wind- and solar-powered sensor systems increases each system's ability to satisfy its demands compared with existing prediction strategies.</td>
    3359 </tr>
    3360 
    3361 
    3362 
    3363 <tr>
    3364      <td>DOI</td>
    3365      <td>10.1109/SECON.2010.5508260</td>
    3366 </tr>
    3367 
    3368 
    3369 
    3370 <tr>
    3371      <td>URL</td>
    3372      <td><a href="http://dx.doi.org/10.1109/SECON.2010.5508260">http://dx.doi.org/10.1109/SECON.2010.5508260</a></td>
     3387<b class="myheading" style="position: relative; left: 5%;">Sharma, Navin and Gummeson, Jeremy and Irwin, David and Shenoy, Prashant</b>
     3388
     3389<div class="BibEntry">
     3390
     3391<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3392
     3393
     3394<tr>
     3395     <td valign="top">Author</td>
     3396     <td valign="top">Sharma, Navin and Gummeson, Jeremy and Irwin, David and Shenoy, Prashant</td>
     3397</tr>
     3398
     3399<tr>
     3400     <td valign="top">Title</td>
     3401     <td valign="top">Cloudy Computing: Leveraging Weather Forecasts in Energy Harvesting Sensor Systems</td>
     3402</tr>
     3403
     3404<tr>
     3405     <td valign="top">Booktitle</td>
     3406     <td valign="top">2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)</td>
     3407</tr>
     3408
     3409<tr>
     3410     <td valign="top">Location</td>
     3411     <td valign="top">Boston, MA, USA</td>
     3412</tr>
     3413
     3414<tr>
     3415     <td valign="top">Publisher</td>
     3416     <td valign="top">IEEE</td>
     3417</tr>
     3418
     3419<tr>
     3420     <td valign="top">Year</td>
     3421     <td valign="top">2010</td>
     3422</tr>
     3423
     3424<tr>
     3425     <td valign="top">Abstract</td>
     3426     <td valign="top">To sustain perpetual operation, systems that harvest environmental energy must carefully regulate their usage to satisfy their demand. Regulating energy usage is challenging if a system's demands are not elastic and its hardware components are not energy-proportional, since it cannot precisely scale its usage to match its supply. Instead, the system must choose when to satisfy its energy demands based on its current energy reserves and predictions of its future energy supply. In this paper, we explore the use of weather forecasts to improve a system's ability to satisfy demand by improving its predictions. We analyze weather forecast, observational, and energy harvesting data to formulate a model that translates a weather forecast to a wind or solar energy harvesting prediction, and quantify its accuracy. We evaluate our model for both energy sources in the context of two different energy harvesting sensor systems with inelastic demands: a sensor testbed that leases sensors to external users and a lexicographically fair sensor network that maintains steady node sensing rates. We show that using weather forecasts in both wind- and solar-powered sensor systems increases each system's ability to satisfy its demands compared with existing prediction strategies.</td>
     3427</tr>
     3428
     3429
     3430
     3431<tr>
     3432     <td valign="top">DOI</td>
     3433     <td valign="top">10.1109/SECON.2010.5508260</td>
     3434</tr>
     3435
     3436
     3437
     3438<tr>
     3439     <td valign="top">URL</td>
     3440     <td valign="top"><a href="http://dx.doi.org/10.1109/SECON.2010.5508260">http://dx.doi.org/10.1109/SECON.2010.5508260</a></td>
    33733441</tr>
    33743442
    … …  
    33803448
    33813449<a class="EntryGoto" id="Shen, Haiying and Liu, Guoxin"></a>
    3382 <b class="myheading" style="position: relative; left: 10%;">Shen, Haiying and Liu, Guoxin</b>
    3383 
    3384 <div class="BibEntry">
    3385 
    3386 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3387 
    3388 
    3389 <tr>
    3390      <td>Author</td>
    3391      <td>Shen, Haiying and Liu, Guoxin</td>
    3392 </tr>
    3393 
    3394 <tr>
    3395      <td>Title</td>
    3396      <td>Harmony: Integrated Resource and Reputation Management for Large-Scale Distributed Systems</td>
    3397 </tr>
    3398 
    3399 <tr>
    3400      <td>Booktitle</td>
    3401      <td>2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)</td>
    3402 </tr>
    3403 
    3404 <tr>
    3405      <td>Location</td>
    3406      <td>Lahaina, HI, USA</td>
    3407 </tr>
    3408 
    3409 <tr>
    3410      <td>Publisher</td>
    3411      <td>IEEE</td>
    3412 </tr>
    3413 
    3414 <tr>
    3415      <td>Year</td>
    3416      <td>2011</td>
    3417 </tr>
    3418 
    3419 <tr>
    3420      <td>Abstract</td>
    3421      <td>Advancements in technology over the past decade are leading to a promising future for large-scale distributed systems, where globally-scattered distributed resources are collectively pooled and used in a cooperative manner to achieve unprecedented petascale supercomputing capabilities. The issues of resource management (resMgt) and reputation management (repMgt) need to be addressed in order to ensure the successful deployment of large-scale distributed systems. However, these two issues have typically been addressed separately, despite the significant interdependencies between them: resMgt needs repMgt to provide a cooperative environment for resource sharing, and in turn facilitates repMgt to evaluate multi-faceted node reputations for providing different resources. Current repMgt methods provide a single reputation value for each node in providing all types of resources. However, a node willing to provide one resource may not be willing to provide another resource. In addition, current repMgt methods often guide node selection policy to select the highest-reputed nodes, which may overload these nodes. Also, few works exploited node reputation in resource selection in order to fully and fairly utilize resources in the system and to meet users' diverse QoS demands. We propose a system called Harmony that integrates resMgt and repMgt in a harmonious manner. Harmony incorporates two key innovations: integrated multi-faceted resource/reputation management and multi-QoS-oriented resource selection. The trace data we collected from an online trading platform confirms the importance of multi-faceted reputation and potential problems with highest-reputed node selection. Trace-driven experiments performed on PlanetLab show that Harmony outperforms existing resMgt and repMgt in terms of the success rate, service delay, and efficiency.</td>
    3422 </tr>
    3423 
    3424 
    3425 
    3426 <tr>
    3427      <td>DOI</td>
    3428      <td>10.1109/ICCCN.2011.6005739</td>
    3429 </tr>
    3430 
    3431 
    3432 
    3433 <tr>
    3434      <td>URL</td>
    3435      <td><a href="http://dx.doi.org/10.1109/ICCCN.2011.6005739">http://dx.doi.org/10.1109/ICCCN.2011.6005739</a></td>
     3450<b class="myheading" style="position: relative; left: 5%;">Shen, Haiying and Liu, Guoxin</b>
     3451
     3452<div class="BibEntry">
     3453
     3454<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3455
     3456
     3457<tr>
     3458     <td valign="top">Author</td>
     3459     <td valign="top">Shen, Haiying and Liu, Guoxin</td>
     3460</tr>
     3461
     3462<tr>
     3463     <td valign="top">Title</td>
     3464     <td valign="top">Harmony: Integrated Resource and Reputation Management for Large-Scale Distributed Systems</td>
     3465</tr>
     3466
     3467<tr>
     3468     <td valign="top">Booktitle</td>
     3469     <td valign="top">2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN)</td>
     3470</tr>
     3471
     3472<tr>
     3473     <td valign="top">Location</td>
     3474     <td valign="top">Lahaina, HI, USA</td>
     3475</tr>
     3476
     3477<tr>
     3478     <td valign="top">Publisher</td>
     3479     <td valign="top">IEEE</td>
     3480</tr>
     3481
     3482<tr>
     3483     <td valign="top">Year</td>
     3484     <td valign="top">2011</td>
     3485</tr>
     3486
     3487<tr>
     3488     <td valign="top">Abstract</td>
     3489     <td valign="top">Advancements in technology over the past decade are leading to a promising future for large-scale distributed systems, where globally-scattered distributed resources are collectively pooled and used in a cooperative manner to achieve unprecedented petascale supercomputing capabilities. The issues of resource management (resMgt) and reputation management (repMgt) need to be addressed in order to ensure the successful deployment of large-scale distributed systems. However, these two issues have typically been addressed separately, despite the significant interdependencies between them: resMgt needs repMgt to provide a cooperative environment for resource sharing, and in turn facilitates repMgt to evaluate multi-faceted node reputations for providing different resources. Current repMgt methods provide a single reputation value for each node in providing all types of resources. However, a node willing to provide one resource may not be willing to provide another resource. In addition, current repMgt methods often guide node selection policy to select the highest-reputed nodes, which may overload these nodes. Also, few works exploited node reputation in resource selection in order to fully and fairly utilize resources in the system and to meet users' diverse QoS demands. We propose a system called Harmony that integrates resMgt and repMgt in a harmonious manner. Harmony incorporates two key innovations: integrated multi-faceted resource/reputation management and multi-QoS-oriented resource selection. The trace data we collected from an online trading platform confirms the importance of multi-faceted reputation and potential problems with highest-reputed node selection. Trace-driven experiments performed on PlanetLab show that Harmony outperforms existing resMgt and repMgt in terms of the success rate, service delay, and efficiency.</td>
     3490</tr>
     3491
     3492
     3493
     3494<tr>
     3495     <td valign="top">DOI</td>
     3496     <td valign="top">10.1109/ICCCN.2011.6005739</td>
     3497</tr>
     3498
     3499
     3500
     3501<tr>
     3502     <td valign="top">URL</td>
     3503     <td valign="top"><a href="http://dx.doi.org/10.1109/ICCCN.2011.6005739">http://dx.doi.org/10.1109/ICCCN.2011.6005739</a></td>
    34363504</tr>
    34373505
    … …  
    34433511
    34443512<a class="EntryGoto" id="Shin, Sunae and Dhondge, Kaustubh and Choi, Baek-Young"></a>
    3445 <b class="myheading" style="position: relative; left: 10%;">Shin, Sunae and Dhondge, Kaustubh and Choi, Baek-Young</b>
    3446 
    3447 <div class="BibEntry">
    3448 
    3449 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3450 
    3451 
    3452 <tr>
    3453      <td>Author</td>
    3454      <td>Shin, Sunae and Dhondge, Kaustubh and Choi, Baek-Young</td>
    3455 </tr>
    3456 
    3457 <tr>
    3458      <td>Title</td>
    3459      <td>Understanding the Performance of TCP and UDP-based Data Transfer Protocols using EMULAB</td>
    3460 </tr>
    3461 
    3462 <tr>
    3463      <td>Booktitle</td>
    3464      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    3465 </tr>
    3466 
    3467 <tr>
    3468      <td>Location</td>
    3469      <td>Los Angeles</td>
    3470 </tr>
    3471 
    3472 <tr>
    3473      <td>Year</td>
    3474      <td>2012</td>
    3475 </tr>
    3476 
    3477 <tr>
    3478      <td>Abstract</td>
    3479      <td>In this paper, we present a hands-on course project that explores the performance of data transfer protocols using a GENI resource. TCP is one of the key topics in networking courses, and understanding its behavior as well as limitations, from real experiments, offers an invaluable and deep learning experience. A protocol's performance is directly impacted by network parameters such as network bandwidth, delay and loss. However, it is difficult to control and even vary those parameters, if it is not evaluated with simulations. GENI facilities conveniently provide a virtual laboratory that enables us to control the network settings with real network systems. Through this educational project, students had an opportunity to control important network parameters, and measure and compare TCP's performance with a UDP-based data transfer protocol, UDT, using EMULAB. Students were enthusiastic to witness the protocols' performances, and the limitations of TCP under a high bandwidth delay product network in the presence of packet loss, and to recognize the importance of protocol design and system issues for the future Internet.</td>
     3513<b class="myheading" style="position: relative; left: 5%;">Shin, Sunae and Dhondge, Kaustubh and Choi, Baek-Young</b>
     3514
     3515<div class="BibEntry">
     3516
     3517<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3518
     3519
     3520<tr>
     3521     <td valign="top">Author</td>
     3522     <td valign="top">Shin, Sunae and Dhondge, Kaustubh and Choi, Baek-Young</td>
     3523</tr>
     3524
     3525<tr>
     3526     <td valign="top">Title</td>
     3527     <td valign="top">Understanding the Performance of TCP and UDP-based Data Transfer Protocols using EMULAB</td>
     3528</tr>
     3529
     3530<tr>
     3531     <td valign="top">Booktitle</td>
     3532     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     3533</tr>
     3534
     3535<tr>
     3536     <td valign="top">Location</td>
     3537     <td valign="top">Los Angeles</td>
     3538</tr>
     3539
     3540<tr>
     3541     <td valign="top">Year</td>
     3542     <td valign="top">2012</td>
     3543</tr>
     3544
     3545<tr>
     3546     <td valign="top">Abstract</td>
     3547     <td valign="top">In this paper, we present a hands-on course project that explores the performance of data transfer protocols using a GENI resource. TCP is one of the key topics in networking courses, and understanding its behavior as well as limitations, from real experiments, offers an invaluable and deep learning experience. A protocol's performance is directly impacted by network parameters such as network bandwidth, delay and loss. However, it is difficult to control and even vary those parameters, if it is not evaluated with simulations. GENI facilities conveniently provide a virtual laboratory that enables us to control the network settings with real network systems. Through this educational project, students had an opportunity to control important network parameters, and measure and compare TCP's performance with a UDP-based data transfer protocol, UDT, using EMULAB. Students were enthusiastic to witness the protocols' performances, and the limitations of TCP under a high bandwidth delay product network in the presence of packet loss, and to recognize the importance of protocol design and system issues for the future Internet.</td>
    34803548</tr>
    34813549
    … …  
    34913559
    34923560<a class="EntryGoto" id="Sivakumar, Ashiwan and Shankaranarayanan, P. N. and Rao, Sanjay"></a>
    3493 <b class="myheading" style="position: relative; left: 10%;">Sivakumar, Ashiwan and Shankaranarayanan, P. N. and Rao, Sanjay</b>
    3494 
    3495 <div class="BibEntry">
    3496 
    3497 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3498 
    3499 
    3500 <tr>
    3501      <td>Author</td>
    3502      <td>Sivakumar, Ashiwan and Shankaranarayanan, P. N. and Rao, Sanjay</td>
    3503 </tr>
    3504 
    3505 <tr>
    3506      <td>Title</td>
    3507      <td>Closer to the Cloud - A Case for Emulating Cloud Dynamics by Controlling the Environment</td>
    3508 </tr>
    3509 
    3510 <tr>
    3511      <td>Booktitle</td>
    3512      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    3513 </tr>
    3514 
    3515 <tr>
    3516      <td>Location</td>
    3517      <td>Los Angeles</td>
    3518 </tr>
    3519 
    3520 <tr>
    3521      <td>Year</td>
    3522      <td>2012</td>
     3561<b class="myheading" style="position: relative; left: 5%;">Sivakumar, Ashiwan and Shankaranarayanan, P. N. and Rao, Sanjay</b>
     3562
     3563<div class="BibEntry">
     3564
     3565<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3566
     3567
     3568<tr>
     3569     <td valign="top">Author</td>
     3570     <td valign="top">Sivakumar, Ashiwan and Shankaranarayanan, P. N. and Rao, Sanjay</td>
     3571</tr>
     3572
     3573<tr>
     3574     <td valign="top">Title</td>
     3575     <td valign="top">Closer to the Cloud - A Case for Emulating Cloud Dynamics by Controlling the Environment</td>
     3576</tr>
     3577
     3578<tr>
     3579     <td valign="top">Booktitle</td>
     3580     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     3581</tr>
     3582
     3583<tr>
     3584     <td valign="top">Location</td>
     3585     <td valign="top">Los Angeles</td>
     3586</tr>
     3587
     3588<tr>
     3589     <td valign="top">Year</td>
     3590     <td valign="top">2012</td>
    35233591</tr>
    35243592
    … …  
    35343602
    35353603<a class="EntryGoto" id="Soroush, Hamed and Banerjee, Nilanjan and Corner, Mark and Levine, Brian and Lynn, Brian"></a>
    3536 <b class="myheading" style="position: relative; left: 10%;">Soroush, Hamed and Banerjee, Nilanjan and Corner, Mark and Levine, Brian and Lynn, Brian</b>
    3537 
    3538 <div class="BibEntry">
    3539 
    3540 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3541 
    3542 
    3543 <tr>
    3544      <td>Author</td>
    3545      <td>Soroush, Hamed and Banerjee, Nilanjan and Corner, Mark and Levine, Brian and Lynn, Brian</td>
    3546 </tr>
    3547 
    3548 <tr>
    3549      <td>Title</td>
    3550      <td>A retrospective look at the UMass DOME mobile testbed</td>
    3551 </tr>
    3552 
    3553 <tr>
    3554      <td>Journal</td>
    3555      <td>SIGMOBILE Mob. Comput. Commun. Rev.</td>
    3556 </tr>
    3557 
    3558 <tr>
    3559      <td>Publisher</td>
    3560      <td>ACM</td>
    3561 </tr>
    3562 
    3563 <tr>
    3564      <td>Address</td>
    3565      <td>New York, NY, USA</td>
    3566 </tr>
    3567 
    3568 <tr>
    3569      <td>Year</td>
    3570      <td>2012</td>
    3571 </tr>
    3572 
    3573 <tr>
    3574      <td>Abstract</td>
    3575      <td>In this paper we describe the evolution of DOME, a diverse outdoor testbed for mobile experimentation. In addition, while highlighting the challenges faced in construction of DOME, we describe a concrete set of scientific results derived from this experience in a retrospective study. First, we argue that a broad range of mobility experiments could be performed in a testbed which provides the properties of temporal, technological, and spatial diversity. We demonstrate these properties in our testbed through analysis of data collected from DOME over a period of four years. Second, we crystallize a set of design principles that others should use when constructing testbeds of their own, including those related to deploying and managing a diverse testbed, distributing experiments remotely, and fostering collaborations among testbed stakeholders. Finally, using traces collected by DOME, we provide insights into several important problems in mobile systems research.</td>
    3576 </tr>
    3577 
    3578 
    3579 
    3580 <tr>
    3581      <td>DOI</td>
    3582      <td>10.1145/2169077.2169079</td>
    3583 </tr>
    3584 
    3585 
    3586 
    3587 <tr>
    3588      <td>URL</td>
    3589      <td><a href="http://dx.doi.org/10.1145/2169077.2169079">http://dx.doi.org/10.1145/2169077.2169079</a></td>
     3604<b class="myheading" style="position: relative; left: 5%;">Soroush, Hamed and Banerjee, Nilanjan and Corner, Mark and Levine, Brian and Lynn, Brian</b>
     3605
     3606<div class="BibEntry">
     3607
     3608<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3609
     3610
     3611<tr>
     3612     <td valign="top">Author</td>
     3613     <td valign="top">Soroush, Hamed and Banerjee, Nilanjan and Corner, Mark and Levine, Brian and Lynn, Brian</td>
     3614</tr>
     3615
     3616<tr>
     3617     <td valign="top">Title</td>
     3618     <td valign="top">A retrospective look at the UMass DOME mobile testbed</td>
     3619</tr>
     3620
     3621<tr>
     3622     <td valign="top">Journal</td>
     3623     <td valign="top">SIGMOBILE Mob. Comput. Commun. Rev.</td>
     3624</tr>
     3625
     3626<tr>
     3627     <td valign="top">Publisher</td>
     3628     <td valign="top">ACM</td>
     3629</tr>
     3630
     3631<tr>
     3632     <td valign="top">Address</td>
     3633     <td valign="top">New York, NY, USA</td>
     3634</tr>
     3635
     3636<tr>
     3637     <td valign="top">Year</td>
     3638     <td valign="top">2012</td>
     3639</tr>
     3640
     3641<tr>
     3642     <td valign="top">Abstract</td>
     3643     <td valign="top">In this paper we describe the evolution of DOME, a diverse outdoor testbed for mobile experimentation. In addition, while highlighting the challenges faced in construction of DOME, we describe a concrete set of scientific results derived from this experience in a retrospective study. First, we argue that a broad range of mobility experiments could be performed in a testbed which provides the properties of temporal, technological, and spatial diversity. We demonstrate these properties in our testbed through analysis of data collected from DOME over a period of four years. Second, we crystallize a set of design principles that others should use when constructing testbeds of their own, including those related to deploying and managing a diverse testbed, distributing experiments remotely, and fostering collaborations among testbed stakeholders. Finally, using traces collected by DOME, we provide insights into several important problems in mobile systems research.</td>
     3644</tr>
     3645
     3646
     3647
     3648<tr>
     3649     <td valign="top">DOI</td>
     3650     <td valign="top">10.1145/2169077.2169079</td>
     3651</tr>
     3652
     3653
     3654
     3655<tr>
     3656     <td valign="top">URL</td>
     3657     <td valign="top"><a href="http://dx.doi.org/10.1145/2169077.2169079">http://dx.doi.org/10.1145/2169077.2169079</a></td>
    35903658</tr>
    35913659
    … …  
    35973665
    35983666<a class="EntryGoto" id="Sridharan, Mukundan and Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex"></a>
    3599 <b class="myheading" style="position: relative; left: 10%;">Sridharan, Mukundan and Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex</b>
    3600 
    3601 <div class="BibEntry">
    3602 
    3603 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3604 
    3605 
    3606 <tr>
    3607      <td>Author</td>
    3608      <td>Sridharan, Mukundan and Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex</td>
    3609 </tr>
    3610 
    3611 <tr>
    3612      <td>Title</td>
    3613      <td>Defragmentation of Resources in Virtual Desktop Clouds for Cost-Aware Utility-Optimal Allocation</td>
    3614 </tr>
    3615 
    3616 <tr>
    3617      <td>Booktitle</td>
    3618      <td>2011 Fourth IEEE International Conference on Utility and Cloud Computing</td>
    3619 </tr>
    3620 
    3621 <tr>
    3622      <td>Location</td>
    3623      <td>Melbourne, Australia</td>
    3624 </tr>
    3625 
    3626 <tr>
    3627      <td>Publisher</td>
    3628      <td>IEEE</td>
    3629 </tr>
    3630 
    3631 <tr>
    3632      <td>Year</td>
    3633      <td>2011</td>
    3634 </tr>
    3635 
    3636 <tr>
    3637      <td>Abstract</td>
    3638      <td>Cloud Service Providers (CSPs) make virtual desktop cloud (VDC) resource provisioning decisions within desktop pools based on user groups and their application profiles. Such provisioning is aimed to satisfy acceptable user quality of experience (QoE) levels and is coupled with subsequent placement of VDs across distributed data centers. The placement decisions are influenced by session latency, load balancing and operation cost constraints. In this paper, we identify the resource fragmentation problem that occurs when placement is done opportunistically to minimize provisioning time and deliver satisfactory user QoE. To solve this problem, which inherently is an NP-Hard problem, we propose a defragmentation scheme that has fast convergence time and has three levels of complexity: (i) &#x75;&#x0308;tility fair provisioning&#x20;&#x0308;(UFP) to optimize resource provisioning within a data center - to achieve relative fairness between desktop pools, (ii) &#x73;&#x0308;tatic migration-free utility optimal placement and provisioning&#x20;&#x0308;(MUPP) to optimize resource provisioning between multiple data centers - to improve performance, and (iii) &#x64;&#x0308;ynamic global utility optimal placement and provisioning&#x20;&#x0308;(GUPP) to optimize resource provisioning using cost-aware and utility-maximal VD re-allocations and migrations - to increase scalability. We evaluate our defragmentation scheme against 'least latency', 'least load', and 'least cost' schemes using a novel &#x56;&#x0308;DC-Sim&#x20;&#x0308;simulator that we have developed in this study. Our simulations leverage profiles of user groups and their applications within desktop pools, obtained from a real VDC test bed. Our simulation results demonstrate that defragmentation is an important optimization step that can enable CSPs to achieve fairness, substantially improve user QoE and increase VDC scalability.</td>
    3639 </tr>
    3640 
    3641 
    3642 
    3643 <tr>
    3644      <td>DOI</td>
    3645      <td>10.1109/UCC.2011.41</td>
    3646 </tr>
    3647 
    3648 
    3649 
    3650 <tr>
    3651      <td>URL</td>
    3652      <td><a href="http://dx.doi.org/10.1109/UCC.2011.41">http://dx.doi.org/10.1109/UCC.2011.41</a></td>
     3667<b class="myheading" style="position: relative; left: 5%;">Sridharan, Mukundan and Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex</b>
     3668
     3669<div class="BibEntry">
     3670
     3671<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3672
     3673
     3674<tr>
     3675     <td valign="top">Author</td>
     3676     <td valign="top">Sridharan, Mukundan and Calyam, Prasad and Venkataraman, Aishwarya and Berryman, Alex</td>
     3677</tr>
     3678
     3679<tr>
     3680     <td valign="top">Title</td>
     3681     <td valign="top">Defragmentation of Resources in Virtual Desktop Clouds for Cost-Aware Utility-Optimal Allocation</td>
     3682</tr>
     3683
     3684<tr>
     3685     <td valign="top">Booktitle</td>
     3686     <td valign="top">2011 Fourth IEEE International Conference on Utility and Cloud Computing</td>
     3687</tr>
     3688
     3689<tr>
     3690     <td valign="top">Location</td>
     3691     <td valign="top">Melbourne, Australia</td>
     3692</tr>
     3693
     3694<tr>
     3695     <td valign="top">Publisher</td>
     3696     <td valign="top">IEEE</td>
     3697</tr>
     3698
     3699<tr>
     3700     <td valign="top">Year</td>
     3701     <td valign="top">2011</td>
     3702</tr>
     3703
     3704<tr>
     3705     <td valign="top">Abstract</td>
     3706     <td valign="top">Cloud Service Providers (CSPs) make virtual desktop cloud (VDC) resource provisioning decisions within desktop pools based on user groups and their application profiles. Such provisioning is aimed to satisfy acceptable user quality of experience (QoE) levels and is coupled with subsequent placement of VDs across distributed data centers. The placement decisions are influenced by session latency, load balancing and operation cost constraints. In this paper, we identify the resource fragmentation problem that occurs when placement is done opportunistically to minimize provisioning time and deliver satisfactory user QoE. To solve this problem, which inherently is an NP-Hard problem, we propose a defragmentation scheme that has fast convergence time and has three levels of complexity: (i) &#x75;&#x0308;tility fair provisioning&#x20;&#x0308;(UFP) to optimize resource provisioning within a data center - to achieve relative fairness between desktop pools, (ii) &#x73;&#x0308;tatic migration-free utility optimal placement and provisioning&#x20;&#x0308;(MUPP) to optimize resource provisioning between multiple data centers - to improve performance, and (iii) &#x64;&#x0308;ynamic global utility optimal placement and provisioning&#x20;&#x0308;(GUPP) to optimize resource provisioning using cost-aware and utility-maximal VD re-allocations and migrations - to increase scalability. We evaluate our defragmentation scheme against 'least latency', 'least load', and 'least cost' schemes using a novel &#x56;&#x0308;DC-Sim&#x20;&#x0308;simulator that we have developed in this study. Our simulations leverage profiles of user groups and their applications within desktop pools, obtained from a real VDC test bed. Our simulation results demonstrate that defragmentation is an important optimization step that can enable CSPs to achieve fairness, substantially improve user QoE and increase VDC scalability.</td>
     3707</tr>
     3708
     3709
     3710
     3711<tr>
     3712     <td valign="top">DOI</td>
     3713     <td valign="top">10.1109/UCC.2011.41</td>
     3714</tr>
     3715
     3716
     3717
     3718<tr>
     3719     <td valign="top">URL</td>
     3720     <td valign="top"><a href="http://dx.doi.org/10.1109/UCC.2011.41">http://dx.doi.org/10.1109/UCC.2011.41</a></td>
    36533721</tr>
    36543722
    … …  
    36603728
    36613729<a class="EntryGoto" id="Sridharan, Mukundan and Zeng, Wenjie and Leal, William and Ju, Xi and Ramanath, Rajiv and Zhang, Hongwei and Arora, Anish"></a>
    3662 <b class="myheading" style="position: relative; left: 10%;">Sridharan, Mukundan and Zeng, Wenjie and Leal, William and Ju, Xi and Ramanath, Rajiv and Zhang, Hongwei and Arora, Anish</b>
    3663 
    3664 <div class="BibEntry">
    3665 
    3666 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3667 
    3668 
    3669 <tr>
    3670      <td>Author</td>
    3671      <td>Sridharan, Mukundan and Zeng, Wenjie and Leal, William and Ju, Xi and Ramanath, Rajiv and Zhang, Hongwei and Arora, Anish</td>
    3672 </tr>
    3673 
    3674 <tr>
    3675      <td>Title</td>
    3676      <td>From Kansei to KanseiGenie: Architecture of Federated, Programmable Wireless Sensor Fabrics</td>
    3677 </tr>
    3678 
    3679 <tr>
    3680      <td>Journal</td>
    3681      <td>Proceedings of the ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom)</td>
    3682 </tr>
    3683 
    3684 <tr>
    3685      <td>Year</td>
    3686      <td>2010</td>
    3687 </tr>
    3688 
    3689 <tr>
    3690      <td>Abstract</td>
    3691      <td>This paper deals with challenges in federating wireless sensing fabrics. Federations of this sort are currently being developed in next generation global end-to-end experimentation infrastructures, such as GENI, to support rapid prototyping and hi-fidelity validation of protocols and applications. On one hand, federation should support access to diverse (and potentially provider-specific) wireless sensor resources and, on the other, it should enable users to uniformly task these resources. Instead of more simple basing federation upon a standard description of resources, we propose an architecture where the ontology of resource description can vary across providers, and a mapping of user needs to resources is performed to achieve uniform tasking. We illustrate one realization of this architecture, in terms of our refactoring the Kansei testbed to become the KanseiGenie federated fabric manager, which has full support for programmability, sliceability, and federated experimentation over heterogeneous sensing fabrics.</td>
     3730<b class="myheading" style="position: relative; left: 5%;">Sridharan, Mukundan and Zeng, Wenjie and Leal, William and Ju, Xi and Ramanath, Rajiv and Zhang, Hongwei and Arora, Anish</b>
     3731
     3732<div class="BibEntry">
     3733
     3734<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3735
     3736
     3737<tr>
     3738     <td valign="top">Author</td>
     3739     <td valign="top">Sridharan, Mukundan and Zeng, Wenjie and Leal, William and Ju, Xi and Ramanath, Rajiv and Zhang, Hongwei and Arora, Anish</td>
     3740</tr>
     3741
     3742<tr>
     3743     <td valign="top">Title</td>
     3744     <td valign="top">From Kansei to KanseiGenie: Architecture of Federated, Programmable Wireless Sensor Fabrics</td>
     3745</tr>
     3746
     3747<tr>
     3748     <td valign="top">Journal</td>
     3749     <td valign="top">Proceedings of the ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom)</td>
     3750</tr>
     3751
     3752<tr>
     3753     <td valign="top">Year</td>
     3754     <td valign="top">2010</td>
     3755</tr>
     3756
     3757<tr>
     3758     <td valign="top">Abstract</td>
     3759     <td valign="top">This paper deals with challenges in federating wireless sensing fabrics. Federations of this sort are currently being developed in next generation global end-to-end experimentation infrastructures, such as GENI, to support rapid prototyping and hi-fidelity validation of protocols and applications. On one hand, federation should support access to diverse (and potentially provider-specific) wireless sensor resources and, on the other, it should enable users to uniformly task these resources. Instead of more simple basing federation upon a standard description of resources, we propose an architecture where the ontology of resource description can vary across providers, and a mapping of user needs to resources is performed to achieve uniform tasking. We illustrate one realization of this architecture, in terms of our refactoring the Kansei testbed to become the KanseiGenie federated fabric manager, which has full support for programmability, sliceability, and federated experimentation over heterogeneous sensing fabrics.</td>
    36923760</tr>
    36933761
    … …  
    37033771
    37043772<a class="EntryGoto" id="Stabler, Greg and Goasguen, Sebastien and Rosen, Aaron and Wang, Kuang-Ching"></a>
    3705 <b class="myheading" style="position: relative; left: 10%;">Stabler, Greg and Goasguen, Sebastien and Rosen, Aaron and Wang, Kuang-Ching</b>
    3706 
    3707 <div class="BibEntry">
    3708 
    3709 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3710 
    3711 
    3712 <tr>
    3713      <td>Author</td>
    3714      <td>Stabler, Greg and Goasguen, Sebastien and Rosen, Aaron and Wang, Kuang-Ching</td>
    3715 </tr>
    3716 
    3717 <tr>
    3718      <td>Title</td>
    3719      <td>OneCloud: Controlling the Network in an OpenFlow Cloud</td>
    3720 </tr>
    3721 
    3722 <tr>
    3723      <td>Booktitle</td>
    3724      <td>First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
    3725 </tr>
    3726 
    3727 <tr>
    3728      <td>Location</td>
    3729      <td>Los Angeles</td>
    3730 </tr>
    3731 
    3732 <tr>
    3733      <td>Year</td>
    3734      <td>2012</td>
    3735 </tr>
    3736 
    3737 <tr>
    3738      <td>Abstract</td>
    3739      <td>Cloud computing is an emerging paradigm for on-demand access to computing resources over the network. Beyond early Software as a Service (SaaS) offerings, there is an increasing interest in the Infrastructure as a Service (IaaS) model where users request specific storage, networking, and computing resources to meet their application needs. To provision the network in a cloud, IaaS providers, such as the Amazon Web Services, allow users to choose their IP addresses, which can be associated with a dynamic set of virtual hosts (Elastic IP) with VPN, dynamic DNS, and dynamic firewall services. In this paper, we analyze a range of cloud network provisioning needs and the means to realize them in an OpenFlow network. We present an OpenFlow enabled framework for cloud network provisioning, based on the Open- Nebula cloud provisioning engine. Specifically, we demonstrate an Elastic IP service compatible with the Amazon Elastic Compute Cloud (EC2) API. This demonstration is available on the Clemson OneCloud IaaS offering. Ongoing efforts focus on the enablement of additional cloud network services for campus networks and wide area experimental networks like the National Science Foundation's GENI network.</td>
     3773<b class="myheading" style="position: relative; left: 5%;">Stabler, Greg and Goasguen, Sebastien and Rosen, Aaron and Wang, Kuang-Ching</b>
     3774
     3775<div class="BibEntry">
     3776
     3777<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3778
     3779
     3780<tr>
     3781     <td valign="top">Author</td>
     3782     <td valign="top">Stabler, Greg and Goasguen, Sebastien and Rosen, Aaron and Wang, Kuang-Ching</td>
     3783</tr>
     3784
     3785<tr>
     3786     <td valign="top">Title</td>
     3787     <td valign="top">OneCloud: Controlling the Network in an OpenFlow Cloud</td>
     3788</tr>
     3789
     3790<tr>
     3791     <td valign="top">Booktitle</td>
     3792     <td valign="top">First GENI Research and Educational Experiment Workshop (GREE 2012)</td>
     3793</tr>
     3794
     3795<tr>
     3796     <td valign="top">Location</td>
     3797     <td valign="top">Los Angeles</td>
     3798</tr>
     3799
     3800<tr>
     3801     <td valign="top">Year</td>
     3802     <td valign="top">2012</td>
     3803</tr>
     3804
     3805<tr>
     3806     <td valign="top">Abstract</td>
     3807     <td valign="top">Cloud computing is an emerging paradigm for on-demand access to computing resources over the network. Beyond early Software as a Service (SaaS) offerings, there is an increasing interest in the Infrastructure as a Service (IaaS) model where users request specific storage, networking, and computing resources to meet their application needs. To provision the network in a cloud, IaaS providers, such as the Amazon Web Services, allow users to choose their IP addresses, which can be associated with a dynamic set of virtual hosts (Elastic IP) with VPN, dynamic DNS, and dynamic firewall services. In this paper, we analyze a range of cloud network provisioning needs and the means to realize them in an OpenFlow network. We present an OpenFlow enabled framework for cloud network provisioning, based on the Open- Nebula cloud provisioning engine. Specifically, we demonstrate an Elastic IP service compatible with the Amazon Elastic Compute Cloud (EC2) API. This demonstration is available on the Clemson OneCloud IaaS offering. Ongoing efforts focus on the enablement of additional cloud network services for campus networks and wide area experimental networks like the National Science Foundation's GENI network.</td>
    37403808</tr>
    37413809
    … …  
    37513819
    37523820<a class="EntryGoto" id="Sterbenz, James P. G. and &#x43;&#x0327;etinkaya, Egemen K. and Hameed, Mahmood A. and Jabbar, Abdul and Qian, Shi and Rohrer, Justin P."></a>
    3753 <b class="myheading" style="position: relative; left: 10%;">Sterbenz, James P. G. and &#x43;&#x0327;etinkaya, Egemen K. and Hameed, Mahmood A. and Jabbar, Abdul and Qian, Shi and Rohrer, Justin P.</b>
    3754 
    3755 <div class="BibEntry">
    3756 
    3757 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3758 
    3759 
    3760 <tr>
    3761      <td>Author</td>
    3762      <td>Sterbenz, James P. G. and &#x43;&#x0327;etinkaya, Egemen K. and Hameed, Mahmood A. and Jabbar, Abdul and Qian, Shi and Rohrer, Justin P.</td>
    3763 </tr>
    3764 
    3765 <tr>
    3766      <td>Title</td>
    3767      <td>Evaluation of network resilience, survivability, and disruption tolerance: analysis, topology generation, simulation, and experimentation</td>
    3768 </tr>
    3769 
    3770 <tr>
    3771      <td>Journal</td>
    3772      <td>Telecommunication Systems</td>
    3773 </tr>
    3774 
    3775 <tr>
    3776      <td>Publisher</td>
    3777      <td>Springer Netherlands</td>
    3778 </tr>
    3779 
    3780 <tr>
    3781      <td>Year</td>
    3782      <td>2011</td>
    3783 </tr>
    3784 
    3785 <tr>
    3786      <td>Abstract</td>
    3787      <td>As the Internet becomes increasingly important to all aspects of society, the consequences of disruption become increasingly severe. Thus it is critical to increase the resilience and survivability of future networks. We define resilience as the ability of the network to provide desired service even when challenged by attacks, large-scale disasters, and other failures. This paper describes a comprehensive methodology to evaluate network resilience using a combination of topology generation, analytical, simulation, and experimental emulation techniques with the goal of improving the resilience and survivability of the Future Internet.</td>
    3788 </tr>
    3789 
    3790 
    3791 
    3792 <tr>
    3793      <td>DOI</td>
    3794      <td>10.1007/s11235-011-9573-6</td>
    3795 </tr>
    3796 
    3797 
    3798 
    3799 <tr>
    3800      <td>URL</td>
    3801      <td><a href="http://dx.doi.org/10.1007/s11235-011-9573-6">http://dx.doi.org/10.1007/s11235-011-9573-6</a></td>
    3802 </tr>
     3821<b class="myheading" style="position: relative; left: 5%;">Sterbenz, James P. G. and &#x43;&#x0327;etinkaya, Egemen K. and Hameed, Mahmood A. and Jabbar, Abdul and Qian, Shi and Rohrer, Justin P.</b>
     3822
     3823<div class="BibEntry">
     3824
     3825<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3826
     3827
     3828<tr>
     3829     <td valign="top">Author</td>
     3830     <td valign="top">Sterbenz, James P. G. and &#x43;&#x0327;etinkaya, Egemen K. and Hameed, Mahmood A. and Jabbar, Abdul and Qian, Shi and Rohrer, Justin P.</td>
     3831</tr>
     3832
     3833<tr>
     3834     <td valign="top">Title</td>
     3835     <td valign="top">Evaluation of network resilience, survivability, and disruption tolerance: analysis, topology generation, simulation, and experimentation</td>
     3836</tr>
     3837
     3838<tr>
     3839     <td valign="top">Journal</td>
     3840     <td valign="top">Telecommunication Systems</td>
     3841</tr>
     3842
     3843<tr>
     3844     <td valign="top">Publisher</td>
     3845     <td valign="top">Springer Netherlands</td>
     3846</tr>
     3847
     3848<tr>
     3849     <td valign="top">Year</td>
     3850     <td valign="top">2011</td>
     3851</tr>
     3852
     3853<tr>
     3854     <td valign="top">Abstract</td>
     3855     <td valign="top">As the Internet becomes increasingly important to all aspects of society, the consequences of disruption become increasingly severe. Thus it is critical to increase the resilience and survivability of future networks. We define resilience as the ability of the network to provide desired service even when challenged by attacks, large-scale disasters, and other failures. This paper describes a comprehensive methodology to evaluate network resilience using a combination of topology generation, analytical, simulation, and experimental emulation techniques with the goal of improving the resilience and survivability of the Future Internet.</td>
     3856</tr>
     3857
     3858
     3859
     3860<tr>
     3861     <td valign="top">DOI</td>
     3862     <td valign="top">10.1007/s11235-011-9573-6</td>
     3863</tr>
     3864
     3865
     3866
     3867<tr>
     3868     <td valign="top">URL</td>
     3869     <td valign="top"><a href="http://dx.doi.org/10.1007/s11235-011-9573-6">http://dx.doi.org/10.1007/s11235-011-9573-6</a></td>
     3870</tr>
     3871
     3872
     3873</table></div><br><br>
     3874
     3875
     3876
     3877
     3878<a class="EntryGoto" id="Teerapittayanon, Surat and Fouli, Kerim and M&#x65;&#x0301;dard, Muriel and Montpetit, Marie-Jos&#x65;&#x0301; and Shi, Xiaomeng and Seskar, Ivan and Gosain, Abhimanyu"></a>
     3879<b class="myheading" style="position: relative; left: 5%;">Teerapittayanon, Surat and Fouli, Kerim and M&#x65;&#x0301;dard, Muriel and Montpetit, Marie-Jos&#x65;&#x0301; and Shi, Xiaomeng and Seskar, Ivan and Gosain, Abhimanyu</b>
     3880
     3881<div class="BibEntry">
     3882
     3883<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3884
     3885
     3886<tr>
     3887     <td valign="top">Author</td>
     3888     <td valign="top">Teerapittayanon, Surat and Fouli, Kerim and M&#x65;&#x0301;dard, Muriel and Montpetit, Marie-Jos&#x65;&#x0301; and Shi, Xiaomeng and Seskar, Ivan and Gosain, Abhimanyu</td>
     3889</tr>
     3890
     3891<tr>
     3892     <td valign="top">Title</td>
     3893     <td valign="top">Network Coding as a WiMAX Link Reliability Mechanism</td>
     3894</tr>
     3895
     3896<tr>
     3897     <td valign="top">Booktitle</td>
     3898     <td valign="top">MACOM 2012 - To Appear in Springer Lecture Notes in Computer Science (LNCS)</td>
     3899</tr>
     3900
     3901<tr>
     3902     <td valign="top">Abstract</td>
     3903     <td valign="top">We design and implement a network-coding-enabled relia- bility architecture for next generation wireless networks. Our network coding (NC) architecture uses a flexible thread-based design, with each encoder-decoder instance applying systematic intra-session random lin- ear network coding as a packet erasure code at the IP layer. Using GENI WiMAX platforms, a series of point-to-point transmission experiments were conducted to compare the performance of the NC architecture to that of the Automatic Repeated reQuest (ARQ) and Hybrid ARQ (HARQ) mechanisms. In our scenarios, the proposed architecture is able to decrease packet loss from around 11-32&#x0025; to nearly 0&#x0025;; compared to HARQ and joint HARQ/ARQ mechanisms, the NC architecture offers up to 5.9 times gain in throughput and 5.5 times reduction in end-to- end file transfer delay. By establishing NC as a potential substitute for HARQ/ARQ, our experiments offer important insights into cross-layer designs of next generation wireless networks.</td>
     3904</tr>
     3905
     3906
     3907
     3908
    38033909
    38043910
    … …  
    38093915
    38103916<a class="EntryGoto" id="Thomas, Charles and Sommers, Joel and Barford, Paul and Kim, Dongchan and Das, Ananya and Segebre, Roberto and Crovella, Mark"></a>
    3811 <b class="myheading" style="position: relative; left: 10%;">Thomas, Charles and Sommers, Joel and Barford, Paul and Kim, Dongchan and Das, Ananya and Segebre, Roberto and Crovella, Mark</b>
    3812 
    3813 <div class="BibEntry">
    3814 
    3815 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3816 
    3817 
    3818 <tr>
    3819      <td>Author</td>
    3820      <td>Thomas, Charles and Sommers, Joel and Barford, Paul and Kim, Dongchan and Das, Ananya and Segebre, Roberto and Crovella, Mark</td>
    3821 </tr>
    3822 
    3823 <tr>
    3824      <td>Title</td>
    3825      <td>A Passive Measurement System for Network Testbeds</td>
    3826 </tr>
    3827 
    3828 <tr>
    3829      <td>Booktitle</td>
    3830      <td>8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM 2012)</td>
    3831 </tr>
    3832 
    3833 <tr>
    3834      <td>Year</td>
    3835      <td>2012</td>
    3836 </tr>
    3837 
    3838 <tr>
    3839      <td>Abstract</td>
    3840      <td>The ability to capture and process packet-level data is of intrinsic importance in network testbeds that offer broad experimental capabilities to researchers. In this paper we describe the design and implementation of a passive measurement system for network testbeds called GIMS. The system enables users to specify and centrally manage packet capture on a set of dedicated measurement nodes deployed on links in a distributed testbed. The first component of GIMS is a scalable experiment management system that coordinates multi-tenant access to measurement nodes through a web-based user interface. The second component of GIMS is a node management system that enables \\\\\\\\em (i) local processing on packets (\\\\\\\\em e.g., flow aggregation and sampling), \\\\\\\\em (ii) meta-data to be added to captured packets (\\\\\\\\em e.g., timestamps), \\\\\\\\em (iii) packet anonymization per local security policy, and \\\\\\\\em (iv) flexible data storage including transfer to remote archives. We demonstrate the capabilities of GIMS through a set of micro-benchmarks that specifically highlight the performance of the node management system deployed on a commodity workstation. Our implementations are openly available to the community and our development efforts are on-going.</td>
     3917<b class="myheading" style="position: relative; left: 5%;">Thomas, Charles and Sommers, Joel and Barford, Paul and Kim, Dongchan and Das, Ananya and Segebre, Roberto and Crovella, Mark</b>
     3918
     3919<div class="BibEntry">
     3920
     3921<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3922
     3923
     3924<tr>
     3925     <td valign="top">Author</td>
     3926     <td valign="top">Thomas, Charles and Sommers, Joel and Barford, Paul and Kim, Dongchan and Das, Ananya and Segebre, Roberto and Crovella, Mark</td>
     3927</tr>
     3928
     3929<tr>
     3930     <td valign="top">Title</td>
     3931     <td valign="top">A Passive Measurement System for Network Testbeds</td>
     3932</tr>
     3933
     3934<tr>
     3935     <td valign="top">Booktitle</td>
     3936     <td valign="top">8th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TRIDENTCOM 2012)</td>
     3937</tr>
     3938
     3939<tr>
     3940     <td valign="top">Year</td>
     3941     <td valign="top">2012</td>
     3942</tr>
     3943
     3944<tr>
     3945     <td valign="top">Abstract</td>
     3946     <td valign="top">The ability to capture and process packet-level data is of intrinsic importance in network testbeds that offer broad experimental capabilities to researchers. In this paper we describe the design and implementation of a passive measurement system for network testbeds called GIMS. The system enables users to specify and centrally manage packet capture on a set of dedicated measurement nodes deployed on links in a distributed testbed. The first component of GIMS is a scalable experiment management system that coordinates multi-tenant access to measurement nodes through a web-based user interface. The second component of GIMS is a node management system that enables \\\\em (i) local processing on packets (\\\\em e.g., flow aggregation and sampling), \\\\em (ii) meta-data to be added to captured packets (\\\\em e.g., timestamps), \\\\em (iii) packet anonymization per local security policy, and \\\\em (iv) flexible data storage including transfer to remote archives. We demonstrate the capabilities of GIMS through a set of micro-benchmarks that specifically highlight the performance of the node management system deployed on a commodity workstation. Our implementations are openly available to the community and our development efforts are on-going.</td>
    38413947</tr>
    38423948
    … …  
    38523958
    38533959<a class="EntryGoto" id="Tiako, Pierre F."></a>
    3854 <b class="myheading" style="position: relative; left: 10%;">Tiako, Pierre F.</b>
    3855 
    3856 <div class="BibEntry">
    3857 
    3858 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3859 
    3860 
    3861 <tr>
    3862      <td>Author</td>
    3863      <td>Tiako, Pierre F.</td>
    3864 </tr>
    3865 
    3866 <tr>
    3867      <td>Title</td>
    3868      <td>Perspectives of delegation in team-based distributed software development over the GENI infrastructure (NIER track)</td>
    3869 </tr>
    3870 
    3871 <tr>
    3872      <td>Booktitle</td>
    3873      <td>Proceedings of the 33rd International Conference on Software Engineering</td>
    3874 </tr>
    3875 
    3876 <tr>
    3877      <td>Location</td>
    3878      <td>Waikiki, Honolulu, HI, USA</td>
    3879 </tr>
    3880 
    3881 <tr>
    3882      <td>Publisher</td>
    3883      <td>ACM</td>
    3884 </tr>
    3885 
    3886 <tr>
    3887      <td>Address</td>
    3888      <td>New York, NY, USA</td>
    3889 </tr>
    3890 
    3891 <tr>
    3892      <td>Year</td>
    3893      <td>2011</td>
    3894 </tr>
    3895 
    3896 <tr>
    3897      <td>Abstract</td>
    3898      <td>Team-based distributed software development (TBDSD) is one of the single biggest challenges facing software companies. The need to manage development efforts and resources in different locations increase the complexity and cost of modern day software development. Current software development environments do not provide suitable support to delegate task among teams with appropriate directives. TBDSD is also limited to the current internet capabilities. One of the resulting problems is the difficulty to delegate and control tasks assigned among remote teams. This paper proposes (1) a new framework for delegation in TBDSD, and (2) perspectives for deploying Process-centered Software Engineering Environments (PSEE) over the Global Environment for Network Innovations (GENI) infrastructure. GENI, the 'future Internet' that is taking shape in prototypes across the US, will allow, in the context of our study, to securely access and share software artifacts, resources, and tools as never before seen over the current Internet.</td>
    3899 </tr>
    3900 
    3901 
    3902 
    3903 <tr>
    3904      <td>DOI</td>
    3905      <td>10.1145/1985793.1985905</td>
    3906 </tr>
    3907 
    3908 
    3909 
    3910 <tr>
    3911      <td>URL</td>
    3912      <td><a href="http://dx.doi.org/10.1145/1985793.1985905">http://dx.doi.org/10.1145/1985793.1985905</a></td>
     3960<b class="myheading" style="position: relative; left: 5%;">Tiako, Pierre F.</b>
     3961
     3962<div class="BibEntry">
     3963
     3964<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     3965
     3966
     3967<tr>
     3968     <td valign="top">Author</td>
     3969     <td valign="top">Tiako, Pierre F.</td>
     3970</tr>
     3971
     3972<tr>
     3973     <td valign="top">Title</td>
     3974     <td valign="top">Perspectives of delegation in team-based distributed software development over the GENI infrastructure (NIER track)</td>
     3975</tr>
     3976
     3977<tr>
     3978     <td valign="top">Booktitle</td>
     3979     <td valign="top">Proceedings of the 33rd International Conference on Software Engineering</td>
     3980</tr>
     3981
     3982<tr>
     3983     <td valign="top">Location</td>
     3984     <td valign="top">Waikiki, Honolulu, HI, USA</td>
     3985</tr>
     3986
     3987<tr>
     3988     <td valign="top">Publisher</td>
     3989     <td valign="top">ACM</td>
     3990</tr>
     3991
     3992<tr>
     3993     <td valign="top">Address</td>
     3994     <td valign="top">New York, NY, USA</td>
     3995</tr>
     3996
     3997<tr>
     3998     <td valign="top">Year</td>
     3999     <td valign="top">2011</td>
     4000</tr>
     4001
     4002<tr>
     4003     <td valign="top">Abstract</td>
     4004     <td valign="top">Team-based distributed software development (TBDSD) is one of the single biggest challenges facing software companies. The need to manage development efforts and resources in different locations increase the complexity and cost of modern day software development. Current software development environments do not provide suitable support to delegate task among teams with appropriate directives. TBDSD is also limited to the current internet capabilities. One of the resulting problems is the difficulty to delegate and control tasks assigned among remote teams. This paper proposes (1) a new framework for delegation in TBDSD, and (2) perspectives for deploying Process-centered Software Engineering Environments (PSEE) over the Global Environment for Network Innovations (GENI) infrastructure. GENI, the 'future Internet' that is taking shape in prototypes across the US, will allow, in the context of our study, to securely access and share software artifacts, resources, and tools as never before seen over the current Internet.</td>
     4005</tr>
     4006
     4007
     4008
     4009<tr>
     4010     <td valign="top">DOI</td>
     4011     <td valign="top">10.1145/1985793.1985905</td>
     4012</tr>
     4013
     4014
     4015
     4016<tr>
     4017     <td valign="top">URL</td>
     4018     <td valign="top"><a href="http://dx.doi.org/10.1145/1985793.1985905">http://dx.doi.org/10.1145/1985793.1985905</a></td>
    39134019</tr>
    39144020
    … …  
    39204026
    39214027<a class="EntryGoto" id="Turner, Jonathan S."></a>
    3922 <b class="myheading" style="position: relative; left: 10%;">Turner, Jonathan S.</b>
    3923 
    3924 <div class="BibEntry">
    3925 
    3926 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3927 
    3928 
    3929 <tr>
    3930      <td>Author</td>
    3931      <td>Turner, Jonathan S.</td>
    3932 </tr>
    3933 
    3934 <tr>
    3935      <td>Title</td>
    3936      <td>A proposed architecture for the GENI backbone platform</td>
    3937 </tr>
    3938 
    3939 <tr>
    3940      <td>Booktitle</td>
    3941      <td>Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems</td>
    3942 </tr>
    3943 
    3944 <tr>
    3945      <td>Location</td>
    3946      <td>San Jose, California, USA</td>
    3947 </tr>
    3948 
    3949 <tr>
    3950      <td>Publisher</td>
    3951      <td>ACM</td>
    3952 </tr>
    3953 
    3954 <tr>
    3955      <td>Address</td>
    3956      <td>New York, NY, USA</td>
    3957 </tr>
    3958 
    3959 <tr>
    3960      <td>Year</td>
    3961      <td>2006</td>
    3962 </tr>
    3963 
    3964 <tr>
    3965      <td>Abstract</td>
    3966      <td>The GENI Project (Global Environment for Network Innovation) is a major NSF-sponsored initiative that seeks to create a national research facility to enable experimental deployment of innovative new network architectures on a sufficient scale to enable realistic evaluation. One key component of the GENI system will be the GENI Backbone Platform (GBP) that provides the resources needed to allow multiple experimental networks to co-exist within the shared GENI infrastructure. This paper reviews the objectives for the GBP, the key issues that affect its design and develops a reference architecture that provides a concrete example for how the objectives can be met, using commercially available subsystems.</td>
    3967 </tr>
    3968 
    3969 
    3970 
    3971 <tr>
    3972      <td>DOI</td>
    3973      <td>10.1145/1185347.1185349</td>
    3974 </tr>
    3975 
    3976 
    3977 
    3978 <tr>
    3979      <td>URL</td>
    3980      <td><a href="http://dx.doi.org/10.1145/1185347.1185349">http://dx.doi.org/10.1145/1185347.1185349</a></td>
     4028<b class="myheading" style="position: relative; left: 5%;">Turner, Jonathan S.</b>
     4029
     4030<div class="BibEntry">
     4031
     4032<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4033
     4034
     4035<tr>
     4036     <td valign="top">Author</td>
     4037     <td valign="top">Turner, Jonathan S.</td>
     4038</tr>
     4039
     4040<tr>
     4041     <td valign="top">Title</td>
     4042     <td valign="top">A proposed architecture for the GENI backbone platform</td>
     4043</tr>
     4044
     4045<tr>
     4046     <td valign="top">Booktitle</td>
     4047     <td valign="top">Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems</td>
     4048</tr>
     4049
     4050<tr>
     4051     <td valign="top">Location</td>
     4052     <td valign="top">San Jose, California, USA</td>
     4053</tr>
     4054
     4055<tr>
     4056     <td valign="top">Publisher</td>
     4057     <td valign="top">ACM</td>
     4058</tr>
     4059
     4060<tr>
     4061     <td valign="top">Address</td>
     4062     <td valign="top">New York, NY, USA</td>
     4063</tr>
     4064
     4065<tr>
     4066     <td valign="top">Year</td>
     4067     <td valign="top">2006</td>
     4068</tr>
     4069
     4070<tr>
     4071     <td valign="top">Abstract</td>
     4072     <td valign="top">The GENI Project (Global Environment for Network Innovation) is a major NSF-sponsored initiative that seeks to create a national research facility to enable experimental deployment of innovative new network architectures on a sufficient scale to enable realistic evaluation. One key component of the GENI system will be the GENI Backbone Platform (GBP) that provides the resources needed to allow multiple experimental networks to co-exist within the shared GENI infrastructure. This paper reviews the objectives for the GBP, the key issues that affect its design and develops a reference architecture that provides a concrete example for how the objectives can be met, using commercially available subsystems.</td>
     4073</tr>
     4074
     4075
     4076
     4077<tr>
     4078     <td valign="top">DOI</td>
     4079     <td valign="top">10.1145/1185347.1185349</td>
     4080</tr>
     4081
     4082
     4083
     4084<tr>
     4085     <td valign="top">URL</td>
     4086     <td valign="top"><a href="http://dx.doi.org/10.1145/1185347.1185349">http://dx.doi.org/10.1145/1185347.1185349</a></td>
    39814087</tr>
    39824088
    … …  
    39884094
    39894095<a class="EntryGoto" id="Turner, Jonathan S. and Crowley, Patrick and DeHart, John and Freestone, Amy and Heller, Brandon and Kuhns, Fred and Kumar, Sailesh and Lockwood, John and Lu, Jing and Wilson, Michael and Wiseman, Charles and Zar, David"></a>
    3990 <b class="myheading" style="position: relative; left: 10%;">Turner, Jonathan S. and Crowley, Patrick and DeHart, John and Freestone, Amy and Heller, Brandon and Kuhns, Fred and Kumar, Sailesh and Lockwood, John and Lu, Jing and Wilson, Michael and Wiseman, Charles and Zar, David</b>
    3991 
    3992 <div class="BibEntry">
    3993 
    3994 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    3995 
    3996 
    3997 <tr>
    3998      <td>Author</td>
    3999      <td>Turner, Jonathan S. and Crowley, Patrick and DeHart, John and Freestone, Amy and Heller, Brandon and Kuhns, Fred and Kumar, Sailesh and Lockwood, John and Lu, Jing and Wilson, Michael and Wiseman, Charles and Zar, David</td>
    4000 </tr>
    4001 
    4002 <tr>
    4003      <td>Title</td>
    4004      <td>Supercharging planetlab: a high performance, multi-application, overlay network platform</td>
    4005 </tr>
    4006 
    4007 <tr>
    4008      <td>Journal</td>
    4009      <td>SIGCOMM Comput. Commun. Rev.</td>
    4010 </tr>
    4011 
    4012 <tr>
    4013      <td>Publisher</td>
    4014      <td>ACM</td>
    4015 </tr>
    4016 
    4017 <tr>
    4018      <td>Address</td>
    4019      <td>New York, NY, USA</td>
    4020 </tr>
    4021 
    4022 <tr>
    4023      <td>Year</td>
    4024      <td>2007</td>
    4025 </tr>
    4026 
    4027 <tr>
    4028      <td>Abstract</td>
    4029      <td>In recent years, overlay networks have become an important vehicle for delivering Internet applications. Overlay network nodes are typically implemented using general purpose servers or clusters. We investigate the performance benefits of more integrated architectures, combining general-purpose servers with high performance Network Processor (NP) subsystems. We focus on PlanetLab as our experimental context and report on the design and evaluation of an experimental PlanetLab platform capable of much higher levels of performance than typical system configurations. To make it easier for users to port applications, the system supports a fast path/slow path application structure that facilitates the mapping of the most performance-critical parts of an application onto an NP subsystem, while allowing the more complex control and exception-handling to be implemented within the programmer-friendly environment provided by conventional servers. We report on implementations of two sample applications, an IPv4 router, and a forwarding application for the Internet Indirection Infrastructure. We demonstrate an 80x improvement in packet processing rates and comparable reductions in latency.</td>
    4030 </tr>
    4031 
    4032 
    4033 
    4034 <tr>
    4035      <td>DOI</td>
    4036      <td>10.1145/1282427.1282391</td>
    4037 </tr>
    4038 
    4039 
    4040 
    4041 <tr>
    4042      <td>URL</td>
    4043      <td><a href="http://dx.doi.org/10.1145/1282427.1282391">http://dx.doi.org/10.1145/1282427.1282391</a></td>
     4096<b class="myheading" style="position: relative; left: 5%;">Turner, Jonathan S. and Crowley, Patrick and DeHart, John and Freestone, Amy and Heller, Brandon and Kuhns, Fred and Kumar, Sailesh and Lockwood, John and Lu, Jing and Wilson, Michael and Wiseman, Charles and Zar, David</b>
     4097
     4098<div class="BibEntry">
     4099
     4100<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4101
     4102
     4103<tr>
     4104     <td valign="top">Author</td>
     4105     <td valign="top">Turner, Jonathan S. and Crowley, Patrick and DeHart, John and Freestone, Amy and Heller, Brandon and Kuhns, Fred and Kumar, Sailesh and Lockwood, John and Lu, Jing and Wilson, Michael and Wiseman, Charles and Zar, David</td>
     4106</tr>
     4107
     4108<tr>
     4109     <td valign="top">Title</td>
     4110     <td valign="top">Supercharging planetlab: a high performance, multi-application, overlay network platform</td>
     4111</tr>
     4112
     4113<tr>
     4114     <td valign="top">Journal</td>
     4115     <td valign="top">SIGCOMM Comput. Commun. Rev.</td>
     4116</tr>
     4117
     4118<tr>
     4119     <td valign="top">Publisher</td>
     4120     <td valign="top">ACM</td>
     4121</tr>
     4122
     4123<tr>
     4124     <td valign="top">Address</td>
     4125     <td valign="top">New York, NY, USA</td>
     4126</tr>
     4127
     4128<tr>
     4129     <td valign="top">Year</td>
     4130     <td valign="top">2007</td>
     4131</tr>
     4132
     4133<tr>
     4134     <td valign="top">Abstract</td>
     4135     <td valign="top">In recent years, overlay networks have become an important vehicle for delivering Internet applications. Overlay network nodes are typically implemented using general purpose servers or clusters. We investigate the performance benefits of more integrated architectures, combining general-purpose servers with high performance Network Processor (NP) subsystems. We focus on PlanetLab as our experimental context and report on the design and evaluation of an experimental PlanetLab platform capable of much higher levels of performance than typical system configurations. To make it easier for users to port applications, the system supports a fast path/slow path application structure that facilitates the mapping of the most performance-critical parts of an application onto an NP subsystem, while allowing the more complex control and exception-handling to be implemented within the programmer-friendly environment provided by conventional servers. We report on implementations of two sample applications, an IPv4 router, and a forwarding application for the Internet Indirection Infrastructure. We demonstrate an 80x improvement in packet processing rates and comparable reductions in latency.</td>
     4136</tr>
     4137
     4138
     4139
     4140<tr>
     4141     <td valign="top">DOI</td>
     4142     <td valign="top">10.1145/1282427.1282391</td>
     4143</tr>
     4144
     4145
     4146
     4147<tr>
     4148     <td valign="top">URL</td>
     4149     <td valign="top"><a href="http://dx.doi.org/10.1145/1282427.1282391">http://dx.doi.org/10.1145/1282427.1282391</a></td>
    40444150</tr>
    40454151
    … …  
    40514157
    40524158<a class="EntryGoto" id="Valancius, Vytautas and Feamster, Nick"></a>
    4053 <b class="myheading" style="position: relative; left: 10%;">Valancius, Vytautas and Feamster, Nick</b>
    4054 
    4055 <div class="BibEntry">
    4056 
    4057 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4058 
    4059 
    4060 <tr>
    4061      <td>Author</td>
    4062      <td>Valancius, Vytautas and Feamster, Nick</td>
    4063 </tr>
    4064 
    4065 <tr>
    4066      <td>Title</td>
    4067      <td>Multiplexing BGP sessions with BGP-Mux</td>
    4068 </tr>
    4069 
    4070 <tr>
    4071      <td>Booktitle</td>
    4072      <td>Proceedings of the 2007 ACM CoNEXT conference</td>
    4073 </tr>
    4074 
    4075 <tr>
    4076      <td>Location</td>
    4077      <td>New York, New York</td>
    4078 </tr>
    4079 
    4080 <tr>
    4081      <td>Publisher</td>
    4082      <td>ACM</td>
    4083 </tr>
    4084 
    4085 <tr>
    4086      <td>Address</td>
    4087      <td>New York, NY, USA</td>
    4088 </tr>
    4089 
    4090 <tr>
    4091      <td>Year</td>
    4092      <td>2007</td>
    4093 </tr>
    4094 
    4095 <tr>
    4096      <td>Abstract</td>
    4097      <td>This paper describes a BGP-session multiplexer called BGP-Mux, which provides stable, on-demand access to global BGP route feeds. This gateway allows arbitrary and even transient client BGP connections to be provisioned and torn down on demand without affecting globally visible BGP sessions. BGP-Mux provides two capabilities: (1) the ability for a client network to receive multiple unfiltered routes per destination from a set of upstream ASes; and (2) the ability to provision BGP sessions without introducing global instability. Several applications could benefit from these features:</td>
    4098 </tr>
    4099 
    4100 
    4101 
    4102 <tr>
    4103      <td>DOI</td>
    4104      <td>10.1145/1364654.1364707</td>
    4105 </tr>
    4106 
    4107 
    4108 
    4109 <tr>
    4110      <td>URL</td>
    4111      <td><a href="http://dx.doi.org/10.1145/1364654.1364707">http://dx.doi.org/10.1145/1364654.1364707</a></td>
     4159<b class="myheading" style="position: relative; left: 5%;">Valancius, Vytautas and Feamster, Nick</b>
     4160
     4161<div class="BibEntry">
     4162
     4163<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4164
     4165
     4166<tr>
     4167     <td valign="top">Author</td>
     4168     <td valign="top">Valancius, Vytautas and Feamster, Nick</td>
     4169</tr>
     4170
     4171<tr>
     4172     <td valign="top">Title</td>
     4173     <td valign="top">Multiplexing BGP sessions with BGP-Mux</td>
     4174</tr>
     4175
     4176<tr>
     4177     <td valign="top">Booktitle</td>
     4178     <td valign="top">Proceedings of the 2007 ACM CoNEXT conference</td>
     4179</tr>
     4180
     4181<tr>
     4182     <td valign="top">Location</td>
     4183     <td valign="top">New York, New York</td>
     4184</tr>
     4185
     4186<tr>
     4187     <td valign="top">Publisher</td>
     4188     <td valign="top">ACM</td>
     4189</tr>
     4190
     4191<tr>
     4192     <td valign="top">Address</td>
     4193     <td valign="top">New York, NY, USA</td>
     4194</tr>
     4195
     4196<tr>
     4197     <td valign="top">Year</td>
     4198     <td valign="top">2007</td>
     4199</tr>
     4200
     4201<tr>
     4202     <td valign="top">Abstract</td>
     4203     <td valign="top">This paper describes a BGP-session multiplexer called BGP-Mux, which provides stable, on-demand access to global BGP route feeds. This gateway allows arbitrary and even transient client BGP connections to be provisioned and torn down on demand without affecting globally visible BGP sessions. BGP-Mux provides two capabilities: (1) the ability for a client network to receive multiple unfiltered routes per destination from a set of upstream ASes; and (2) the ability to provision BGP sessions without introducing global instability. Several applications could benefit from these features:</td>
     4204</tr>
     4205
     4206
     4207
     4208<tr>
     4209     <td valign="top">DOI</td>
     4210     <td valign="top">10.1145/1364654.1364707</td>
     4211</tr>
     4212
     4213
     4214
     4215<tr>
     4216     <td valign="top">URL</td>
     4217     <td valign="top"><a href="http://dx.doi.org/10.1145/1364654.1364707">http://dx.doi.org/10.1145/1364654.1364707</a></td>
    41124218</tr>
    41134219
    … …  
    41194225
    41204226<a class="EntryGoto" id="Valancius, Vytautas and Feamster, Nick and Rexford, Jennifer and Nakao, Akihiro"></a>
    4121 <b class="myheading" style="position: relative; left: 10%;">Valancius, Vytautas and Feamster, Nick and Rexford, Jennifer and Nakao, Akihiro</b>
    4122 
    4123 <div class="BibEntry">
    4124 
    4125 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4126 
    4127 
    4128 <tr>
    4129      <td>Author</td>
    4130      <td>Valancius, Vytautas and Feamster, Nick and Rexford, Jennifer and Nakao, Akihiro</td>
    4131 </tr>
    4132 
    4133 <tr>
    4134      <td>Title</td>
    4135      <td>Wide-area route control for distributed services</td>
    4136 </tr>
    4137 
    4138 <tr>
    4139      <td>Booktitle</td>
    4140      <td>Proceedings of the 2010 USENIX conference on USENIX annual technical conference</td>
    4141 </tr>
    4142 
    4143 <tr>
    4144      <td>Location</td>
    4145      <td>Boston, MA</td>
    4146 </tr>
    4147 
    4148 <tr>
    4149      <td>Publisher</td>
    4150      <td>USENIX Association</td>
    4151 </tr>
    4152 
    4153 <tr>
    4154      <td>Address</td>
    4155      <td>Berkeley, CA, USA</td>
    4156 </tr>
    4157 
    4158 <tr>
    4159      <td>Year</td>
    4160      <td>2010</td>
    4161 </tr>
    4162 
    4163 <tr>
    4164      <td>Abstract</td>
    4165      <td>Many distributed services would benefit from control over the flow of traffic to and from their users, to offer better performance and higher reliability at a reasonable cost. Unfortunately, although today's cloud-computing platforms offer elastic computing and bandwidth resources, they do not give services control over wide-area routing. We propose replacing the data center's border router with a Transit Portal (TP) that gives each service the illusion of direct connectivity to upstream ISPs, without requiring each service to deploy hardware, acquire IP address space, or negotiate contracts with ISPs. Our TP prototype supports many layer-two connectivity mechanisms, amortizes memory and message overhead over multiple services, and protects the rest of the Internet from misconfigured and malicious applications. Our implementation extends and synthesizes open-source software components such as the Linux kernel and the Quagga routing daemon. We also implement a management plane based on the GENI control framework and couple this with our four-site TP deployment and Amazon EC2 facilities. Experiments with an anycast DNS application demonstrate the benefits the TP offers to distributed services.</td>
    4166 </tr>
    4167 
    4168 
    4169 
    4170 
    4171 
    4172 <tr>
    4173      <td>URL</td>
    4174      <td><a href="http://portal.acm.org/citation.cfm?id=1855842">http://portal.acm.org/citation.cfm?id=1855842</a></td>
     4227<b class="myheading" style="position: relative; left: 5%;">Valancius, Vytautas and Feamster, Nick and Rexford, Jennifer and Nakao, Akihiro</b>
     4228
     4229<div class="BibEntry">
     4230
     4231<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4232
     4233
     4234<tr>
     4235     <td valign="top">Author</td>
     4236     <td valign="top">Valancius, Vytautas and Feamster, Nick and Rexford, Jennifer and Nakao, Akihiro</td>
     4237</tr>
     4238
     4239<tr>
     4240     <td valign="top">Title</td>
     4241     <td valign="top">Wide-area route control for distributed services</td>
     4242</tr>
     4243
     4244<tr>
     4245     <td valign="top">Booktitle</td>
     4246     <td valign="top">Proceedings of the 2010 USENIX conference on USENIX annual technical conference</td>
     4247</tr>
     4248
     4249<tr>
     4250     <td valign="top">Location</td>
     4251     <td valign="top">Boston, MA</td>
     4252</tr>
     4253
     4254<tr>
     4255     <td valign="top">Publisher</td>
     4256     <td valign="top">USENIX Association</td>
     4257</tr>
     4258
     4259<tr>
     4260     <td valign="top">Address</td>
     4261     <td valign="top">Berkeley, CA, USA</td>
     4262</tr>
     4263
     4264<tr>
     4265     <td valign="top">Year</td>
     4266     <td valign="top">2010</td>
     4267</tr>
     4268
     4269<tr>
     4270     <td valign="top">Abstract</td>
     4271     <td valign="top">Many distributed services would benefit from control over the flow of traffic to and from their users, to offer better performance and higher reliability at a reasonable cost. Unfortunately, although today's cloud-computing platforms offer elastic computing and bandwidth resources, they do not give services control over wide-area routing. We propose replacing the data center's border router with a Transit Portal (TP) that gives each service the illusion of direct connectivity to upstream ISPs, without requiring each service to deploy hardware, acquire IP address space, or negotiate contracts with ISPs. Our TP prototype supports many layer-two connectivity mechanisms, amortizes memory and message overhead over multiple services, and protects the rest of the Internet from misconfigured and malicious applications. Our implementation extends and synthesizes open-source software components such as the Linux kernel and the Quagga routing daemon. We also implement a management plane based on the GENI control framework and couple this with our four-site TP deployment and Amazon EC2 facilities. Experiments with an anycast DNS application demonstrate the benefits the TP offers to distributed services.</td>
     4272</tr>
     4273
     4274
     4275
     4276
     4277
     4278<tr>
     4279     <td valign="top">URL</td>
     4280     <td valign="top"><a href="http://portal.acm.org/citation.cfm?id=1855842">http://portal.acm.org/citation.cfm?id=1855842</a></td>
    41754281</tr>
    41764282
    … …  
    41824288
    41834289<a class="EntryGoto" id="Valancius, Vytautas and Kim, Hyojoon and Feamster, Nick"></a>
    4184 <b class="myheading" style="position: relative; left: 10%;">Valancius, Vytautas and Kim, Hyojoon and Feamster, Nick</b>
    4185 
    4186 <div class="BibEntry">
    4187 
    4188 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4189 
    4190 
    4191 <tr>
    4192      <td>Author</td>
    4193      <td>Valancius, Vytautas and Kim, Hyojoon and Feamster, Nick</td>
    4194 </tr>
    4195 
    4196 <tr>
    4197      <td>Title</td>
    4198      <td>Transit portal: BGP connectivity as a service</td>
    4199 </tr>
    4200 
    4201 <tr>
    4202      <td>Journal</td>
    4203      <td>SIGCOMM Comput. Commun. Rev.</td>
    4204 </tr>
    4205 
    4206 <tr>
    4207      <td>Publisher</td>
    4208      <td>ACM</td>
    4209 </tr>
    4210 
    4211 <tr>
    4212      <td>Address</td>
    4213      <td>New York, NY, USA</td>
    4214 </tr>
    4215 
    4216 <tr>
    4217      <td>Year</td>
    4218      <td>2010</td>
    4219 </tr>
    4220 
    4221 <tr>
    4222      <td>Abstract</td>
    4223      <td>We demonstrate Transit Portal, a system that provides on-demand BGP Internet connectivity to multiple ISPs. Transit Portal provides connectivity to any virtual network or distributed service that needs to control its inbound and outbound route control. Examples of such services include virtual networks and distributed services in cloud computing environments (e.g., Amazon's EC2) that need to control inbound and outbound traffic.</td>
    4224 </tr>
    4225 
    4226 
    4227 
    4228 <tr>
    4229      <td>DOI</td>
    4230      <td>10.1145/1851182.1851265</td>
    4231 </tr>
    4232 
    4233 
    4234 
    4235 <tr>
    4236      <td>URL</td>
    4237      <td><a href="http://dl.acm.org/citation.cfm?id=1851265">http://dl.acm.org/citation.cfm?id=1851265</a></td>
     4290<b class="myheading" style="position: relative; left: 5%;">Valancius, Vytautas and Kim, Hyojoon and Feamster, Nick</b>
     4291
     4292<div class="BibEntry">
     4293
     4294<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4295
     4296
     4297<tr>
     4298     <td valign="top">Author</td>
     4299     <td valign="top">Valancius, Vytautas and Kim, Hyojoon and Feamster, Nick</td>
     4300</tr>
     4301
     4302<tr>
     4303     <td valign="top">Title</td>
     4304     <td valign="top">Transit portal: BGP connectivity as a service</td>
     4305</tr>
     4306
     4307<tr>
     4308     <td valign="top">Journal</td>
     4309     <td valign="top">SIGCOMM Comput. Commun. Rev.</td>
     4310</tr>
     4311
     4312<tr>
     4313     <td valign="top">Publisher</td>
     4314     <td valign="top">ACM</td>
     4315</tr>
     4316
     4317<tr>
     4318     <td valign="top">Address</td>
     4319     <td valign="top">New York, NY, USA</td>
     4320</tr>
     4321
     4322<tr>
     4323     <td valign="top">Year</td>
     4324     <td valign="top">2010</td>
     4325</tr>
     4326
     4327<tr>
     4328     <td valign="top">Abstract</td>
     4329     <td valign="top">We demonstrate Transit Portal, a system that provides on-demand BGP Internet connectivity to multiple ISPs. Transit Portal provides connectivity to any virtual network or distributed service that needs to control its inbound and outbound route control. Examples of such services include virtual networks and distributed services in cloud computing environments (e.g., Amazon's EC2) that need to control inbound and outbound traffic.</td>
     4330</tr>
     4331
     4332
     4333
     4334<tr>
     4335     <td valign="top">DOI</td>
     4336     <td valign="top">10.1145/1851182.1851265</td>
     4337</tr>
     4338
     4339
     4340
     4341<tr>
     4342     <td valign="top">URL</td>
     4343     <td valign="top"><a href="http://dl.acm.org/citation.cfm?id=1851265">http://dl.acm.org/citation.cfm?id=1851265</a></td>
    42384344</tr>
    42394345
    … …  
    42454351
    42464352<a class="EntryGoto" id="Van Vorst, N. and Erazo, M. and Liu, J."></a>
    4247 <b class="myheading" style="position: relative; left: 10%;">Van Vorst, N. and Erazo, M. and Liu, J.</b>
    4248 
    4249 <div class="BibEntry">
    4250 
    4251 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4252 
    4253 
    4254 <tr>
    4255      <td>Author</td>
    4256      <td>Van Vorst, N. and Erazo, M. and Liu, J.</td>
    4257 </tr>
    4258 
    4259 <tr>
    4260      <td>Title</td>
    4261      <td>PrimoGENI for hybrid network simulation and emulation experiments in GENI</td>
    4262 </tr>
    4263 
    4264 <tr>
    4265      <td>Journal</td>
    4266      <td>Journal of Simulation</td>
    4267 </tr>
    4268 
    4269 <tr>
    4270      <td>Year</td>
    4271      <td>2012</td>
    4272 </tr>
    4273 
    4274 <tr>
    4275      <td>Abstract</td>
    4276      <td>The Global Environment for Network Innovations (GENI) is a community-driven research and development effort to build a collaborative and exploratory network experimentation platform—a 'virtual laboratory' for the design, implementation, and evaluation of future networks. The PrimoGENI project enables real-time network simulation by extending an existing network simulator to become part of the GENI federation to support large-scale experiments involving physical, simulated, and emulated network entities. In this paper, we describe a novel design of PrimoGENI, which aims at supporting realistic, scalable, and flexible network experiments with real-time simulation and emulation capabilities. We present a flexible emulation infrastructure that allows both remote client machines, local cluster nodes running virtual machines, and external networks to seamlessly interoperate with the simulated network running within a designated 'slice' of resources. We present the results of our preliminary validation and performance studies to demonstrate the capabilities as well as limitations of our approach.</td>
    4277 </tr>
    4278 
    4279 
    4280 
    4281 <tr>
    4282      <td>DOI</td>
    4283      <td>10.1057/jos.2012.5</td>
    4284 </tr>
    4285 
    4286 
    4287 
    4288 <tr>
    4289      <td>URL</td>
    4290      <td><a href="http://dx.doi.org/10.1057/jos.2012.5">http://dx.doi.org/10.1057/jos.2012.5</a></td>
     4353<b class="myheading" style="position: relative; left: 5%;">Van Vorst, N. and Erazo, M. and Liu, J.</b>
     4354
     4355<div class="BibEntry">
     4356
     4357<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4358
     4359
     4360<tr>
     4361     <td valign="top">Author</td>
     4362     <td valign="top">Van Vorst, N. and Erazo, M. and Liu, J.</td>
     4363</tr>
     4364
     4365<tr>
     4366     <td valign="top">Title</td>
     4367     <td valign="top">PrimoGENI for hybrid network simulation and emulation experiments in GENI</td>
     4368</tr>
     4369
     4370<tr>
     4371     <td valign="top">Journal</td>
     4372     <td valign="top">Journal of Simulation</td>
     4373</tr>
     4374
     4375<tr>
     4376     <td valign="top">Year</td>
     4377     <td valign="top">2012</td>
     4378</tr>
     4379
     4380<tr>
     4381     <td valign="top">Abstract</td>
     4382     <td valign="top">The Global Environment for Network Innovations (GENI) is a community-driven research and development effort to build a collaborative and exploratory network experimentation platform—a 'virtual laboratory' for the design, implementation, and evaluation of future networks. The PrimoGENI project enables real-time network simulation by extending an existing network simulator to become part of the GENI federation to support large-scale experiments involving physical, simulated, and emulated network entities. In this paper, we describe a novel design of PrimoGENI, which aims at supporting realistic, scalable, and flexible network experiments with real-time simulation and emulation capabilities. We present a flexible emulation infrastructure that allows both remote client machines, local cluster nodes running virtual machines, and external networks to seamlessly interoperate with the simulated network running within a designated 'slice' of resources. We present the results of our preliminary validation and performance studies to demonstrate the capabilities as well as limitations of our approach.</td>
     4383</tr>
     4384
     4385
     4386
     4387<tr>
     4388     <td valign="top">DOI</td>
     4389     <td valign="top">10.1057/jos.2012.5</td>
     4390</tr>
     4391
     4392
     4393
     4394<tr>
     4395     <td valign="top">URL</td>
     4396     <td valign="top"><a href="http://dx.doi.org/10.1057/jos.2012.5">http://dx.doi.org/10.1057/jos.2012.5</a></td>
    42914397</tr>
    42924398
    … …  
    42984404
    42994405<a class="EntryGoto" id="Van Vorst, N. and Li, Ting and Liu, J."></a>
    4300 <b class="myheading" style="position: relative; left: 10%;">Van Vorst, N. and Li, Ting and Liu, J.</b>
    4301 
    4302 <div class="BibEntry">
    4303 
    4304 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4305 
    4306 
    4307 <tr>
    4308      <td>Author</td>
    4309      <td>Van Vorst, N. and Li, Ting and Liu, J.</td>
    4310 </tr>
    4311 
    4312 <tr>
    4313      <td>Title</td>
    4314      <td>How Low Can You Go? Spherical Routing for Scalable Network Simulations</td>
    4315 </tr>
    4316 
    4317 <tr>
    4318      <td>Booktitle</td>
    4319      <td>Modeling, Analysis &#x0026; Simulation of Computer and Telecommunication Systems (MASCOTS), 2011 IEEE 19th International Symposium on</td>
    4320 </tr>
    4321 
    4322 <tr>
    4323      <td>Publisher</td>
    4324      <td>IEEE</td>
    4325 </tr>
    4326 
    4327 <tr>
    4328      <td>Year</td>
    4329      <td>2011</td>
    4330 </tr>
    4331 
    4332 <tr>
    4333      <td>Abstract</td>
    4334      <td>Memory consumption is a critical problem for large-scale network simulations. Particularly, the large memory footprint needed for maintaining routing tables can severely obturate scalability. We present an approach of composing large-scale network models using sharable model fragments to achieve significant reduction in the amount of memory required for storing forwarding tables in simulation. Our approach, called spherical routing, conducts static routing within spheres according to user-defined policies. Our routing scheme pre-calculates the forwarding table for each routing sphere, and allows spheres with identical sub-structures to share forwarding tables. Through extensive experiments we demonstrate that our approach can achieve several orders of magnitude in memory reduction for large-scale network models.</td>
    4335 </tr>
    4336 
    4337 
    4338 
    4339 <tr>
    4340      <td>DOI</td>
    4341      <td>10.1109/MASCOTS.2011.35</td>
    4342 </tr>
    4343 
    4344 
    4345 
    4346 <tr>
    4347      <td>URL</td>
    4348      <td><a href="http://dx.doi.org/10.1109/MASCOTS.2011.35">http://dx.doi.org/10.1109/MASCOTS.2011.35</a></td>
     4406<b class="myheading" style="position: relative; left: 5%;">Van Vorst, N. and Li, Ting and Liu, J.</b>
     4407
     4408<div class="BibEntry">
     4409
     4410<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4411
     4412
     4413<tr>
     4414     <td valign="top">Author</td>
     4415     <td valign="top">Van Vorst, N. and Li, Ting and Liu, J.</td>
     4416</tr>
     4417
     4418<tr>
     4419     <td valign="top">Title</td>
     4420     <td valign="top">How Low Can You Go? Spherical Routing for Scalable Network Simulations</td>
     4421</tr>
     4422
     4423<tr>
     4424     <td valign="top">Booktitle</td>
     4425     <td valign="top">Modeling, Analysis &#x0026; Simulation of Computer and Telecommunication Systems (MASCOTS), 2011 IEEE 19th International Symposium on</td>
     4426</tr>
     4427
     4428<tr>
     4429     <td valign="top">Publisher</td>
     4430     <td valign="top">IEEE</td>
     4431</tr>
     4432
     4433<tr>
     4434     <td valign="top">Year</td>
     4435     <td valign="top">2011</td>
     4436</tr>
     4437
     4438<tr>
     4439     <td valign="top">Abstract</td>
     4440     <td valign="top">Memory consumption is a critical problem for large-scale network simulations. Particularly, the large memory footprint needed for maintaining routing tables can severely obturate scalability. We present an approach of composing large-scale network models using sharable model fragments to achieve significant reduction in the amount of memory required for storing forwarding tables in simulation. Our approach, called spherical routing, conducts static routing within spheres according to user-defined policies. Our routing scheme pre-calculates the forwarding table for each routing sphere, and allows spheres with identical sub-structures to share forwarding tables. Through extensive experiments we demonstrate that our approach can achieve several orders of magnitude in memory reduction for large-scale network models.</td>
     4441</tr>
     4442
     4443
     4444
     4445<tr>
     4446     <td valign="top">DOI</td>
     4447     <td valign="top">10.1109/MASCOTS.2011.35</td>
     4448</tr>
     4449
     4450
     4451
     4452<tr>
     4453     <td valign="top">URL</td>
     4454     <td valign="top"><a href="http://dx.doi.org/10.1109/MASCOTS.2011.35">http://dx.doi.org/10.1109/MASCOTS.2011.35</a></td>
    43494455</tr>
    43504456
    … …  
    43564462
    43574463<a class="EntryGoto" id="Van Vorst, Nathanael and Erazo, Miguel and Liu, Jason"></a>
    4358 <b class="myheading" style="position: relative; left: 10%;">Van Vorst, Nathanael and Erazo, Miguel and Liu, Jason</b>
    4359 
    4360 <div class="BibEntry">
    4361 
    4362 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4363 
    4364 
    4365 <tr>
    4366      <td>Author</td>
    4367      <td>Van Vorst, Nathanael and Erazo, Miguel and Liu, Jason</td>
    4368 </tr>
    4369 
    4370 <tr>
    4371      <td>Title</td>
    4372      <td>PrimoGENI: Integrating Real-Time Network Simulation and Emulation in GENI</td>
    4373 </tr>
    4374 
    4375 <tr>
    4376      <td>Booktitle</td>
    4377      <td>2011 IEEE Workshop on Principles of Advanced and Distributed Simulation</td>
    4378 </tr>
    4379 
    4380 <tr>
    4381      <td>Location</td>
    4382      <td>Nice, France</td>
    4383 </tr>
    4384 
    4385 <tr>
    4386      <td>Publisher</td>
    4387      <td>IEEE</td>
    4388 </tr>
    4389 
    4390 <tr>
    4391      <td>Year</td>
    4392      <td>2011</td>
    4393 </tr>
    4394 
    4395 <tr>
    4396      <td>Abstract</td>
    4397      <td>The Global Environment for Network Innovations (GENI) is a community-driven research and development effort to build a collaborative and exploratory network experimentation platform -- a &#x76;&#x0308;irtual laboratory'' for the design, implementation and evaluation of future networks. The PrimoGENI project enables real-time network simulation by extending an existing network simulator to become part of the GENI federation to support large-scale experiments involving physical, simulated and emulated network entities. In this paper, we describe a novel design of PrimoGENI, which aims at supporting realistic, scalable, and flexible network experiments with real-time simulation and emulation capabilities. We present a flexible emulation infrastructure that allows both remote client machines and local cluster nodes running virtual machines to seamlessly interoperate with the simulated network running within a designated &#x73;&#x0308;lice'' of resources. We show the results of our preliminary validation and performance studies to demonstrate the capabilities and limitations of our approach.</td>
    4398 </tr>
    4399 
    4400 
    4401 
    4402 <tr>
    4403      <td>DOI</td>
    4404      <td>10.1109/PADS.2011.5936747</td>
    4405 </tr>
    4406 
    4407 
    4408 
    4409 <tr>
    4410      <td>URL</td>
    4411      <td><a href="http://dx.doi.org/10.1109/PADS.2011.5936747">http://dx.doi.org/10.1109/PADS.2011.5936747</a></td>
     4464<b class="myheading" style="position: relative; left: 5%;">Van Vorst, Nathanael and Erazo, Miguel and Liu, Jason</b>
     4465
     4466<div class="BibEntry">
     4467
     4468<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4469
     4470
     4471<tr>
     4472     <td valign="top">Author</td>
     4473     <td valign="top">Van Vorst, Nathanael and Erazo, Miguel and Liu, Jason</td>
     4474</tr>
     4475
     4476<tr>
     4477     <td valign="top">Title</td>
     4478     <td valign="top">PrimoGENI: Integrating Real-Time Network Simulation and Emulation in GENI</td>
     4479</tr>
     4480
     4481<tr>
     4482     <td valign="top">Booktitle</td>
     4483     <td valign="top">2011 IEEE Workshop on Principles of Advanced and Distributed Simulation</td>
     4484</tr>
     4485
     4486<tr>
     4487     <td valign="top">Location</td>
     4488     <td valign="top">Nice, France</td>
     4489</tr>
     4490
     4491<tr>
     4492     <td valign="top">Publisher</td>
     4493     <td valign="top">IEEE</td>
     4494</tr>
     4495
     4496<tr>
     4497     <td valign="top">Year</td>
     4498     <td valign="top">2011</td>
     4499</tr>
     4500
     4501<tr>
     4502     <td valign="top">Abstract</td>
     4503     <td valign="top">The Global Environment for Network Innovations (GENI) is a community-driven research and development effort to build a collaborative and exploratory network experimentation platform -- a &#x76;&#x0308;irtual laboratory'' for the design, implementation and evaluation of future networks. The PrimoGENI project enables real-time network simulation by extending an existing network simulator to become part of the GENI federation to support large-scale experiments involving physical, simulated and emulated network entities. In this paper, we describe a novel design of PrimoGENI, which aims at supporting realistic, scalable, and flexible network experiments with real-time simulation and emulation capabilities. We present a flexible emulation infrastructure that allows both remote client machines and local cluster nodes running virtual machines to seamlessly interoperate with the simulated network running within a designated &#x73;&#x0308;lice'' of resources. We show the results of our preliminary validation and performance studies to demonstrate the capabilities and limitations of our approach.</td>
     4504</tr>
     4505
     4506
     4507
     4508<tr>
     4509     <td valign="top">DOI</td>
     4510     <td valign="top">10.1109/PADS.2011.5936747</td>
     4511</tr>
     4512
     4513
     4514
     4515<tr>
     4516     <td valign="top">URL</td>
     4517     <td valign="top"><a href="http://dx.doi.org/10.1109/PADS.2011.5936747">http://dx.doi.org/10.1109/PADS.2011.5936747</a></td>
    44124518</tr>
    44134519
    … …  
    44194525
    44204526<a class="EntryGoto" id="Van Vorst, Nathanael and Liu, Jason"></a>
    4421 <b class="myheading" style="position: relative; left: 10%;">Van Vorst, Nathanael and Liu, Jason</b>
    4422 
    4423 <div class="BibEntry">
    4424 
    4425 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4426 
    4427 
    4428 <tr>
    4429      <td>Author</td>
    4430      <td>Van Vorst, Nathanael and Liu, Jason</td>
    4431 </tr>
    4432 
    4433 <tr>
    4434      <td>Title</td>
    4435      <td>Realizing Large-Scale Interactive Network Simulation via Model Splitting</td>
    4436 </tr>
    4437 
    4438 <tr>
    4439      <td>Booktitle</td>
    4440      <td>Proceedings of the 26th Workshop on Principles of Advanced and Distributed Simulation (PADS'12)</td>
    4441 </tr>
    4442 
    4443 <tr>
    4444      <td>Year</td>
    4445      <td>2012</td>
    4446 </tr>
    4447 
    4448 
    4449 
    4450 
    4451 
    4452 <tr>
    4453      <td>URL</td>
    4454      <td><a href="http://www.researchgate.net/publication/229476062&#x005F;Realizing&#x005F;Large-Scale&#x005F;Interactive&#x005F;Network&#x005F;Simulation&#x005F;via&#x005F;Model&#x005F;Splitting/file/d912f500eb6b911215.pdf">http://www.researchgate.net/publication/229476062&#x005F;Realizing&#x005F;Large-Scale&#x005F;Interactive&#x005F;Network&#x005F;Simulation&#x005F;via&#x005F;Model&#x005F;Splitting/file/d912f500eb6b911215.pdf</a></td>
    4455 </tr>
     4527<b class="myheading" style="position: relative; left: 5%;">Van Vorst, Nathanael and Liu, Jason</b>
     4528
     4529<div class="BibEntry">
     4530
     4531<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4532
     4533
     4534<tr>
     4535     <td valign="top">Author</td>
     4536     <td valign="top">Van Vorst, Nathanael and Liu, Jason</td>
     4537</tr>
     4538
     4539<tr>
     4540     <td valign="top">Title</td>
     4541     <td valign="top">Realizing Large-Scale Interactive Network Simulation via Model Splitting</td>
     4542</tr>
     4543
     4544<tr>
     4545     <td valign="top">Booktitle</td>
     4546     <td valign="top">Proceedings of the 26th Workshop on Principles of Advanced and Distributed Simulation (PADS'12)</td>
     4547</tr>
     4548
     4549<tr>
     4550     <td valign="top">Year</td>
     4551     <td valign="top">2012</td>
     4552</tr>
     4553
     4554
     4555
     4556
     4557
     4558<tr>
     4559     <td valign="top">URL</td>
     4560     <td valign="top"><a href="http://www.researchgate.net/publication/229476062&#x005F;Realizing&#x005F;Large-Scale&#x005F;Interactive&#x005F;Network&#x005F;Simulation&#x005F;via&#x005F;Model&#x005F;Splitting/file/d912f500eb6b911215.pdf">http://www.researchgate.net/publication/229476062&#x005F;Realizing&#x005F;Large-Scale&#x005F;Interactive&#x005F;Network&#x005F;Simulation&#x005F;via&#x005F;Model&#x005F;Splitting/file/d912f500eb6b911215.pdf</a></td>
     4561</tr>
     4562
     4563
     4564</table></div><br><br>
     4565
     4566
     4567
     4568
     4569<a class="EntryGoto" id="Vulimiri, Ashish and Michel, Oliver and Godfrey, P. Brighten and Shenker, Scott"></a>
     4570<b class="myheading" style="position: relative; left: 5%;">Vulimiri, Ashish and Michel, Oliver and Godfrey, P. Brighten and Shenker, Scott</b>
     4571
     4572<div class="BibEntry">
     4573
     4574<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4575
     4576
     4577<tr>
     4578     <td valign="top">Author</td>
     4579     <td valign="top">Vulimiri, Ashish and Michel, Oliver and Godfrey, P. Brighten and Shenker, Scott</td>
     4580</tr>
     4581
     4582<tr>
     4583     <td valign="top">Title</td>
     4584     <td valign="top">More is Less: Reducing Latency via Redundancy</td>
     4585</tr>
     4586
     4587<tr>
     4588     <td valign="top">Booktitle</td>
     4589     <td valign="top">Eleventh ACM Workshop on Hot Topics in Networks (HotNets-XI)</td>
     4590</tr>
     4591
     4592<tr>
     4593     <td valign="top">Year</td>
     4594     <td valign="top">2012</td>
     4595</tr>
     4596
     4597
     4598
     4599
    44564600
    44574601
    … …  
    44624606
    44634607<a class="EntryGoto" id="Wong, G. and Ricci, R. and Duerig, J. and Stoller, L. and Chikkulapelly, S. and Seok, Woojin"></a>
    4464 <b class="myheading" style="position: relative; left: 10%;">Wong, G. and Ricci, R. and Duerig, J. and Stoller, L. and Chikkulapelly, S. and Seok, Woojin</b>
    4465 
    4466 <div class="BibEntry">
    4467 
    4468 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4469 
    4470 
    4471 <tr>
    4472      <td>Author</td>
    4473      <td>Wong, G. and Ricci, R. and Duerig, J. and Stoller, L. and Chikkulapelly, S. and Seok, Woojin</td>
    4474 </tr>
    4475 
    4476 <tr>
    4477      <td>Title</td>
    4478      <td>Partitioning Trust in Network Testbeds</td>
    4479 </tr>
    4480 
    4481 <tr>
    4482      <td>Booktitle</td>
    4483      <td>System Science (HICSS), 2012 45th Hawaii International Conference on</td>
    4484 </tr>
    4485 
    4486 <tr>
    4487      <td>Publisher</td>
    4488      <td>IEEE</td>
    4489 </tr>
    4490 
    4491 <tr>
    4492      <td>Year</td>
    4493      <td>2012</td>
    4494 </tr>
    4495 
    4496 <tr>
    4497      <td>Abstract</td>
    4498      <td>Traditionally, test beds for networking and systems research have been designed as monolithic facilities: they contain a single root of trust. The resources in the facility are assumed to be administered by a single entity or a set of mutually-trusting entities. All user management, including vouching for users' identities and taking responsibility for their actions, is done using a flat trust structure or a simple hierarchy with the facility itself as the root. This design is not a good match for test beds that are composed of multiple autonomous facilities, or in which different parts of the test bed operate under different trust models. In this paper, we argue that partitioned trust is increasingly important in large scale and security-sensitive test beds. We present a design that accomplishes this partitioning by using multiple trust roots. The trust domains created by these roots may decide, independently, how much trust to place in each other, and can apply policies based on the domain or principal that originates a request. The domains could represent separately administered facilities (as in a federated test bed), or they could represent sections within a single facility that run with different trust models (for example, with differing levels of security.) We have implemented this design in ProtoGENI, a control framework for federated test beds, we include details of this implementation and share experiences from using it in an active deployment with hundreds of users.</td>
    4499 </tr>
    4500 
    4501 
    4502 
    4503 <tr>
    4504      <td>DOI</td>
    4505      <td>10.1109/HICSS.2012.466</td>
    4506 </tr>
    4507 
    4508 
    4509 
    4510 <tr>
    4511      <td>URL</td>
    4512      <td><a href="http://dx.doi.org/10.1109/HICSS.2012.466">http://dx.doi.org/10.1109/HICSS.2012.466</a></td>
     4608<b class="myheading" style="position: relative; left: 5%;">Wong, G. and Ricci, R. and Duerig, J. and Stoller, L. and Chikkulapelly, S. and Seok, Woojin</b>
     4609
     4610<div class="BibEntry">
     4611
     4612<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4613
     4614
     4615<tr>
     4616     <td valign="top">Author</td>
     4617     <td valign="top">Wong, G. and Ricci, R. and Duerig, J. and Stoller, L. and Chikkulapelly, S. and Seok, Woojin</td>
     4618</tr>
     4619
     4620<tr>
     4621     <td valign="top">Title</td>
     4622     <td valign="top">Partitioning Trust in Network Testbeds</td>
     4623</tr>
     4624
     4625<tr>
     4626     <td valign="top">Booktitle</td>
     4627     <td valign="top">System Science (HICSS), 2012 45th Hawaii International Conference on</td>
     4628</tr>
     4629
     4630<tr>
     4631     <td valign="top">Publisher</td>
     4632     <td valign="top">IEEE</td>
     4633</tr>
     4634
     4635<tr>
     4636     <td valign="top">Year</td>
     4637     <td valign="top">2012</td>
     4638</tr>
     4639
     4640<tr>
     4641     <td valign="top">Abstract</td>
     4642     <td valign="top">Traditionally, test beds for networking and systems research have been designed as monolithic facilities: they contain a single root of trust. The resources in the facility are assumed to be administered by a single entity or a set of mutually-trusting entities. All user management, including vouching for users' identities and taking responsibility for their actions, is done using a flat trust structure or a simple hierarchy with the facility itself as the root. This design is not a good match for test beds that are composed of multiple autonomous facilities, or in which different parts of the test bed operate under different trust models. In this paper, we argue that partitioned trust is increasingly important in large scale and security-sensitive test beds. We present a design that accomplishes this partitioning by using multiple trust roots. The trust domains created by these roots may decide, independently, how much trust to place in each other, and can apply policies based on the domain or principal that originates a request. The domains could represent separately administered facilities (as in a federated test bed), or they could represent sections within a single facility that run with different trust models (for example, with differing levels of security.) We have implemented this design in ProtoGENI, a control framework for federated test beds, we include details of this implementation and share experiences from using it in an active deployment with hundreds of users.</td>
     4643</tr>
     4644
     4645
     4646
     4647<tr>
     4648     <td valign="top">DOI</td>
     4649     <td valign="top">10.1109/HICSS.2012.466</td>
     4650</tr>
     4651
     4652
     4653
     4654<tr>
     4655     <td valign="top">URL</td>
     4656     <td valign="top"><a href="http://dx.doi.org/10.1109/HICSS.2012.466">http://dx.doi.org/10.1109/HICSS.2012.466</a></td>
    45134657</tr>
    45144658
    … …  
    45204664
    45214665<a class="EntryGoto" id="Yuen, Marco"></a>
    4522 <b class="myheading" style="position: relative; left: 10%;">Yuen, Marco</b>
    4523 
    4524 <div class="BibEntry">
    4525 
    4526 <table class="EntryTable" style="position: relative; left: 10%; width: 90%; border:thin solid black; border-spacing:10px;">
    4527 
    4528 
    4529 <tr>
    4530      <td>Author</td>
    4531      <td>Yuen, Marco</td>
    4532 </tr>
    4533 
    4534 <tr>
    4535      <td>Title</td>
    4536      <td>GENI in the Cloud</td>
    4537 </tr>
    4538 
    4539 <tr>
    4540      <td>Year</td>
    4541      <td>2010</td>
    4542 </tr>
    4543 
    4544 <tr>
    4545      <td>Abstract</td>
    4546      <td>Computer networking researchers often have access to a few di
     4666<b class="myheading" style="position: relative; left: 5%;">Yuen, Marco</b>
     4667
     4668<div class="BibEntry">
     4669
     4670<table class="EntryTable" style="position: relative; left: 5%; width: 90%; border:thin solid black; border-spacing:10px;">
     4671
     4672
     4673<tr>
     4674     <td valign="top">Author</td>
     4675     <td valign="top">Yuen, Marco</td>
     4676</tr>
     4677
     4678<tr>
     4679     <td valign="top">Title</td>
     4680     <td valign="top">GENI in the Cloud</td>
     4681</tr>
     4682
     4683<tr>
     4684     <td valign="top">Year</td>
     4685     <td valign="top">2010</td>
     4686</tr>
     4687
     4688<tr>
     4689     <td valign="top">Abstract</td>
     4690     <td valign="top">Computer networking researchers often have access to a few di
    45474691erent 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
    45484692erent 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
    … …  
    45584702
    45594703<tr>
    4560      <td>URL</td>
    4561      <td><a href="http://s3.amazonaws.com/marcoy&#x005F;thesis/Thesis.pdf">http://s3.amazonaws.com/marcoy&#x005F;thesis/Thesis.pdf</a></td>
     4704     <td valign="top">URL</td>
     4705     <td valign="top"><a href="http://s3.amazonaws.com/marcoy&#x005F;thesis/Thesis.pdf">http://s3.amazonaws.com/marcoy&#x005F;thesis/Thesis.pdf</a></td>
    45624706</tr>
    45634707
    … …  
    45714715
    45724716<!-- End HTML to be inserted into wiki page. -->
    4573 
    4574 
    45754717}}}