this paper addresses the dynamic location update for personal communication service (PCS) networks. the four-direction mobility model for the popular grid cellular architectures is introduced to exploit the mobility p...
详细信息
this paper addresses the dynamic location update for personal communication service (PCS) networks. the four-direction mobility model for the popular grid cellular architectures is introduced to exploit the mobility patterns of all kinds of mobile terminals (MTs). the shape and size of the local area (LA) in the dynamic location update scheme is determined by minimizing the total location management cost with bounding the paging cost. the optimization problem is transferred to maximize expected number of cells traversed by the MT in the LA with a given size of the LA. the analytic model of calculating the probabilities of any MT's moving is established. An algorithm is proposed to solve the optimization problem efficiently.
Deployment of mobile agents in network-based applications has attracted lots of attentions in recent years. How to control the activities of agents is crucial for effective application of mobile agents. this paper foc...
详细信息
ISBN:
(纸本)0769521355
Deployment of mobile agents in network-based applications has attracted lots of attentions in recent years. How to control the activities of agents is crucial for effective application of mobile agents. this paper focuses on the application of mobile agents in network routing. Two important activity properties of mobile agents are identified: the probability of success (the probability of finding the destination) and the distribution of mobile agents running in the network. To our knowledge, little work has been done on these two aspects. Our results show that the number of mobile agents can be controlled by adjusting the number of agents generated per request and the number of jumps each mobile agent can move. thus, we can improve network performance by tuning relevant parameters.
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area mainly focused on static networks. However, observations show that diffusive algorithms, origin...
详细信息
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area mainly focused on static networks. However, observations show that diffusive algorithms, originally designed for these networks, can also be applied in nonstatic scenarios. In this paper we prove that the general diffusion scheme can be deployed on dynamic networks and show that its convergence rate depends on the average value of the quotient of the second smallest eigenvalue and the maximum vertex degree of the networks occurring during the iterations. In the presented experiments we illustrate that even if communication links of static networks fail with high probability, load can still be balanced quite efficiently. Simulating diffusion on ad-hoc networks we demonstrate that diffusive schemes provide a reliable and efficient load balancing strategy also in mobile environments.
In a graph G = (V, E), a subset F /spl sub/ V(G) is a feedback vertex set of G if the subgraph induced by V(G)/spl bsol/F is acyclic. In this paper, we propose an algorithm for finding minimal feedback vertex sets of ...
详细信息
ISBN:
(纸本)0769521355
In a graph G = (V, E), a subset F /spl sub/ V(G) is a feedback vertex set of G if the subgraph induced by V(G)/spl bsol/F is acyclic. In this paper, we propose an algorithm for finding minimal feedback vertex sets of directed split-stars. Indeed, our algorithm can derive an upper bound to the size of the feedback vertex set for directed split-stars. Moreover, a simple distributed algorithm is presented for finding such sets.
In this paper, we present the processor mapping technique to eliminate amount of data exchange in runtime data redistribution on symmetric matrices. the main idea of the proposed technique is to develop mathematical f...
详细信息
ISBN:
(纸本)0769521355
In this paper, we present the processor mapping technique to eliminate amount of data exchange in runtime data redistribution on symmetric matrices. the main idea of the proposed technique is to develop mathematical functions for mapping destination processors to a new sequence of processor id. the realigned order of destination processors is then used to perform data redistribution in the receiving phase. Together with a local matrix transposition scheme, interprocessor communication can be totally eliminated in runtime redistribution. the other improvement of this approach is that one does not need to compute the complicated communication sets. the indexing cost is reduced largely. the theoretical analysis shows that (p-1)/p data transmission cost can be saved for a redistribution over p/spl times/p processors grid. Experimental result also shows that the processor mapping technique provides superior improvement for runtime data redistribution.
It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties...
详细信息
It is well known that 4 or 8-neighborhood property has an important role in many algorithms, for example, image processing, solving partial differential equation (PDE) etc. In this paper, we establish these properties on an OTIS-Mesh, an optoelectronic parallel computer. We show that these properties can be established in constant time withthe help of a new indexing scheme called processor data index (PDI), proposed in this paper.
In this paper, we offer the non-continuous direction vector I test, an extension of the direction vector I test, to make sure whether there are integer-valued solutions for one-dimensional arrays with constant bounds ...
详细信息
ISBN:
(纸本)0769521355
In this paper, we offer the non-continuous direction vector I test, an extension of the direction vector I test, to make sure whether there are integer-valued solutions for one-dimensional arrays with constant bounds and non-one-increment.
Quality of service in IP networks necessitates the use of performance management. As Internet continues to grow exponentially, a management system should be scalable in terms of network size, speed and number of custo...
详细信息
ISBN:
(纸本)0769521355
Quality of service in IP networks necessitates the use of performance management. As Internet continues to grow exponentially, a management system should be scalable in terms of network size, speed and number of customers subscribed to value-added services. this article proposes a flexible, scalable, self-adapting model for managing large-scale distributed network. In this model, Web services framework is used to build the software architecture and XML is used to build the data exchange interface. Policy-based hierarchical event-processing mechanism presented by this paper can efficiently balance the loads and improve the flexibility of the system. the prediction algorithm adopted by this model can predict the network performance more effectively and accurately.
Internet computing and grid technologies promise to change the way we tackle complex problems. they will enable large-scale aggregation and sharing of computational, data and other resources across institutional bound...
详细信息
ISBN:
(纸本)0769521355
Internet computing and grid technologies promise to change the way we tackle complex problems. they will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively will transform scientific disciplines ranging from high-energy physics to the life sciences. In this paper, a grid computing environment is proposed and constructed on multiple PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). the experimental results are also conducted by using the matrix multiplication to demonstrate the performance. On the other hand, the approaches to deal with scheduling and load balancing on multiple heterogeneous PC clusters computer system are not mature. Self-scheduling schemes which are suitable for parallel loops with independent iterations on heterogeneous cluster computer system have been designed in the past. However, these schemes, such as FSS, GSS and TSS, can not achieve load balancing in extremely heterogeneous environment. We propose a heuristic approach based upon a two-phase scheme to solve parallel regular loop scheduling problem on an extremely heterogeneous grid computing environment.
Recent trends in the database paradigm are to incorporate fuzzy sets to tackle imprecise and ambiguous information of real world problems. In this paper, using the concepts of fuzzy sets and possibility theory, a FTS ...
详细信息
Recent trends in the database paradigm are to incorporate fuzzy sets to tackle imprecise and ambiguous information of real world problems. In this paper, using the concepts of fuzzy sets and possibility theory, a FTS relational model is developed to extend the TS-relational model by Ee Peng Lilm et al. (1999). the extended model integrates local fuzzy databases by merging the respective export fuzzy databases to generate a set of FTS relations of fuzzy multidatabase. A set of algebraic operations is defined to manipulate the FTS relations and their correctness is established. A set of algebraic rules is also presented to optimize FTS algebraic expressions.
暂无评论