Gpop

2015 ◽  
Vol 6 (3) ◽  
pp. 51-64 ◽  
Author(s):  
Manel Seddiki ◽  
Mahfoud Benchaïba
Keyword(s):  
Local Knowledge ◽  
The Other ◽  
Partial Knowledge ◽  
P2p Networks ◽  
Global Knowledge ◽  
Research Areas ◽  
Object Search ◽  
Shared Objects ◽  
Simulation Results ◽  
Unstructured P2p

Unstructured overlays such as P2P networks and social networks stimulate many research areas. This kind of overlays is composed of a set of self-manageable entities which share objects between them in a spontaneous way. Getting a global knowledge such as popularity of shared objects or reputation of the entity is a challenging task because in such overlays, entities have only partial knowledge about the overlay state. In this paper, the authors focus on the file popularity measurement because this parameter can be efficiently used to improve object replication and object search performances. Some research works are proposed to measure this parameter, but these measurements are only based on local knowledge of peers. The authors propose Gpop, a global file popularity measurement for unstructured P2P networks which considers both local knowledge of the peer and knowledge of the other peers participating in the network to gain a global-like knowledge. Simulation results reinforce the authors' theoretical propositions and show that our measurement is closer to the real file popularity.

ISW

2012 ◽  
Vol 4 (4) ◽  
pp. 26-40
Author(s):  
Jinlong Zeng ◽  
Guifeng Zheng
Keyword(s):  
Small World ◽  
Clustering Coefficient ◽  
P2p Network ◽  
Small World Network ◽  
Challenging Problem ◽  
P2p Networks ◽  
User Interest ◽  
Unstructured P2p Network ◽  
Simulation Results ◽  
Unstructured P2p

Content location in unstructured peer-to-peer (P2P) networks is a challenging problem. In this paper, the authors present a novel Interest-based Small World (ISW) network to address the problem, by constructing a cluster overlay in the unstructured P2P network based on the small world paradigm and user interest. There are many attractive properties of a small world network, such as low average hop distance and high clustering coefficient. Interest locality can improve the awareness of user’s indeed intentions. The authors’ scheme combines their advantage to create a better solution. The simulation results show that our scheme outperforms other schemes significantly.

scholarly journals “Q-Feed”—An Effective Solution for the Free-Riding Problem in Unstructured P2P Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-14 ◽  
Author(s):  
Sabu M. Thampi ◽  
Chandra Sekaran K
Keyword(s):  
Control Mechanism ◽  
Free Riding ◽  
Effective Solution ◽  
P2p Networks ◽  
Q Learning ◽  
Free Riders ◽  
Replication Scheme ◽  
Simulation Results ◽  
Unstructured P2p ◽  
Different Levels

This paper presents a solution for reducing the ill effects of free-riders in decentralised unstructured P2P networks. An autonomous replication scheme is proposed to improve the availability and enhance system performance. Q-learning is widely employed in different situations to improve the accuracy in decision making by each peer. Based on the performance of neighbours of a peer, every neighbour is awarded different levels of ranks. At the same time a low-performing node is allowed to improve its rank in different ways. Simulation results show that Q-learning-based free riding control mechanism effectively limits the services received by free-riders and also encourages the low-performing neighbours to improve their position. The popular files are autonomously replicated to nodes possessing required parameters. Due to this improvement of quantity of popular files, free riders are given opportunity to lift their position for active participation in the network for sharing files. Q-feed effectively manages queries from free riders and reduces network traffic significantly.

An Efficient Searching Scheme in Unstructured P2P Networks

2010 ◽  
Vol 439-440 ◽  
pp. 865-869 ◽  
Author(s):  
Ming Zhang ◽  
Jin Qiu Yang
Keyword(s):  
Routing Protocol ◽  
Adaptive Routing ◽  
P2p Networks ◽  
Community Network ◽  
Simple Scheme ◽  
P2p Systems ◽  
Simulation Results ◽  
Unstructured P2p ◽  
P2p System ◽  
Present Simulation

