Ensumeitor : analitzador gràfic del tràfic d'una xarxa informàtica en entorn GNU

El present Treball de Fi de Carrera es troba emmarcat dins de l'àrea de Xarxes de Computadors i consisteix, bàsicament, a fer una aplicació gràfica, en entorn GNU, que permeti analitzar el tràfic d'una xarxa informàtica. És el que s'anomena un Sniffer.

NetEye - Network Monitoring, Zabbix implementation

Trabajo de presentación en formato PowerPoint del TFC NetEye- Zabbix, network monitoring implementation.

Open Learning Network : the evidence of OER impact

Much of the initial work on Open Educational Resources (OER) has inevitably concentrated on how to produce the resources themselves and to establish the idea in the community. It is now eight years since the term OER was first used and more than ten years since the concept of open content was described and a greater focus is now emerging on the way in which OER can influence policy and change the way in which educational systems help people learn. The Open University UK and Carnegie Mellon University are working in partnership on the OLnet (Open Learning Network), funded by The William and Flora Hewlett Foundation with the aims to search out the evidence for use and reuse of OER and to establish a network for information sharing about research in the field. This means both gathering evidence and developing approaches for how to research and understand ways to learn in a more open world, particularly linked to OER, but also looking at other influences.

The Network Company in Catalonia : ICT, Productivity, Competitiveness, Salaries and Performance in Catalonia's Companies. Research report (synthesis document)

Resum en anglès del projecte de recerca L'empresa xarxa a Catalunya. TIC, productivitat, competitivitat, salaris i beneficis a l'empresa catalana té com a objectiu principal constatar que la consolidació d'un nou model estratègic, organitzatiu i d'activitat empresarial, vinculat amb la inversió i l'ús de les TIC (o empresa xarxa), modifica substancialment els patrons de comportament dels resultats empresarials, en especial la productivitat, la competitivitat, les retribucions dels treballadors i el benefici. La contrastació empírica de les hipòtesis de treball l'hem feta per mitjà de les dades d'una enquesta a una mostra representativa de 2.038 empreses catalanes. Amb la perspectiva de l'impacte de la inversió i l'ús de les TIC no s'aprecia una relació directa entre els processos d'innovació digital i els resultats de l'activitat de l'empresa catalana. En aquest sentit, hem hagut de segmentar el teixit productiu català per a buscar les organitzacions en què el procés de coinnovació tecnològica digital i organitzativa és més present i en què la intensitat de l'ús del coneixement és un recurs molt freqüent per a poder copsar impactes rellevants en els principals resultats empresarials. Això és així perquè l'economia catalana, avui, presenta una estructura productiva dual.

Schooling in the Network Society : Internet in Primary and Secondary Education. Research report (synthesis document)

Aquest projecte té la intenció d'identificar i analitzar els efectes de la introducció d'Internet a les escoles catalanes (educació primària i secundària). L'objectiu és posar de manifest la manera com s'utilitza la xarxa en aquest àmbit i en quina mesura contribueix a l'aparició, en els centres educatius, d'una nova cultura adaptada a les necessitats de la societat xarxa. Amb aquest propòsit, aquest projecte desplega les seves línies d'anàlisi per a fer atenció al procés d'incorporació d'Internet, principalment, en tres direccions: la pràctica pedagògica, les formes d'organització i gestió dels centres educatius i la seva vinculació amb la comunitat i el territori. Aquesta investigació ha estat desenvolupada pel grup de recerca ENS (Education and Network Society). Amb una perspectiva comparativa, el treball d'aquest grup vol contribuir, sobre la base de dades empíriques, a interpretar la transformació de l'àmbit educatiu no universitari en els paràmetres que estableix, avui dia, la nostra societat.

Internet and the Catalan Universities Network. Research report (synthesis document)

