Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Webhosting and Networking

Page 1. Webhosting and Networking G. Santhosh Kumar, Dept. of Computer Science Cochin University of Science and Technology Page 2. Agenda What is a Network? Elements of a Network Hardware Software Ethernet Technology World Wide Web Setting up a Network Conclusion Page 3. What is a Network? An interconnected system of things or people Purpose of a Network? Resource Sharing Communication LANs have become the most popular form of Computer Networks Page 4. Principle of Locality of Reference Temporal Locality of Reference ...

Anàlisi, disseny i implementació de la nova web del trampolí tecnològic de la UdG

Creació d’un portal web amb informació sobre el Trampolí Tecnològic de la UdG (activitats, ofertes, etc.), i disseny d'una intranet que permeti al trampolí gestionar les diferents funcions que s'hi duen a terme (gestió dels diferents gestors de projectes, projectes que es tutelen, emprenedors i inversors que intervenen, ajudes que es poden rebre, etc.)

Aplicació web per la gestió de l'Escola Universitària d'Hostalaria i Turisme de Sant Pol de Mar

Disseny i creació d'una nova pàgina web per a l'Escola Universitària d'Hostalaria i Turisme de Sant Pol de Mar

Intranet corporativa de Miquel Alimentació Grup, S.A.

Miquel Alimentació es una empresa líder en distribución de artículos de consumo en España. El objetivo principal del proyecto es concebir un punto de trabajo común de acceso centralizado para ubicar toda la información, aplicaciones de empresa y servicios tanto dentro como fuera de ella. Contener herramientas para la gestión, análisis y enlace de datos que permitirá la colaboración de varios usuarios

Entorn de simulació per a xarxes òptiques de transport

Aquest projecte final de carrera pretén investigar i experimentar una nova línia de desenvolupament d’algorismes dinàmics. A partir de l’algorisme AntNet-QoS [2] s’ incorporen noves mesures a l’algorisme (mesura de l’amplada de banda disponible i jitter), les quals combinant amb la mesura de retard ja feta servir, permet adaptar-se millor a les condicions actuals del trànsit en la xarxa i als requeriments específics de qualitat (QoS) per part del trànsit

Disseny i implementació d’una “Storage Area Network”

El següent projecte consisteix en analitzar com funciona un sistema SAN, per tal de veure com es pot obtenir un millor rendiment. L’objectiu principal es saber com es comportarà la nostra SAN muntada amb iSCSI a través de la xarxa, volem veure quines són les operacions, les dades i els resultats que comporta crear una RAID a través de discos no locals d’un ordinador i a través d’una xarxa LAN

Utilització de proves d'autoavaluació en una intranet docent

En aquest treball s’analitza quin ha estat l’ús de les proves d’autoavaluació accessibles a la plataforma docent de la Universitat de Girona per part d’un total de quatre-cents setanta estudiants matriculats en tres assignatures dels estudis d’Enginyeria Tècnica Agrícola, especialitats Indústries Agràries i Alimentàries i Explotacions Agropecuàries, de l’Escola Politècnica Superior al llarg dels darrers cinc cursos acadèmics. Les proves d’autoavaluació plantejades eren del tipus resposta tancada i la seva resposta era voluntària ja que la realització de les proves no intervenia en el còmput de la qualificació final de l’assignatura. De tota manera, en les activitats d’avaluació de les diferents assignatures, que consistien fonamentalment en exàmens parcials i finals, hi havia una part de qüestions amb un format similar al de les preguntes disponibles en la plataforma docent. S’ha observat que els alumnes que responien les proves d’autoavaluació es presentaven més als exàmens i aprovaven més les assignatures que els que no accedien a la intranet docent per a respondre les qüestions disponibles. Malgrat això, hi ha un nombre important d’alumnes que no realitzaven aquestes proves, probablement perquè no puntuaven per a la qualificació final de les assignatures

