Captura i filtrat de paquets a xarxesEthernet

Aquest treball se centra en les tècniques de captura i filtratge de paquets a xarxes Ethernet. Com objectiu principal ens hem fixat l¿estudi de les estructures implementades pel sistema operatiu i la interfície oferta als programadors per tal de poder utilitzar-la. Com a objectiu secundari pretenem, posar a la practica els coneixements obtinguts i desenvolupar un producte sòlid i robust en la seva funcionalitat bàsica, filtrar i capturar paquets, però que sigui extensible a altres aplicacions orientades a xarxa. Anàlisis de rendiment de la xarxa, per exemple.

Resource management research in Passive Optical Networks (PON)

Next Generation Access Networks (NGAN) are the new step forward to deliver broadband services and to facilitate the integration of different technologies. It is plausible to assume that, from a technological standpoint, the Future Internet will be composed of long-range high-speed optical networks; a number of wireless networks at the edge; and, in between, several access technologies, among which, the Passive Optical Networks (xPON) are very likely to succeed, due to their simplicity, low-cost, and increased bandwidth. Among the different PON technologies, the Ethernet-PON (EPON) is the most promising alternative to satisfy operator and user needs, due to its cost, flexibility and interoperability with other technologies. One of the most interesting challenges in such technologies relates to the scheduling and allocation of resources in the upstream (shared) channel. The aim of this research project is to study and evaluate current contributions and propose new efficient solutions to address the resource allocation issues in Next Generation EPON (NG-EPON). Key issues in this context are future end-user needs, integrated quality of service (QoS) support and optimized service provisioning for real time and elastic flows. This project will unveil research opportunities, issue recommendations and propose novel mechanisms associated with the convergence within heterogeneous access networks and will thus serve as a basis for long-term research projects in this direction. The project has served as a platform for the generation of new concepts and solutions that were published in national and international conferences, scientific journals and also in book chapter. We expect some more research publications in addition to the ones mentioned to be generated in a few months.

Improving Label Space Usage for Ethernet Label Switched Paths

Ethernet is becoming the dominant aggregation technology for carrier transport networks; however, as it is a LAN technology, native bridged ethernet does not fulfill all the carrier requirements. One of the schemes proposed by the research community to make ethernet fulfill carrier requirements is ethernet VLAN-label switching (ELS). ELS allows the creation of label switched data paths using a 12-bit label encoded in the VLAN TAG control information field. Previous label switching technologies such as MPLS use more bits for encoding the label. Hence, they do not suffer from label sparsity issues as ELS might. This paper studies the sparsity issues resulting from the reduced ELS VLAN-label space and proposes the use of the label merging technique to improve label space usage. Experimental results show that label merging considerably improves label space usage

Forming efficient networks

In this paper, we suggest a simple sequential mechanism whose subgame perfect equilibria give rise to efficient networks. Moreover, the payoffs received by the agents coincide with their Shapley value in an appropriately defined cooperative game.

Knowledge, networks of cities and growth in regional urban systems

The objective of this paper is to measure the impact of different kinds of knowledge and external economies on urban growth in an intraregional context. The main hypothesis is that knowledge leads to growth, and that this knowledge is related to the existence of agglomeration and network externalities in cities. We develop a three-tage methodology: first, we measure the amount and growth of knowledge in cities using the OCDE (2003) classification and employment data; second, we identify the spatial structure of the area of analysis (networks of cities); third, we combine the Glaeser - Henderson - De Lucio models with spatial econometric specifications in order to contrast the existence of spatially static (agglomeration) and spatially dynamic (network) external economies in an urban growth model. Results suggest that higher growth rates are associated to higher levels of technology and knowledge. The growth of the different kinds of knowledge is related to local and spatial factors (agglomeration and network externalities) and each knowledge intensity shows a particular response to these factors. These results have implications for policy design, since we can forecast and intervene on local knowledge development paths.

Cooperative Transmission and Radio Resources Management for Wireless Networks

Report for the scientific sojourn at the Multimedia Communications Laboratory, University of Texas at Dallas, USA, from September to December 2005. The cooperative transmission has been analyzed taking a broadcast relay channel which assumes a scenario with one source and multiple destinations. Moreover, in order to improve the performance in terms of mutual information, it has been considered that for each destination there is another nearby terminal (called relay) which will help to improve the performance of the destination. This scheme combines different types of channels considered in the information theory, such as the relay channel, broadcast channel and interference channel (if the relays transmit information intended only to its associated destination). In this work, the author has studied the optimal way to encode the signals for the different users, known as capacity region (i.e. related to radio resources management ), of the broadcast relay channel.