El desenvolupament de les tecnologies de la informació i la comunicació (TIC) durant els darrers quaranta anys del segle XX i la seva incorporació en els diferents àmbits de l'activitat humana ens porten a plantejar-nos, al començament del segle XXI, quines són les transformacions profundes que acompanyen aquests fets i quines són les conseqüències que, com a mínim a curt termini, comporten. El focus d'aquest projecte és l'anàlisi dels processos de transformació de la vida acadèmica universitària en l'àmbit català, la seva vinculació amb la realitat actual i les repercussions que els processos esmentats tenen en la societat en general. De manera més específica, l'objectiu és, en primer lloc, explorar amb una perspectiva global la incorporació d'Internet a les universitats catalanes i, en segon lloc, analitzar els processos de canvi que aquest fet comporta en els processos de formació i recerca de la Universitat Rovira i Virgili (URV). Aquest informe presenta els resultats de tres estudis concrets, cadascun dels quals té uns objectius, una metodologia i una discussió particulars: Configuració de la xarxa d'universitats catalanes: connexió física i projectes compartits, Presència de les universitats catalanes a Internet, i Estudi de cas: la URV.

Social network measures for "nosduocentered" networks, their predictive power on performance

Our purpose in this article is to define a network structure which is based on two egos instead of the egocentered (one ego) or the complete network (n egos). We describe the characteristics and properties for this kind of network which we call “nosduocentered network”, comparing it with complete and egocentered networks. The key point for this kind of network is that relations exist between the two main egos and all alters, but relations among others are not observed. After that, we use new social network measures adapted to the nosduocentered network, some of which are based on measures for complete networks such as degree, betweenness, closeness centrality or density, while some others are tailormade for nosduocentered networks. We specify three regression models to predict research performance of PhD students based on these social network measures for different networks such as advice, collaboration, emotional support and trust. Data used are from Slovenian PhD students and their s

Enhancing MPLS QoS routing algorithms by using the network protection degree paradigm

IP based networks still do not have the required degree of reliability required by new multimedia services, achieving such reliability will be crucial in the success or failure of the new Internet generation. Most of existing schemes for QoS routing do not take into consideration parameters concerning the quality of the protection, such as packet loss or restoration time. In this paper, we define a new paradigm to develop new protection strategies for building reliable MPLS networks, based on what we have called the network protection degree (NPD). This NPD consists of an a priori evaluation, the failure sensibility degree (FSD), which provides the failure probability and an a posteriori evaluation, the failure impact degree (FID), to determine the impact on the network in case of failure. Having mathematical formulated these components, we point out the most relevant components. Experimental results demonstrate the benefits of the utilization of the NPD, when used to enhance some current QoS routing algorithms to offer a certain degree of protection

Admission Control for TCP Flows Using Packet Classes and Edge-to-edge Measurements of Aggregates

TCP flows from applications such as the web or ftp are well supported by a Guaranteed Minimum Throughput Service (GMTS), which provides a minimum network throughput to the flow and, if possible, an extra throughput. We propose a scheme for a GMTS using Admission Control (AC) that is able to provide different minimum throughput to different users and that is suitable for "standard" TCP flows. Moreover, we consider a multidomain scenario where the scheme is used in one of the domains, and we propose some mechanisms for the interconnection with neighbor domains. The whole scheme uses a small set of packet classes in a core-stateless network where each class has a different discarding priority in queues assigned to it. The AC method involves only edge nodes and uses a special probing packet flow (marked as the highest discarding priority class) that is sent continuously from ingress to egress through a path. The available throughput in the path is obtained at the egress using measurements of flow aggregates, and then it is sent back to the ingress. At the ingress each flow is detected using an implicit way and then it is admission controlled. If it is accepted, it receives the GMTS and its packets are marked as the lowest discarding priority classes; otherwise, it receives a best-effort service. The scheme is evaluated through simulation in a simple "bottleneck" topology using different traffic loads consisting of "standard" TCP flows that carry files of varying sizes

Resource dimensioning aspect of heterogeneous traffic with different service requirements: Integration versus segregation

