<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>SMARTech Collection: MANIACS Publications</title>
    <link>http://smartech.gatech.edu/handle/1853/12188</link>
    <description>Papers, Pre/Post-Prints, and Presentations by Faculty and Students in the MANIACS program.</description>
    <textInput>
      <title>The Collection's search engine</title>
      <description>Search the Channel</description>
      <name>search</name>
      <link>http://smartech.gatech.edu/simple-search</link>
    </textInput>
    <item>
      <title>Towards a Topology Generator Modeling AS Relationships</title>
      <link>http://smartech.gatech.edu/handle/1853/13169</link>
      <description>Title: Towards a Topology Generator Modeling AS Relationships
&lt;br/&gt;
&lt;br/&gt;Authors: Dimitropoulos, Christos Xenofontas A.; Riley, George F.; Krioukov, Dmitri; Sundaram, Ravi
&lt;br/&gt;
&lt;br/&gt;Description: ©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.; Extended abstract presented at the IEEE International Conference on Network Protocols (ICNP), 2005</description>
      <pubDate>Fri, 29 Oct 2004 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>University Methodology for Internetworking Principles and Design Projects</title>
      <link>http://smartech.gatech.edu/handle/1853/13168</link>
      <description>Title: University Methodology for Internetworking Principles and Design Projects
&lt;br/&gt;
&lt;br/&gt;Authors: Abler, Randal Thomas; Owen, Henry L., III; Riley, George F.
&lt;br/&gt;
&lt;br/&gt;Abstract: An undergraduate engineering internetworking&#xD;
learning environment that presents both internetworking principles&#xD;
and laboratory experimentation is described. The learning&#xD;
environment uses the source code availability of the Linux operating&#xD;
system as a case study of the implementation issues and&#xD;
ramifications of internet networking infrastructures. Laboratory&#xD;
use of experimentation with internetworking equipment and&#xD;
software allows interaction with internetworking principles and&#xD;
fundamentals as well as implementation and performance issues.&#xD;
The objectives of this environment include providing a comprehensive&#xD;
mechanism whereby students are exposed to fundamentals&#xD;
and principles that may readily be applied to experimental-based&#xD;
internetwork research and internetwork product development. A follow-on capstone design environment is also briefly described.
&lt;br/&gt;
&lt;br/&gt;Description: ©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.</description>
      <pubDate>Mon, 28 Apr 2003 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Stateless Routing in Network Simulations</title>
      <link>http://smartech.gatech.edu/handle/1853/13167</link>
      <description>Title: Stateless Routing in Network Simulations
&lt;br/&gt;
&lt;br/&gt;Authors: Riley, George F.; Ammar, Mostafa H. (Mostafa Hamed); Fujimoto, Richard M.
&lt;br/&gt;
&lt;br/&gt;Abstract: The memory resources required by network simulations&#xD;
can grow quadratically with size of the simulated&#xD;
network. In simulations that use routing tables&#xD;
at each node to perform per-hop packet forwarding,&#xD;
the storage required for the routing tables is&#xD;
O(N2), where N is the number of simulated network&#xD;
nodes in the topology. Additionally, the CPU time&#xD;
required in the simulation environment to compute&#xD;
and populate these routing tables can be excessive and can dominate the overall simulation tame. We propose a new routing technique, known&#xD;
as Neighbor-Index Vectors, or NIx-Vectors, which&#xD;
eliminates both the storage required for the routing&#xD;
tables and the CPU time required to compute&#xD;
them. We show experimental results using NIx-&#xD;
Vector routing in the popular network simulator ns.&#xD;
With our technique, we achieve a near order of magnitude&#xD;
increase in the maximum size of a simulated&#xD;
network running ns on a single workstation. Further,&#xD;
we demonstate an increase of two orders of&#xD;
magnitude in topology size (networks as large as&#xD;
250,000 nodes) by using this technique and running&#xD;
the simulation in parallel on a network of workstations.
&lt;br/&gt;
&lt;br/&gt;Description: ©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.; Presented at the 8th International Symposium on  Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2000</description>
      <pubDate>Fri, 29 Oct 1999 22:58:59 GMT</pubDate>
    </item>
    <item>
      <title>Split Protocol Stack Network Simulations Using the Dynamic Simulation Backplane</title>
      <link>http://smartech.gatech.edu/handle/1853/13166</link>
      <description>Title: Split Protocol Stack Network Simulations Using the Dynamic Simulation Backplane
&lt;br/&gt;
&lt;br/&gt;Authors: Xu, Donghua; Riley, George F.; Ammar, Mostafa H. (Mostafa Hamed); Fujimoto, Richard M.
&lt;br/&gt;
&lt;br/&gt;Abstract: We introduce and discuss a methodology for heterogeneous&#xD;
simulations of computer networks using&#xD;
the dynamic simulation backplane. This methodology&#xD;
allows for exchanging of protocol information&#xD;
between simulators across layers of the protocol&#xD;
stack. For example, the simulationist may&#xD;
wish to construct a simulation using the rich set&#xD;
of TCP models found in the ns network simulator,&#xD;
and at the same time using the highly detailed wireless&#xD;
MAC models found in the GloMoSim simulator.&#xD;
The backplane provides an interface between heterogeneous&#xD;
simulators which allows these simulators to&#xD;
exchange meaningful information across layers of&#xD;
the protocol stack, without detailed knowledge of internal&#xD;
representation in the foreign simulator. With&#xD;
this method of heterogeneous simulation, new and&#xD;
experimental protocols can be validated and tested in&#xD;
conjunction with existing and accepted simulations of lower protocol layers. We discuss the particular problems presented by&#xD;
the split protocol stack model, and present our solutions.&#xD;
We give results of our implementation of the&#xD;
split protocol backplane, using the ns simulator for&#xD;
the higher protocol stack layers, and the GloMoSim simulator for the lower layers.
&lt;br/&gt;
&lt;br/&gt;Description: ©2001 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.; Presented at the Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2001</description>
      <pubDate>Sun, 29 Oct 2000 22:58:59 GMT</pubDate>
    </item>
  </channel>
</rss>

