Catálogo de publicaciones - libros

Compartir en
redes sociales


Innovative Internet Community Systems: 5th International Workshop, IICS 2005, Paris, France, June 20-22, 2005. Revised Papers

Alain Bui ; Marc Bui ; Thomas Böhme ; Herwig Unger (eds.)

En conferencia: 5º International Workshop on Innovative Internet Community Systems (IICS) . Paris, France . June 20, 2005 - June 22, 2005

Resumen/Descripción – provisto por la editorial

No disponible.

Palabras clave – provistas por la editorial

Information Systems Applications (incl. Internet); Information Storage and Retrieval; User Interfaces and Human Computer Interaction; Computer Communication Networks; Computers and Society; IT in Business

Disponibilidad
Institución detectada Año de publicación Navegá Descargá Solicitá
No detectada 2006 SpringerLink

Información

Tipo de recurso:

libros

ISBN impreso

978-3-540-33973-1

ISBN electrónico

978-3-540-33974-8

Editor responsable

Springer Nature

País de edición

Reino Unido

Fecha de publicación

Información sobre derechos de publicación

© Springer-Verlag Berlin Heidelberg 2006

Tabla de contenidos

Innovation Processes Revisited by Internet

Serge Soudoplatoff

Internet, far from being a simple technology, is truly changing our way of life. Just as the invention of the alphabet, or the printing, Internet is a fundamental technology that we have designed, but which, in turn, is impacting our behavior, our relationship with the world and ourselves. By empowering ordinary citizens, it helps us to face a cognitive paradigm shift. This is deeply rooted in the design process of Internet, which has led a new way to perform innovation.

Pp. 1-16

Lightweight Causal Cluster Consistency

Anders Gidenstam; Boris Koldehofe; Marina Papatriantafilou; Philippas Tsigas

Within an effort for providing a layered architecture of services supporting multi-peer collaborative applications, this paper proposes a new type of consistency management aimed for applications where a large number of processes share a large set of replicated objects. Many such applications, like peer-to-peer collaborative environments for training or entertaining purposes, platforms for distributed monitoring and tuning of networks, rely on a fast propagation of updates on objects, however they also require a notion of consistent state update. To cope with these requirements and also ensure scalability, we propose the model. We also propose a two-layered architecture for providing cluster consistency. This is a general architecture that can be applied on top of the standard Internet communication layers and offers a modular, layered set of services to the applications that need them. Further, we present a implementing causal cluster consistency with predictable reliability, running on top of decentralised probabilistic protocols supporting group communication. Our experimental study, conducted by implementing and evaluating the two-layered architecture on top of standard Internet transport services, shows that the approach scales well, imposes an even load on the system, and provides high-probability reliability guarantees.

Pp. 17-28

Distributed Calculation of PageRank Using Strongly Connected Components

Michael Brinkmeier

We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated componentwise, as long as the rankings of pages directly linking to the current component are already known. Depending on the structure of the WWW, this approach approach may be used to calculate the ranking on several components in parallel, and allows to split the problem intio significantly small subproblems.

Pp. 29-40

A Structured Peer-to-Peer System with Integrated Index and Storage Load Balancing

Viet-Dung Le; Gilbert Babin; Peter Kropf

Load balancing emerges as an important problem that affects the performance of structured peer-to-peer systems. This paper presents a peer-to-peer system relying on the partitionning of a de Bruijn graph. The proposed system integrates mechanisms that perform index and storage load balancing. Index load refers to the network traffic incurred by a peer in managing an object index, while storage load refers to the storage space and network traffic required to store objects. The proposed mechanisms allow to effectively distribute both index load and storage load according to the peers’ capacities.

Pp. 41-52

Grid-Based Vehicle Locating System

Dhaval Shah; Dhawal Patel; Sanjay Chaudhary

Advances in Information Technology have led to development of various Automatic Vehicle Location (AVL) systems. The automotive industry quickly adopted this system as it provides location services for vehicles through wireless technologies. But these systems are not explicitly optimized to take advantage of grid computing. Grid computing offers the infrastructure for developing coordinated, scalable resource sharing in a dynamic environment to maximize the utilization of the available resources in the network. Resources can be microprocessors, storage media, files, bandwidth, sensors etc. The problems like dynamic nature of resources, single point of failures, scalability, real time delivery of vehicle location information are mostly ignored in the design of such systems. The data grid concept, which addresses the above issues, can be used to improve the performance of Automatic Vehicle Location systems. We propose the architectural model for the vehicle transport system to be operated in grid environment to address the above mentioned problems, discuss implementation related issues, and benefits of our proposed model.

Pp. 53-67

The Guadalajara Urban Traffic Control Project – An Overview About Features and Needs for Tomorrow’s Mobile City Communities

Helena Unger

The current contribution gives an overview on the different complex and concatenated aspects and problems of traffic control in large urban environments with a high population and traffic density. It intends to show that without innovative, Internet based technologies no suitable simulation, analysis and control of the urban traffic situation in a big city can be realized, especially under the conditions of third world countries.

Beside the introduction of a new, GRID based simulation it will be conceptually discussed, how existing infrastructural and other low cost concepts may be used to achieve significant improvements for every member of the local population community.

Pp. 68-78

Towards P2P Information Systems

Magnus Kolweyh; Ulrike Lechner

P2P systems draw large communities of users and create most of the Internet traffic. Two typical P2P myths are (1) that P2P is about sharing of audio and video content and (2) that P2P networks are only about sharing files between anonymous users. We present the results of an empirical study in the P2P network Direct Connect. We find that P2P networks are places to share all kind of data. We also find that there is a significant amount of communication going on in P2P networks.

Pp. 79-90

A Random Walk Topology Management Solution for Grid

Cyril Rabat; Alain Bui; Olivier Flauzac

GRID computing is a more and more attractive approach. Its aim is to gather and to share the resources of a network like the content, the storage or CPU cycles. A computational distributed system like produces a power up to 70 TFlops whereas the current best parallel supercomputer produces a power of 140 TFlops. Such a supercomputer costs very much contrary to a system like . But the use of many computers to increase the global computational power involves several communication problems. We must maintain the GRID communication in order to make any type of computation even though the network is volatile.

In this paper, we present a model to represent GRID applications and networks in order to show faults impacts. We present a fully distributed solution based on a random walk to manage the topology of the GRID. No virtual structure needs to be maintained and this solution works on asynchronous networks. We also present some simulations of our solution.

Pp. 91-104

Content-Oriented Self-organization in Unstructured P2P Data Sharing Systems. An Approach to Improve Resource Discovery

German Sakaryan; Herwig Unger

The flooding-based search is a major problem in unstructured peer-to-peer file sharing systems like Gnutella or KaZaa since it results in a significant portion of Internet traffic. This article intended to demonstrate that flooding can be avoided by using a content-oriented self-organization mechanism. In contrast to connections that are usually made randomly between peers in unstructured systems, each peer set up its connections based on content interests represented by offered and downloaded files. Through the simulation, it was shown that these local activities resulted in a global content-related network topology even under highly dynamic conditions. It was demonstrated that the content-oriented topology could be used to organize focused search in order to avoid flooding.

Pp. 105-116

Improving Reliability of Distributed Storage

Ricardo Marcelín-Jiménez

A storage scheme is a distributed system that coordinates a set of network-attached components. Using this type of solution it is possible to achieve balance in time and space over the involved components. Although this approach was developed to support efficient global states recording, many storage applications, like web hosting or distributed databases, might profit from it to provide highly available and reliable services. We explore the impact of space and information redundancy in order to improve the integrity requirements of files stored according to this management principles.

Pp. 117-125