Creando valor a través de las TIC: nuevos intermediarios

Este trabajo analiza cómo se puede crear valor a través del uso de las TIC. Para ello se utiliza el Modelo de creación de valor en e-business desarrollado por Amit y Zott (2001) y se aplica a una tipología de nuevos intermediarios que opera en el sector de los contenidos digitales: gregadores de noticias. Para lograr este objetivo, se ha realizado un estudio exploratorio y un estudio de casos a través de entrevistas personales con informadores estratégicos y un análisis del contenido de las páginas web de 56 empresas relacionadas con el sector y cuestionarios, principalmente Se han analizado empresas de EEUU, Canadá, España, Francia, Alemania, Reino Unido y Suiza

Multicast extension of unicast charging for QoS Services

In order to successfully deploy multicast services in QoS-aware networks, pricing architectures must take into account the particular characteristics of multicast sessions. With this objective, we propose a charging scheme for QoS multicast services, assuming that the unicast cost of each interconnecting link is determined and that such cost is expressed in terms of quality of service (QoS) parameters. Our scheme allows determining the cost distribution of a multicast session along a cost distribution tree (CDT), and basing such distribution in those pre-existing unicast cost functions. The paper discusses in detail the main characteristics of the problem in a realistic interdomain scenario and how the proposed scheme would contribute to its solution

On the use of QoS requirements as base of multicast charging

We propose a charging scheme for cost distribution along a multicast tree when cost is the responsibility of the receivers. This scheme focuses on QoS considerations and it does not depend on any specific type of service. The scheme has been designed to be used as a bridge between unicast and multicast services, solving the problem of charging multicast services by means of unicast charging and existing QoS routing mechanisms. We also include a numerical comparison and discussions of the case of non-numerical or relative QoS and on the application to some service examples in order to give a better understanding of the proposal

Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

Adding QoS protection in order to enhance MPLS QoS routing

In this paper, a method for enhancing current QoS routing methods by means of QoS protection is presented. In an MPLS network, the segments (links) to be protected are predefined and an LSP request involves, apart from establishing a working path, creating a specific type of backup path (local, reverse or global). Different QoS parameters, such as network load balancing, resource optimization and minimization of LSP request rejection should be considered. QoS protection is defined as a function of QoS parameters, such as packet loss, restoration time, and resource optimization. A framework to add QoS protection to many of the current QoS routing algorithms is introduced. A backup decision module to select the most suitable protection method is formulated and different case studies are analyzed

An ATM distributed simulator for network management research

Due to the high cost of a large ATM network working up to full strength to apply our ideas about network management, i.e., dynamic virtual path (VP) management and fault restoration, we developed a distributed simulation platform for performing our experiments. This platform also had to be capable of other sorts of tests, such as connection admission control (CAC) algorithms, routing algorithms, and accounting and charging methods. The platform was posed as a very simple, event-oriented and scalable simulation. The main goal was the simulation of a working ATM backbone network with a potentially large number of nodes (hundreds). As research into control algorithms and low-level, or rather cell-level methods, was beyond the scope of this study, the simulation took place at a connection level, i.e., there was no real traffic of cells. The simulated network behaved like a real network accepting and rejecting SNMP ones, or experimental tools using the API node

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 3: Network Theory and Terminology

In this class, we will discuss network theory fundamentals, including concepts such as diameter, distance, clustering coefficient and others. We will also discuss different types of networks, such as scale-free networks, random networks etc. Readings: Graph structure in the Web, A. Broder and R. Kumar and F. Maghoul and P. Raghavan and S. Rajagopalan and R. Stata and A. Tomkins and J. Wiener Computer Networks 33 309--320 (2000) [Web link, Alternative Link] Optional: The Structure and Function of Complex Networks, M.E.J. Newman, SIAM Review 45 167--256 (2003) [Web link] Original course at: http://kmi.tugraz.at/staff/markus/courses/SS2008/707.000_web-science/