The Evolution of roommate networks: a comment on Jackson and Watts JET (2002)

We extend Jackson and Watts's (2002) result on the coincidence of S-stochastically stable and core stable networks from marriage problems to roommate problems. In particular, we show that the existence of a side-optimal core stable network, on which the proof of Jackson and Watts (2002) hinges, is not crucial for their result.

The Difficult and tortuous path of agricultural cooperative networks in spain, 1890-1935

The rural associationism developed from the last decades of the XIX century could be consider as an answer of the agriculturists to the increasing integration of agriculture in the market, and to the effects of the Great Depression. In the case of Spain, the initiatives in this sense arose with certain delay in relation to the countries of Western Europe. The beginning of the Spanish cooperativism is closely bound to the Law of 1906. It granted the agrarian cooperatives with fiscal exemptions and other types of supports to the associates, although the process did not really accelerate until the promulgation of the law regulation in 1908.

Information networks and worker recruitment

This paper studies experimentally how the existence of social information networks affects the ways in which firms recruit new personnel. Through such networks firms learn about prospective employees' performance in previous jobs. Assuming individualistic preferences social networks are predicted not to affect overall labor market behavior, while with social preferences the prediction is that when bilaterally negotiated: (i) wages will be higher and (ii) that workers in jobs with incomplete contracts will respond with higher effort. Our experimental results are consistent with the social preferences view, both for the case of excess demand and excess supply of labor. In particular, the presence of information networks leads to more efficient allocations.

Preliminary study of cooperation in hybrid ad-hoc networks

In this paper, we present a first approach to evolve a cooperative behavior in ad hoc networks. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios are unfavorable to the interests of a user. In this paper we deal with the issue of user cooperation in ad hoc networks by developing the algorithm called Generous Tit-For-Tat. We assume that nodes are rational, i.e., their actions are strictly determined by self-interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we study the added behavior of the network.

Wealth constraints, skill prices or networks: what determines emigrant selection?

The productive characteristics of migrating individuals, emigrant selection, affect welfare. The empirical estimation of the degree of selection suffers from a lack of complete and nationally representative data. This paper uses a new and better dataset to address both issues: the ENET (Mexican Labor Survey), which identifies emigrants right before they leave and allows a direct comparison to non-migrants. This dataset presents a relevant dichotomy: it shows on average negative selection for Mexican emigrants to the United States for the period 2000-2004 together with positive selection in Mexican emigration out of rural Mexico to the United States in the same period. Three theories that could explain this dichotomy are tested. Whereas higher skill prices in Mexico than in the US are enough to explain negative selection in urban Mexico, its combination with network effects and wealth constraints is required to account for positive selection in rural Mexico.

QoS support in satellite and wireless networks: study under the network simulator (NS-2)

Aquest projecte es basa en l'estudi de l'oferiment de qualitat de servei en xarxes wireless i satel·litals. Per això l'estudi de les tècniques de cross-layer i del IEEE 802.11e ha sigut el punt clau per al desenvolupament teòric d’aquest estudi. Usant el simulador de xarxes network simulator, a la part de simulacions es plantegen tres situacions: l'estudi de la xarxa satel·lital, l'estudi del mètode d'accés HCCA i la interconnexió de la xarxa satel·lital amb la wireless. Encara que aquest últim punt, incomplet en aquest projecte, ha de ser la continuació per a futures investigacions.

Relay-assisted transmission and radio resource management for wireless networks

The following paper presents an overview of the Ph.D Thesis1 presented in [1], which compiles all the research done during the period of time between 2004-2007. In that dissertation the relay-assisted transmission with half-duplex relays is analyzed from different points of view. This study is motivated by the necessity of finding innovative solutions to cope with the requirements of next generation wireless services, and with current radio technology. The use of relayed communications represents a change of paradigm of conventional communications, and requires the definition and evaluation of protocols to be applied to single or multiple-user relay communication. With the two fold goal of enhancing spectral efficiency and homogenize service in cellular communications, system design is investigated at physical (type of transmissions of the relay, decoding mode, ..) and upper layers (resource allocation, dynamic link control).

Label Space Reduction in All-Optical Label Switchiing Networks

Report for the scientific sojourn at the Department of Information Technology (INTEC) at the Ghent University, Belgium, from january to june 2007. All-Optical Label Swapping (AOLS) forms a key technology towards the implementation of All-Optical Packet Switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the wayin which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This project studies and proposes All-Optical Label Stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this project, an Integer Lineal Program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more.