Unstructured peer-to-peer (P2P) systems，due to their excellent support for content lookup and sharing，are creating a large proportion of network traffic in today’s Internet. A P2P system typically involves thousands or millions of live peers in the network. In this paper, we propose and evaluate an efficient searching scheme in unstructured P2P networks. This scheme proposes a local adaptive routing protocol. This routing protocol adopts a simple scheme which driven by query interest among peers. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to dynamically group nodes in clusters containing peers with shared interests, at the same time, and organized into a community network.

Reducing Network Overhead with Common Junction Methodology

2011 ◽  
Vol 3 (3) ◽  
pp. 51-61
Author(s):  
Shashi Bhushan ◽  
M. Dave ◽  
R.B. Patel
Keyword(s):  
Response Time ◽  
P2p Networks ◽  
P2p Systems ◽  
Mismatch Problem ◽  
Simulated Network ◽  
The Common ◽  
Simulation Results ◽  
Unstructured P2p ◽  
Network Overhead ◽  
Topology Mismatch

In structured and unstructured Peer-to-Peer (P2P) systems, frequent joining and leaving of peer nodes causes topology mismatch between the P2P logical overlay network and the physical underlay network. This topology mismatch problem generates high volumes of redundant traffic in the network. This paper presents Common Junction Methodology (CJM) to reduce network overhead by optimize the overlay traffic at underlay level. CJM finds common junction between available paths, and traffic is only routed through the common junction and not through the conventional identified paths. CJM does not alter overlay topology and performs without affecting the search scope of the network. Simulation results show that CJM resolves the mismatch problem and significantly reduces redundant P2P traffic up to 87% in the best case for the simulated network. CJM can be implemented over structured or unstructured P2P networks, and also reduces the response time by 53% approximately for the network.

An Intuitionistic Fuzzy Based Novel Approach to CPU Scheduler

2020 ◽  
Vol 16 (4) ◽  
pp. 316-328
Author(s):  
Supriya Raheja
Keyword(s):  
Fuzzy Inference ◽  
The Other ◽  
Simulation Environment ◽  
Inference System ◽  
Intuitionistic Fuzzy ◽  
Novel Approach ◽  
Continuous Feedback ◽  
Simulation Results ◽  
Effectiveness And Efficiency ◽  
Unique Capability

Background: The extension of CPU schedulers with fuzzy has been ascertained better because of its unique capability of handling imprecise information. Though, other generalized forms of fuzzy can be used which can further extend the performance of the scheduler. Objectives: This paper introduces a novel approach to design an intuitionistic fuzzy inference system for CPU scheduler. Methods: The proposed inference system is implemented with a priority scheduler. The proposed scheduler has the ability to dynamically handle the impreciseness of both priority and estimated execution time. It also makes the system adaptive based on the continuous feedback. The proposed scheduler is also capable enough to schedule the tasks according to dynamically generated priority. To demonstrate the performance of proposed scheduler, a simulation environment has been implemented and the performance of proposed scheduler is compared with the other three baseline schedulers (conventional priority scheduler, fuzzy based priority scheduler and vague based priority scheduler). Results: Proposed scheduler is also compared with the shortest job first CPU scheduler as it is known to be an optimized solution for the schedulers. Conclusion: Simulation results prove the effectiveness and efficiency of intuitionistic fuzzy based priority scheduler. Moreover, it provides optimised results as its results are comparable to the results of shortest job first.

A Multiregion Model with Capital Accumulation and Endogenous Amenities

2007 ◽  
Vol 39 (9) ◽  
pp. 2248-2270 ◽  
Author(s):  
Wei-Bin Zhang
Keyword(s):  
Capital Accumulation ◽  
Comparative Statics ◽  
The Other ◽  
High Rate ◽  
Unique Equilibrium ◽  
Economic Activities ◽  
Technological Differences ◽  
National Output ◽  
Simulation Results ◽  
Wage Disparities

