<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://hdl.handle.net/2117/5508">
    <title>DSpace Collection:</title>
    <link>http://hdl.handle.net/2117/5508</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://hdl.handle.net/2117/14819" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/12651" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/11632" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/10201" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/10076" />
        <rdf:li rdf:resource="http://hdl.handle.net/2117/7971" />
      </rdf:Seq>
    </items>
    <dc:date>2013-06-19T07:09:01Z</dc:date>
  </channel>
  <item rdf:about="http://hdl.handle.net/2117/14819">
    <title>Middleware for positioning in cellular networks</title>
    <link>http://hdl.handle.net/2117/14819</link>
    <description>Title: Middleware for positioning in cellular networks
Authors: Martín Escalona, Israel; Barceló Arroyo, Francisco; Ciurana Adell, Marc</description>
    <dc:date>2012-01-25T19:30:34Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/12651">
    <title>Problems in dynamic bandwidth allocation in connection oriented networks</title>
    <link>http://hdl.handle.net/2117/12651</link>
    <description>Title: Problems in dynamic bandwidth allocation in connection oriented networks
Authors: Hesselbach Serra, Xavier</description>
    <dc:date>2011-05-25T14:58:36Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/11632">
    <title>Chapter 4: Mobility Support</title>
    <link>http://hdl.handle.net/2117/11632</link>
    <description>Title: Chapter 4: Mobility Support
Authors: Barceló Arroyo, Francisco; Aguayo-Torres, M.C.; Al Begain, K.; Martín Escalona, Israel; Vassilou, V.
Abstract: Wireless access allows independency between the user’s position and the physical bearer used to access services from the network. However, this independency does not imply that wireless networks show a full ability to cope with any degree of mobility. This is because other constraints can limit the mobility when accessing the network. The main constraints are registration and addressing (e.g., of user, terminal, application) and handover. In general, procedures needed to cope with those issues have a cost in terms of quality degradation, need for more resources, or both; this is known as mobility cost. Performance evaluation of mobility related issues in wireless networks requires a precise knowledge and understanding of the way in which terminals move, the impact of the movement on performance and quality, and the procedures and resources allocated in the network to minimize the impact of the mobility.</description>
    <dc:date>2011-03-02T19:27:29Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/10201">
    <title>Discrete event simulation of wireless cellular networks</title>
    <link>http://hdl.handle.net/2117/10201</link>
    <description>Title: Discrete event simulation of wireless cellular networks
Authors: Zola, Enrica Valeria; Martín Escalona, Israel; Barceló Arroyo, Francisco</description>
    <dc:date>2010-11-09T12:38:30Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/10076">
    <title>Genetic algorithms for designing network security protocols</title>
    <link>http://hdl.handle.net/2117/10076</link>
    <description>Title: Genetic algorithms for designing network security protocols
Authors: Zarza, Luis; Forné Muñoz, Jorge; Pegueroles Vallés, Josep R.; Soriano Ibáñez, Miguel
Abstract: The design of cryptographic and security protocols for new scenarios and&#xD;
applications can be computationally expensive. Examples of these can&#xD;
be sensor or mobile ad-hoc networks where thousands of nodes can be&#xD;
involved. In such cases, the aid of an automated tool generating protocols&#xD;
for a predefined problem can be of great utility. This work uses&#xD;
the genetic algorithms (GA) techniques for the automatic design of security&#xD;
networked protocols. When using GA for optimizing protocols two&#xD;
aspects are critical: the genome definition and the evaluation function.&#xD;
We discuss how security protocols can be represented as binary strings&#xD;
and can be interpreted as security protocols; moreover we define several&#xD;
basic criteria for evaluating security protocols. Finally, we present the&#xD;
software we developed for generating secure communications protocols&#xD;
and show some examples and obtained results.</description>
    <dc:date>2010-11-02T13:07:28Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/2117/7971">
    <title>Next Generation Optical Access Networks: from TDM to WDM</title>
    <link>http://hdl.handle.net/2117/7971</link>
    <description>Title: Next Generation Optical Access Networks: from TDM to WDM
Authors: Gutiérrez González, Lluís; Garfias Hernandez, Paola; Andrade Jardín, Marilet de; Cervelló Pastor, Cristina; Sallent Ribes, Sebastián</description>
    <dc:date>2010-07-02T09:34:04Z</dc:date>
  </item>
</rdf:RDF>