In this paper, we consider the ATM networks in which the virtual path concept is implemented. The question of how to multiplex two or more diverse traffic classes while providing different quality of service requirements is a very complicated open problem. Two distinct options are available: integration and segregation. In an integration approach all the traffic from different connections are multiplexed onto one VP. This implies that the most restrictive QOS requirements must be applied to all services. Therefore, link utilization will be decreased because unnecessarily stringent QOS is provided to all connections. With the segregation approach the problem can be much simplified if different types of traffic are separated by assigning a VP with dedicated resources (buffers and links). Therefore, resources may not be efficiently utilized because no sharing of bandwidth can take place across the VP. The probability that the bandwidth required by the accepted connections exceeds the capacity of the link is evaluated with the probability of congestion (PC). Since the PC can be expressed as the CLP, we shall simply carry out bandwidth allocation using the PC. We first focus on the influence of some parameters (CLP, bit rate and burstiness) on the capacity required by a VP supporting a single traffic class using the new convolution approach. Numerical results are presented both to compare the required capacity and to observe which conditions under each approach are preferred

QoS online routing and MPLS multilevel protection: a survey

A survey of MPLS protection methods and their utilization in combination with online routing methods is presented in this article. Usually, fault management methods pre-establish backup paths to recover traffic after a failure. In addition, MPLS allows the creation of different backup types, and hence MPLS is a suitable method to support traffic-engineered networks. In this article, an introduction of several label switch path backup types and their pros and cons are pointed out. The creation of an LSP involves a routing phase, which should include QoS aspects. In a similar way, to achieve a reliable network the LSP backups must also be routed by a QoS routing method. When LSP creation requests arrive one by one (a dynamic network scenario), online routing methods are applied. The relationship between MPLS fault management and QoS online routing methods is unavoidable, in particular during the creation of LSP backups. Both aspects are discussed in this article. Several ideas on how these actual technologies could be applied together are presented and compared

Automatic self-configuration of the logical network using distributed software agents

We present a system for dynamic network resource configuration in environments with bandwidth reservation. The proposed system is completely distributed and automates the mechanisms for adapting the logical network to the offered load. The system is able to manage dynamically a logical network such as a virtual path network in ATM or a label switched path network in MPLS or GMPLS. The system design and implementation is based on a multi-agent system (MAS) which make the decisions of when and how to change a logical path. Despite the lack of a centralised global network view, results show that MAS manages the network resources effectively, reducing the connection blocking probability and, therefore, achieving better utilisation of network resources. We also include details of its architecture and implementation

A new approach to real time traffic sign recognition based on colour information

The automatic interpretation of conventional traffic signs is very complex and time consuming. The paper concerns an automatic warning system for driving assistance. It does not interpret the standard traffic signs on the roadside; the proposal is to incorporate into the existing signs another type of traffic sign whose information will be more easily interpreted by a processor. The type of information to be added is profuse and therefore the most important object is the robustness of the system. The basic proposal of this new philosophy is that the co-pilot system for automatic warning and driving assistance can interpret with greater ease the information contained in the new sign, whilst the human driver only has to interpret the "classic" sign. One of the codings that has been tested with good results and which seems to us easy to implement is that which has a rectangular shape and 4 vertical bars of different colours. The size of these signs is equivalent to the size of the conventional signs (approximately 0.4 m2). The colour information from the sign can be easily interpreted by the proposed processor and the interpretation is much easier and quicker than the information shown by the pictographs of the classic signs

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

Availability analysis of GMPLS connections based on physical network topology

This paper presents a study of connection availability in GMPLS over optical transport networks (OTN) taking into account different network topologies. Two basic path protection schemes are considered and compared with the no protection case. The selected topologies are heterogeneous in geographic coverage, network diameter, link lengths, and average node degree. Connection availability is also computed considering the reliability data of physical components and a well-known network availability model. Results show several correspondences between suitable path protection algorithms and several network topology characteristics