The author develops a multiregional growth model with endogenous amenity and capital accumulation for any number of regions. The simulation results demonstrate that the national dynamics have a unique equilibrium. Comparative statics analysis shows that, if environmental improvement occurs in the technologically advanced (less advanced) region, the national output rises (falls). As a region improves its technology, the other two regions' aggregated output levels fall—not only in relative, but also in absolute, terms. This implies that if any region has a high rate of technological change and the other regions remain technologically stationary, then economic activities will tend to be concentrated in the technologically advancing region. It is also shown that technological differences appear to play only a small role in accounting for spatial wage disparities and endowments.

Simulation on Effect of Five Kinds of Belt Structures on Tire Performance

2012 ◽  
Vol 501 ◽  
pp. 151-155
Author(s):  
Yong Liu ◽  
Ge Zhang ◽  
Hua Yan ◽  
Yu Mei Ding ◽  
Wei Min Yang
Keyword(s):  
The Other ◽  
Molding Process ◽  
Simulation Results ◽  
Better Than

In this article, three kinds of belt named B, C and D type are invented, then their main performance are compared with the other two kinds of belt structures introduced in previous papers. Simulation results showed that B and D-type belts are better than the other three. Comparatively the latter needs less material, its molding process is easier, and the tire body is lighter than B type tire, so in general it can be considered that D-type belt is the best among the five kinds of belt structures.

Development of Advanced CNC Interpolation Algorithm With Consideration of Command and Dynamic Errors

2015 ◽  
Author(s):  
Meng-Shiun Tsai ◽  
Ying-Che Huang
Keyword(s):  
The Other ◽  
Contour Error ◽  
Interpolation Algorithm ◽  
Interpolation Scheme ◽  
Error Equation ◽  
The Past ◽  
Cnc Interpolation ◽  
Dynamic Errors ◽  
Simulation Results ◽  
The Given

In this paper, an integrated acceleration/deceleration with dynamics interpolation scheme is proposed to confine the maximum contour error at the junction of linear junction. The dynamic contour error equation is derived analytically and then it is utilized for the interpolation design. Based on the derived formulations which could predict the command and dynamic errors, the advanced interpolation design could adjust the connecting velocity of the two blocks to confine the overall contour errors under the given tolerance. Simulation results validate the proposed algorithm can achieve higher accurate trajectory as compared to the other interpolation algorithm proposed in the past.

Modeling Recrystallization for 3D Multi-Pass Forming Processes

2007 ◽  
Vol 558-559 ◽  
pp. 1201-1206 ◽  
Author(s):  
Mihaela Teodorescu ◽  
Patrice Lasne ◽  
Roland E. Logé
Keyword(s):  
Numerical Simulation ◽  
Grain Size ◽  
Present Model ◽  
Static Recrystallization ◽  
Volume Fraction ◽  
The Other ◽  
Finite Element Code ◽  
3D Numerical Simulation ◽  
Fraction Distribution ◽  
Simulation Results

The present work concerns the simulation of metallurgical evolutions in 3D multi-pass forming processes. In this context, the analyzed problem is twofold. One point refers to the management of the microstructure evolution during each pass or each inter-pass period and the other point concerns the management of the multi-pass aspects (different grain categories, data structure). In this framework, a model is developed and deals with both aspects. The model considers the microstructure as a composite made of a given (discretized) number of phases which have their own specific properties. The grain size distribution and the recrystallized volume fraction distribution of the different phases evolve continuously during a pass or inter-pass period. With this approach it is possible to deal with the heterogeneity of the microstructure and its evolution in multi-pass conditions. Both dynamic and static recrystallization phenomena are taken into account, with typical Avrami-type equations. The present model is implemented in the Finite Element code FORGE2005®. 3D numerical simulation results for a multi-pass process are presented.

Sign in / Sign up

Export Citation Format

Share Document