The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Failures are a permanent menace for the availability of Internet services. During the last decades, numerous fault-tolerant approaches have been proposed for the wide spectrum of Internet services, including stateful firewalls. Most of these solutions adopt reactive approaches to mask failures by replicating state-changes between replicas. However, reactive replication is a resource consuming task...
Massive Multiuser Virtual Environments (MMVEs) and especially the idea of a ''3D Web'' as a combination of a MMVE and today's WWW currently attracts a lot of attention. The realization of such a vision on a global scale though poses severe technical challenges to the underlying network infrastructure. It is generally accepted that such a global scale scenario can only be realized in a distributed...
We propose the design of Plug, an application to find and keep contacts with friends within many inter-connected 3D virtual worlds. Users use an instant messenger (IM)-like interface to converse with friends and find new contacts, using a virtual representation of the user's self. It consists of three parts: a plug is an automatous agent / avatar situated at a user's computer that reflects and mimics...
Peer-to-Peer systems have become a substantial element in computer networking. Distributing the load and splitting complex tasks are only some reasons why many developers have come to adopt this technology. However, all of them face a severe problem at the very beginning: setting up an overlay network, such that other clients can easily join it. With an empty peer cache common bootstrapping methods...
In data grid, co-allocation architecture can be used to enable parallel transferring of data file from multiple replicas which stored in the different grid sites. Some schemes base on co-allocation model were proposed and used to exploit the different transfer rates among various client-server network links and to adapt dynamic rate fluctuations by dividing data into fragment. These schemes showed...
It is common that Internet service hosting centres use several logical pools to assign server resources to different applications, and that they try to achieve the highest total revenue by making efficient use of these resources. In this paper, multi-tiered enterprise systems are modelled as multi-class closed queueing networks, with each network station corresponding to each application tier. In...
The following topics are dealt with: parallel algorithm; parallel architecture; distributed architecture; cluster computing; grid computing; Web and peer-to-peer system; mobile computing; ubiquitous computing; data security; dependability computing; trustworthy computing; RFID and sensor network; multicore computing; embedded systems education; network virtual environment and wireless network.
In distributed virtual environments, hosts typically have to react to events within a time span which is less than the network latency. As a consequence, hosts do routinely take actions although the system is in an inconsistent state. This has a noticeable influence on the perceived quality of these actions and their effect on the application. We argue that the level of this influence depends on the...
SIP (Session Initiation Protocol) is a signaling protocol widely used in multimedia communication. Recently, P2PSIP (Peer-to-Peer SIP), which combines DHT (distributed hash table) and SIP, has been proposed to overcome the drawbacks of traditional CS SIP (client/server architecture SIP). However, the introduction of DHT increases the registration overhead and, session setup overhead/latency. These...
A Distributed Java Virtual Machine (DJVM) is a cluster-wide set of extended JVMs that enables parallel execution of a multithreaded Java application. It has proven effectiveness for scaling scientific applications. However, leveraging DJVMs to cluster real-life web applications with commercial server workloads has not been well studied. This paper presents a new generic clustering approach based on...
Peer-to-peer file sharing applications are major proportion of traffic in Internet. Among P2P file sharing applications, BitTorrent is known to be the most popular system, in which peers can download pieces of file proportional with upload bandwidth shared with others. Therefore, for such a system, bandwidth adjustment is very significant for peers. In this paper we aim at modeling this as a solution...
Current Web servers are highly multithreaded applications whose scalability benefits from the current multi-core/multiprocessor trend. However, some workloads cannot capitalize on this because their performance is limited by the available memory and/or the disk bandwidth, which prevents the server from taking advantage of the computing resources provided by the system. To solve this situation we propose...
This paper presents a case for exploiting the synergy of dedicated and opportunistic network resources in a distributed hosting platform for data stream processing applications. Our previous studies have demonstrated the benefits of combining dedicated reliable resources with opportunistic resources in case of high-throughput computing applications, where timely allocation of the processing units...
DHT networks offer a scalable structure for use in massively multi-user virtual environments (MMVEs). However, an issue with DHT structures is their use of uniform location-independent ID assignment. This conflicts with the locality-sensitive non-uniform ID assignment needed to achieve efficient latency-aware routing in MMVE applications. Our proposed solution is to use a modified version of the Hilbert...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.