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.
Checkpointing and message logging are few of the popular and general-purpose methods for providing fault tolerance in distributed systems. Several variations of their basic schemes have been reported in the literature. Majority of the coordinated checkpointing algorithms have not addressed about the treatment of lost messages. And also the schemes that consider the improvement of several or all performance...
In this paper, we embed an incentive-compatible, efficient, and individual rational payment scheme into our cost- and stability-based routing protocol in ad hoc networks which consist of selfish nodes. Unlike traditional routing protocols in ad hoc networks, which only elicit cost information from selfish nodes, our protocol motivates selfish nodes to report truthfully both their stability and cost...
Multimedia contents are distributed to peers in various ways like downloading in peer-to-peer (P2P) overlay networks. A peer which holds a content, even a part of a content can provide other peers with the content. Multimedia streaming is more significant in multimedia applications than downloading way. We discuss how to support the multimedia streaming service by using multiple contents peers. In...
We derive a sequential algorithm Find-Ham-Cycle with the following property. On input: k and n (specifying the k-ary n-cube Qnk); F, a set of at most 2n - 2 faulty links; and v, a node of Qnk, the algorithm outputs nodes v+ and v- such that if Find-Ham-Cycle is executed once for every node v of Qnk then the node v+ (resp. v -) denotes the successor (resp. predecessor) node of v on a fixed Hamiltonian...
In grid, cooperation often occurs between unknown entities. To guarantee smooth and reliable ongoing of such cooperation, reliable trust relationship must be established between them. With wide application in electronic commerce and online communities, reputation mechanism emerges as a promising solution, where a scientific reputation evaluation method is crucial. Yet, most methods currently available...
Symmetric multiprocessors (SMPs), combined with modern interconnection technologies are commonly used to build cost-effective compute clusters. However, contention among processors for access to shared resources, as is the main memory bus and the NIC can limit their efficiency significantly. In this paper, we first provide an experimental demonstration of the effect of resource contention on the total...
This paper proposes a compiler-time scheduling algorithm, called the dynamic critical path duplication (DCPD) scheduling algorithm, to exploit all of a program's available parallelism in distributed heterogeneous computing systems. This algorithm could exploit the potential of parallel processing, allowing for system heterogeneities and network bandwidth. It is compared favorably with other related...
Heterogeneous parallel and distributed computing systems may operate in an environment where certain system performance features degrade due to unpredictable circumstances. Robustness can be defined as the degree to which a system can function correctly in the presence of parameter values different from those assumed. This paper presents a mathematical model for quantifying robustness in a dynamic...
Message passing interface (MPI) is an important standard that allows message-passing applications to run on many heterogeneous message-passing distributed systems without any change. There are a tremendous number of MPI implementations that are, however, mainly dedicated for traditional distributed systems. Most of these implementations consume a significant amount of resources. In addition to the...
Performance evaluation and modeling is a crucial process to enable the optimization of parallel programs. Programs written using two programming models, such as MPI and OpenMP, require an analysis to determine both performance efficiency and the most suitable numbers of processes and threads for their execution on a given platform. To study both of these problems, we propose the construction of a...
In this paper, we study the effect of adaptivity of routing algorithm on the overall performance in a hypercube multicomputer using wormhole switching. To this end, we use three accurate analytical models proposed for deterministic, fully-adaptive, and partially-adaptive routing algorithms in hypercube. Surprisingly, our analysis shows that under uniform traffic load, the partially-adaptive routing...
Several IP traceback schemes employing packet marking have been proposed to trace DoS/DDoS attacks that use source address spoofing. The major challenges in the design of an efficient traceback technique are to minimize the number of packets required for successful traceback, and also to reduce the number of bits marked per packet by any router along the attack path. We propose a graph-coloring approach...
Peer-to-peer (P2P) systems are characterized by direct access between peer computers, rather than through a centralized server. File sharing is the dominant P2P application on the Internet, allowing users to easily contribute, search and obtain content. P2P systems can be categorized by the degrees of centralization. For fully centralized systems, the lookup service will not be available when the...
In an open shortest path first (OSPF) based best effort network, the OSPF shortest path can become the bottleneck when congestion occurs. OSPF cannot forward packets though less congested alternate paths. Hence, OSPF cannot be used to provide quality of service. Earlier, we reported a load sensitive routing (LSR) algorithm which finds alternate path based on OSPF property. In the earlier work, the...
Run time variability of parallel application codes continues to be a significant challenge in clusters. We are studying run time variability at the communication level from the perspective of the application, focusing on the network. To gain insight into this problem our earlier work developed a tool to emulate parallel applications and in particular their communication. This framework, called parallel...
A decentralized game theoretic framework applied to Web caching is discussed. The interaction of multiple clients with a caching server is modeled as a non-cooperative game, in which clients are viewed as players, and the caching server disk space as a resource for which players are competing. However, some clients may continuously request new objects, thus, occupying a considerable portion of the...
A grid allows dynamic integration of disparate resources. A number of grid platforms like CONDOR, Net-Solve, ISS Cornell are available to harness computing power. However, for grid to be pervasive and usable by a novice user, integration at application level is required. We have designed and developed a scalable infrastructure to support workflow composition. The entire workflow can be saved and reused...
Many of the data-centric network services deployed hold massive volumes of data at their origin Web sites, and access the data to dynamically generate responses to user requests. One way to improve the scalability and performance for such services is to develop alternate caching infrastructures, which leverage network intermediaries to detect the often large degrees of usage locality seen by such...
In wireless sensor networks (WSNs), a good sensor deployment method is vital to the quality of service (QoS) provided by WSNs. This QoS depends on the coverage of the monitoring area. In WSNs with locomotion facilities, sensors can move around and self-deploy to ensure coverage and load balancing. In SMART by J. Wu and S. Yang (2005), various optimization problems are defined to minimize different...
Intelligent video surveillance (IVS) systems are based on so called smart cameras that combine video sensing, processing and communication within a single embedded device. Maximizing the service-level and minimizing the power consumption are two important but conflicting objectives in IVS. In this paper we present a novel software framework for power-aware reconfiguration in distributed intelligent...
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.