5901027
Cycles Containing Many Vertices of Subsets in 1-Tough Graphs with Large Degree Sums
5056715
Cycles Containing Given Subsets in 1-Tough Graphs
14435501
Efa: an efficient content routing algorithm in large peer-to-peer overlay networks
An important issue for peer-to-peer application is to locate content within the network. There are many existing solutions to this problem, however, each of them addresses different aspects and each has its deficiencies. We focus on the unstructured peer-to-peer scenario and present a constrained flooding routing algorithm, Efa, which overcomes some of the deficiencies of those existing strategies. Efa performs application level broadcasting in a potentially very large peer-to-peer network overlaid on the Internet. Efa is completely decentralized and self-organized. It is a more scalable alternative to flooding, which is commonly used in unstructured peer-to-peer systems. Utilizing just a small amount of topology info, Efa is almost as simple as flooding, but it is much more efficient and scalable.
14076397
The Empirical Studies on Quality Benefits of Reusing Software Components
The benefits of reusing software components have been studied for many years. Several previous studies have concluded that reused components have fewer defects in general than non-reusable components. However, few of these studies have gone a further step, i.e., investigating which type of defects has been reduced because of reuse. Thus, it is suspected that making a software component reusable will automatically improve its quality. This paper presents an on-going industrial empirical study on the quality benefits of reuse. We are going to compare the defects types, which are classified by ODC (orthogonal defect classification), of the reusable component vs. the non-reusable components in several large and medium software systems. The intention is to figure out which defects have been reduced because of reuse and the reasons of the reduction.
17673951
A semantics-based routing scheme for grid resource discovery
Grid technologies enable the sharing of a wide variety of distributed resources. To fully utilize these resources, effective resource discovery mechanisms are necessities. However, the complicated and dynamic characteristics of grid resources make sharing and discovering them a challenging issue. In this paper, we propose a peer-to-peer (P2P) based overlay network to assist the efficient resource discovery and query. The framework is based on the RDF metadata infrastructure, allowing a rich and extensible description of resources. To avoid flooding the network with a query, we propose a comprehensive semantics-based query forwarding strategy, which only forwards queries to semantically related nodes. After the related nodes have been located, the original RDF query is used to do the final query and retrieval. Results from simulation experiments demonstrate that this architecture is scalable and efficient
18241375
Proof of Service in a Hybrid P2P Environment
In a hybrid peer-to-peer environment, clients can either directly download data from their server, or share data with each other. In order to create incentives for clients to share data and decrease server load, an effective economy model is for the server to credit those provider clients who provide data to others and offer discounts to those recipient clients who download data from provider clients instead of the server. To realize this model, the proof of service between provider and recipient clients must be provided. 
 
We design and investigate three different schemes and compare them in terms of scalability, effectiveness, and cost. We emphasize the issues of lessening the number of proofs which must be provided, avoiding a heavy load on the server, and ensuring the proof for every piece of data served. Our study shows our enhanced public-key-based scheme to be the most effective.
42239627
Evolvable Fuzzy System for ATM Cell Scheduling
In this paper, we propose an evolvable fuzzy system for ATM cell scheduling. When the scenarios of cell flows in an ATM network change dramatically, traditional scheduling algorithms, first-in-first-out (FIFO) and static priority, which employ static switching scheme may see their efficiency deteriorate. An alternative is to use dynamically weighted priority, which changes the priority based on the cell delay. Still, the algorithm per se is fixed and on the hardware level, nothing changes. Our goal in this paper is to achieve hardware adaptability and demonstrate its applicability in ATM switching. To do this, we proposed an evolvable fuzzy system [1]. With evolvable fuzzy system (EFS), the system undergoes transformation in response to changes in the cell patterns in order to maintain operational efficiency. We envisage that such a system is potentially useful for demanding real-time dynamic control applications.