SLBA: A Security Load-balancing Algorithm for Structured P2P Systems
|
|
- Anastasia Tabitha Norris
- 8 years ago
- Views:
Transcription
1 Journal of Computational Information Systems 8: 7 (2012) Available at SLBA: A Security Load-balancing Algorithm for Structured P2P Systems Wei MI, Chunhong ZHANG, Xiaofeng QIU School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing , China Abstract Dynamic load balancing is one key adaptation mechanism often deployed in networking and computing systems. Numerous proposals exist for load balancing in peer-to-peer networks. All of them will enhance the availability of P2P system to some extent. However, few attentions have been paid on security threats introduced by the load balancing. This paper analyzes the security vulnerabilities of the typical DHT load balancing mechanism; then proposes an algorithm that both facilitates good performance and does not dilute security. Our algorithm, SLBA, achieves load balance by targeted interval ID generation and higher convergence rate load transfer algorithm, and limits any fundamental decrease in security by basing each node s set of identifiers on a single certificate and considering security factor in load transfer among nodes. Performance evaluation shows that, compared to the classical algorithms, the load balancing effect of SLBA algorithm is significant, the convergence rate and load balancing security are significantly raised. Keywords: P2P; Load Balancing; Security 1 Introduction Decentralized structured overlays and distributed hash tables (DHT) proffer a unique vision of computing: a collection of computing and communication resources shared by active users. However, nodes are heterogeneous, workload assigned to system may be heavy-tailed, node availability and churn rates may change over time. Load balancing is a key step towards adapting to these characteristics and ensuring the reliability and availability. There is a large body of literature on load balancing of DHT system and all proposed load balancing schemes can be broadly characterized as ID manipulating solutions and virtual server solutions. ID manipulating solutions [1-3] balance load owned by nodes through elaborately assigning and reassigning node IDs. To balance load, many node IDs need to be reassigned This work is supported by China-Finland Cooperation Project (No. 2010DFA12780), National Key Program (No. 2011ZX ) and Key Laboratory of Universal Wireless Communications, Ministry of Education. Corresponding author. address: miwei1985@gmail.com (Wei MI) / Copyright 2012 Binary Information Press April 2012
2 2752 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) when a node joins or leaves overlay. This results in transferring a lot of data. In virtual server solutions [4-9], each physical node runs multiple virtual DHT servers proportional to its capacity. Virtual servers can also be created, deleted and transferred dynamically based on the changing load distribution. However, these solutions have some deficiencies as following: the convergence rate is still low, which needs more detecting messages and higher detecting overhead; algorithm relies on some fixed nodes for collecting load information and generating reassign policy in the system, which requires additional equipments and higher cost; the main killer issue is give up on important security properties. A key issue in the operation of a p2p network is whether or not one assumes it may contain malicious nodes. A malicious node can subvert content or attempt to control particular portions of the identifier space. In this paper, we analyze the security vulnerabilities of the typical DHT load balancing solutions. Then, we propose SLBA, a security load balancing algorithm for DHT that supports wide variation in skew, heterogeneity, and churn while retaining security. At a high level, SLBA works as follows: (1) at joining time, based on targeted interval verifiable ID generation, an u- nique semi-ca server generates a set of verifiable IDs for node, which can limit any fundamental decrease in security and greedily reduces discrepancies between capacity and load; (2) during its run-time, experiencing overload node should execute security-aware load transfer algorithm, which can significantly raise the convergence rate and load transfer security. This paper proceeds as follows. In Section II, we introduce the related work. In Section III, we analyze the security vulnerabilities of load balancing solutions. In Section IV, we present SLBA algorithm in detail. In Sections V, we evaluate performance of SLBA. Finally, we conclude and present future work in Section VI. 2 Related Work ID manipulating load balancing. These solutions balance load owned by nodes through elaborately assigning and reassigning node IDs. ID manipulating solution causes too much additional overhead if load balancing requirement is stringent. To balance load, many node IDs need to be reassigned when a node joins or leaves overlay. This results in migrating a lot of data. It also increases maintenance overhead because many messages are needed to update routing table, which is due to the changes of node IDs. Reference [1] has proposed the use of the power of two choices paradigm to achieve better load balancing. Each object is hashed to d 2 IDs, and is placed in the namespace of the least loaded node. Reference [2] introduces a scheme where a physical host maintains a set of virtual servers which have overlapping links in the routing table. However, there will still be overloaded nodes. Reference [3] proposes algorithm for ID space balancing. They assign multiple positions of the ID space to every node, but choose only one of those virtual nodes to become active at a time. However, this algorithm needs to frequently adjust the node ID, causing higher load regulation overhead. Virtual server load balancing. In these solutions, each physical node runs a number of virtual servers proportional to its capacity. So the load of a physical node is determined by the amount of all the load segments owned by its virtual servers. Based on the changing load distribution, virtual servers can be created, deleted and transferred dynamically.
3 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) Both CAN [4] and Chord [5] had achieved load balancing, and assumed that the capacity of all nodes is equal. CFS [6] simplifies load transfer by removing the virtual server, which may lead to the other nodes overloaded and convergence time longer. Reference [7] describes three load balancing algorithms: one-to-one, one-to-many, many-tomany, based on virtual server and directory, which are used in static heterogeneous networks and are expanded to dynamics heterogeneous networks [8]. The assignment of virtual nodes is typically performed by one or more directory nodes, which can result in single-point failure. Reference [9] builds a structure on top of the P2P network: k-ary tree, which is responsible for the collection and the release of node information, as well as the transfer strategy of virtual server. The algorithm makes the network structure more complicated so that the balancing speed and fault tolerance are degraded. Security models for load balancing. There are only few studies on security models for load balancing in distributed systems [10]. According to virtual server idea, it proposes k-choices, a load balancing algorithm for structured overlays that retains the security afforded by verifiable IDs. However, it only consider security of node joining, there are also some security vulnerabilities in load distribution collection, load transfer strategic decisions and execution. 3 Security Vulnerabilities Analysis In order to achieve load balancing, these solutions balance namespace or adjust the number of documents for node through transferring virtual servers or multi-hash, but the emphasis is different. ID manipulating solutions have main characteristic: (1) need to measure and calculate the changing load distribution; (2) balance load owned by nodes through elaborately assigning and reassigning node IDs. Whereas virtual server solutions main characteristic: (1) each node runs multiple virtual server; (2) need to measure and calculate the changing load distribution; (3) based on the changing load distribution, virtual servers can be created, deleted and transferred dynamically. A key issue of P2P is whether or not one assumes it may contain malicious nodes. A malicious node can subvert content or attempt to control particular portions of namespace. Based on main characteristic, our exposition is focused on load balancing policies security vulnerabilities. Node ID generation and ID assignment. To achieve good performance, those solutions let nodes join as normal and reactively position nodes to arbitrary locations in namespace. Arbitrarily choosing IDs forfeits an important security goal for p2p. Attacks that center around the falsification of a node s identifier are called Sybil [11] and ID mapping [12] attacks. The load balancing solutions may facilitate the execution of these attacks. Douceur outlines having a logical center, trusted authority to issue IDs is the only practical way to guarantee a one-to-one correspondence between IDs and the physical entities. Node Joins, Leaves and Churn. In virtual server solution, when one node departs, it must take its log(n) VSs with it, causing log(n) times more adjustments to be made. So, it may result in churn attack [13] is easier to implement and more efficient. Load distribution collection and data correctness and confidentiality. To balance load, it need to measure and calculate the changing load distribution. To make a correct and
4 2754 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) validity load transfer strategic decision, it must guarantee that the collected load distribution is valid. Load transfer strategic decisions and execution and nodes security levels. During load transferring, the security level of transfer node is important for transfer security. On overlay, each node is a node in traditional network. It has a kind of operation system, network protocol. If a node has low security, attackers may intrude the weak nodes, then penetrate into the whole P2P through them. In P2P, the reputation [14] of a node can represent the security level. It is a long-term evaluation. Nodes behavior is restricted on the basis of the evaluation, or provides the reputation of the node as a reference when choosing a node to cooperate. 4 SLBA Design Considering the security vulnerabilities of load balancing policies, we design a security load balancing algorithm called SLBA for DHT. Based on the virtual server, SLBA include a novel verifiable virtual ID generation (targeted interval verifiable ID generation) and a security virtual server transfer algorithm (security-aware load transfer algorithm). A. Targeted interval verifiable ID generation Arbitrarily choosing IDs forfeits an important security goal for P2P. While having a logical center, trusted authority to issue IDs is the only practical way to defend ID attacks. So, we propose that virtual IDs are generated by a central semi-ca server. This option is scalable, because each node contacts server as it joins/leaves and transfers virtual servers. In DHT system, data distribution is under uniformly random or Zipf query distribution [15]. Under these two distributions, the proportion of data the node is responsible for is also strongly depends on the proportion of the node s hash space. Thus, hash space assignment during node join is very important for load balancing. We achieve namespace balance through special ID generation mode and examine load balancing under uniformly random and Zipf queries. To evaluate the balancing degree of load distribution precisely, we need to define a mathematical way for evaluation. Suppose nodes are indexed from 1 to N. The capacity of node i is C i. Each node s capacity can be estimated by the node itself or operator in the same standard. RSpace i is the proportion of hash space which node i actually owns. Then the proportion of hash space which node i should owns is OSpace i = c i / N C k. We define node s LB (Load Balancing Factor) as k=1 LB = RSpace/OSpace 1, so LB is closer to zero means that load distribution is more balanced. To make sure that node joining won t break the load balance, virtual IDs are generated with the current load distribution status. Suppose nodes that already in the overlay are indexed from 1 to N-1 and the joining node is N. When node N joins, it first sends a single unit of certified information to semi-ca server, server runs targeted interval verifiable ID generation to generate virtual IDs for node N. Procedure targeted intervals verifiable ID generation mode if N=1 else generate C 1 V random virtual IDs for node N
5 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) Compute hypothetic LB of node 1 to N-1 in system: LB i = RSpace i /OSpace i 1; Create new virtual IDs of new node N end if while (RSpace N < OSpace N ) Select node x: LB x = max(lb i ); Select biggest VID of node x: Space(V ID) = max(space(x s virtual ID)); Create new virtual ID (xid): xid = rand(prodecessor(v ID), V ID); Computer LB x, RSpace x, RSpace N : end while RSpace x = RSpace x Space(xID); LB x = RSpace x /OSpace x 1; RSpace N = RSpace N + Space(xID); LB N = RSpace N /OSpace N 1; In this algorithm, we first find the largest space virtual server VID of node x whose LB is biggest. Then, we generate new ID xid randomly in targeted interval of virtual server VID responsible for. B. Security-aware load transfer algorithm Once the load balance is broken, virtual IDs are transferred from heavily loaded nodes to light-load nodes according to current load distribution status. However, in DHT systems, the load distribution is unpredictable. How to find light-load nodes quickly and correctly is the key problem. Furthermore, there also are some security vulnerabilities in load distribution collection, load transfer strategic decisions and execution. For this reason, we propose the security-aware load transfer algorithm (SALT). In SALT, we adopt ant colony optimization, which can quickly and correctly find candidate light-load nodes in the unknown load distribution system. In addition, both nodes load status and reputation are introduced in light-load nodes discovery, so it can achieve good load balancing and ensure the load transfer security. Considering the real load skew, we define the node utilization rate µ refers to the ratio of load of node L to its largest carrying capacity C, that is, µ = L/C. And the system utilization rate can be described as µ = N L i / N C i. To assure QoS, we set a threshold LT for µ and prevent i=1 i=1 node s µ becoming higher than LT. According to the ant colony optimization, we also define some related terms and parameters. Define 1 Pheromone We define the pheromone ph as available capacity of node i, ph(i) = C i L i. To make the
6 2756 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) speed faster and the cost lower, producing and updating of pheromone is complete with DHT node routing table update process. Define 2 Heuristic We define the safety factor as the reputation of node. The reputation (rep) is also introduced in routing selection as a heuristic factor, which can guarantee load transfer security. Define 3 Forward probability p k (i, j) In DHT routing, according to pheromone ph and heuristic rep, next hop is determined. Suppose that node i receives ant k, it will select neighbor j as next hop by p k (i, j). p k (i, j) = ph(j) α rep(j) β ph(u) α rep(u) β routt able(i) ph(j) α rep(j) β routt able(i), ph(j) > 0 & j routt able(i) tabu(k) ph(u) α rep(u) β, ph(j) < 0 & j routt able(i) tabu(k) 0, others Where, α and β is the relative important factor of pheromone and heuristic; routtable(i) is the routing table entry of node i; tabu(k) is the taboo list of search ant k. Define 4 Constraints (s.t.) In light-load nodes searching, the target nodes must meet some constraints (s.t.) as follow s.t. L(s) Load transfer C(s) LT m M L(m) + Load transfer(m) C(m) µ M Load transfer(m) Load transfer m=1 m M rep(s) rep(m) Where, Load transfer is total load which source node transfers out; Load transfer(m) is the load of node m receives. Overloaded node s µ can drop below LT, light node s µ can t exceed µ, and the light node s reputation value is higher than resource node s. Once node FN s capacity utilization reaches LT, FN will run the security-aware load transfer algorithm. Procedure security-aware load transfer algorithm 1) Node FN generates kth(k is initialized to 1) Search ant and set antid, constraints s.t., tabu list, TTL, pheromone and heuristic list of visited nodes; 2) according to the formula (1), node FN chooses the neighbor j whose p k (i, j) is kth largest as the next hop and forwards search ant k to node j ; 3) On reciving ant k, node j puts its ID, Ph(j) and rep(j) into tabu list and pheromone and heuristic list; according to s.t., node j judges whether it is a valid candidate node ; a. if node j meets s.t., it should generate guid ant which return node FN directly, update TTL=0, and end forward search ant k. b. if node j does not meet s.t., and all neighbors are in tabu list,it should generate guid ant which return node FN directly, update TTL=0, and end forward ant k. (1) (2)
7 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) c. if node j meet s.t., nor all neighbors are in tabu list,it should update TTL=TTL-1; if TTL=0, it generates guid ant which return node FN directly, otherwise node j chooses neighbor m whose p k (j, m) is largest as next hop, and forwards ant k, then go to step 3 4) on receiving guide ant, source node FN should make all candidate nodes form list, and selects target node, then doing load transfer. 5) source node FN caluates the new µ, if µ > LT, then k = k + 1,go to step 1; otherwise the algorithm is end. 5 Performance Evaluation This section compares load distribution and load balancing overhead between targeted interval verifiable ID generation of SLBA and typical virtual ID generation, and evaluates the convergence rate and load balancing security of security-aware load transfer algorithm. Basic parameters are listed in TABLE I. Table 1: Basic experiment parameters Parameters Description Value N Node number 2 14 Load C Rate of DHT put/get/remove operations (times per second per node) The mean of system capacity [100,5000] C Node s capacity [0.5 C, 2 C] V The number of virtual servers per capacity in network initialization log N, 2log N, 4log N A. Targeted interval verifiable ID generation To evaluate the effect of load balancing, we compare the load distribution and load balancing overhead between targeted interval verifiable ID generation of SLBA and typical virtual ID generation in Chord context. Our solution adopts a novel algorithm to generate virtual ID, while virtual node IDs are generated randomly. ID manipulating solution can distribute load evenly as the other two solutions, and it is not practical because of the overhead issue. So ID manipulating solution is not compared here. 1) Load distribution Fig.1 shows the maximum and minimum LB. Fig.2 shows the empirical CDF (Cumulative Distribution Function) of LB. As shown, LBs are much closer to zero and maximum LB is reduced a lot when using targeted interval verifiable ID generation, which means that our ID generation can increase system capacity a lot. With the increase of V, the load balancing effects of all two ID solutions are becoming better. 2) Load balancing overhead Virtual server solution has to increase DHT nodes number a lot, which results in increasing routing and maintenance overhead. These overhead is proportional to the number of virtual servers, so they are evaluated with the average of virtual server number per capacity.
8 2758 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) Fig. 3 shows the average of virtual server number per capacity. The value of targeted interval verifiable ID generation is about 40% of typical virtual ID generation s. So, compared with typical virtual ID, our ID solution balancing overhead has reduced by 60%. Fig. 1: The maximum and minimum LB Fig. 2: The empirical CDF of LB Fig. 3: The average of virtual server number per capacity B. Security-aware load transfer algorithm This section compares convergence rate and load balancing security among security-aware load transfer algorithm (SALT-algorithm), O2O-algorithm [7] (One-to-One) and M2M-algorithm [7] (Many-to-Many). SALT and O2O are full distributed model, while M2M is semi-centralized semidistributed model, all are the typical virtual server solutions. Parameters are listed in TABLE II. For meeting the stringent load balancing requirement, all solutions have to adjust the load through transferring virtual servers, which results in increasing candidate node discovery overhead and data migration overhead a lot. Furthermore, reassign loads among nodes without considering safety factor, resulting in the transfer contents insecurity. Consequently, we will evaluate convergence rate, data migration overhead and security factor increment. Here, convergence rate is evaluated with detect hops for candidate node discovery per heavy nodes.
9 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) Table 2: Balancing algorithm parameters Parameters Description Value µ Node utilization rate [0,1] rep the quantified reputation [1,5] TTL Maximal survival time of ants log2n α, β Relative importance factor of pheromone or heuristic [0,1] dnum Directory nodes number in M2M log2n Fig. 4: The convergence rate of load balancing Fig. 5: Security factor increment of load transfer As shown in Fig.4, Fig.5, experimental results as follows: The mean of the detection hops per heavy nodes for SALT, O2O and M2M algorithms are distributed in [15,20], [25,45], [110,150] range respectively, indicating that SALT algorithm can make the search for light-load nodes more targeted. It is because that ant-based technology is a non-direct collaboration way, which can avoid blind search services, so, it can improve the convergence rate. Security factor increment per data migration of our SALT algorithm is larger than the other two algorithms obviously. It is because that, in SALT, candidate nodes discovery introduces safety factor, which makes a compromise between load balancing effect and load balancing security. 6 Conclusion and Further Work This paper has analyzed the security vulnerabilities of the typical DHT load balancing mechanism, and proposed a security load balancing algorithm called SLBA for DHT. SLBA includes
10 2760 W. Mi et al. /Journal of Computational Information Systems 8: 7 (2012) targeted interval verifiable ID generation mode and security-aware load transfer algorithm, which can facilitate good performance and do not dilute security. Performance evaluation shows that, compared to the classical algorithms, the load balancing effect of SLBA is significant, the convergence rate and load balancing security are significantly raised. In this paper, we roughly analyze the security vulnerabilities of the typical DHT load balancing mechanisms. However, it should to expound the influence of load balancing or overhead because of the introduction of security mechanisms. We are also implementing SLBA and will test its performance in the future. References [1] J. Byers, J. Considine, Simple load balancing for distributed hash tables, LNCS, 2003, pp [2] P. Godfrey and I. Stoica, Heterogeneity and load balance in distributed hash tables, INFOCOM 2005, 2005, vol. 1, pp [3] D. Karger, M. Ruhl, Simple efficient load balancing algorithms for peer-to-peer systems, Theory of Computing System, 2006, vol. 39, pp [4] S. Ratnasamy, P. Francis, A scalable content-addressable network, Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, 2001, pp [5] I. Stoica, R. Morris, Chord: A scalable peer-to-peer lookup service for Internet applications, Proc. of the 2001 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications, 2001, pp [6] F. Dabek, M. F. Kaashoek, Wide-Area Cooperative storage with CFS, ACM SIGOPS Operating Systems Review, 2001, vol. 35, no. 5, pp [7] A. R. Karthik, K. Lakshminarayanan, Load balancing in structured P2P systems, LNCS, 2003, pp [8] B. Godfrey, K. Lakshminarayanan, Load balancing in dynamic structured P2P systems, INFO- COM 2004, 2004, vol. 4, pp [9] Zhu Y, Hu Y, Efficient, proximity-aware load balancing for DHT based P2P systems, IEEE Trans. on Parallel and Distributed Systems, 2005, vol. 6, no. 4, pp [10] J. Ledlie, M. Seltzer, Distributed, secure load balancing with skew, heterogeneity and churn, INFOCOM, 2005, vol. 2, pp [11] J. Douceur, The Sybil Attack, Peer-to-Peer Systems, Springer, 2002, pp [12] Davide Cerri, Alessandro Ghiono, ID Mapping Attacks in P2P Networks, IEEE Globecom, 2005, vol. 3, pp. 6. [13] E. Sit, R. Morris. Security considerations for peer-to-peer distribution hash tables, Future Directions in Distributed Computing, Springer-Verlag, pp , [14] Jochem van Vroonhoven, Peer to Peer Security, 4th Twente Student Conference on IT, Enschede, [15] F. Bustamante and Y. Qiao, Friendships that last: Peer lifespan and its role in P2P protocols, Eighth International Workshop on Web Content Caching and Distribution, Hawthorne, NY, October [16] M. Dorigo. and M. Birattari, T. Stutzle, Ant colony optimization, Computational Intelligence Magazine, IEEE, 2006, vol. 1, pp
Ant-based Load Balancing Algorithm in Structured P2P Systems
Ant-based Load Balancing Algorithm in Structured P2P Systems Wei Mi, 2 Chunhong Zhang, 3 Xiaofeng Qiu Beijing University of Posts and Telecommunications, Beijing 876, China, {miwei985, zhangch.bupt., qiuxiaofeng}@gmail.com
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 ISSN 2229-5518
International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 Load Balancing Heterogeneous Request in DHT-based P2P Systems Mrs. Yogita A. Dalvi Dr. R. Shankar Mr. Atesh
More informationLoad Balancing in Structured Overlay Networks. Tallat M. Shafaat tallat(@)kth.se
Load Balancing in Structured Overlay Networks Tallat M. Shafaat tallat(@)kth.se Overview Background The problem : load imbalance Causes of load imbalance Solutions But first, some slides from previous
More informationInternational journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer.
RESEARCH ARTICLE ISSN: 2321-7758 GLOBAL LOAD DISTRIBUTION USING SKIP GRAPH, BATON AND CHORD J.K.JEEVITHA, B.KARTHIKA* Information Technology,PSNA College of Engineering & Technology, Dindigul, India Article
More informationAchieving Resilient and Efficient Load Balancing in DHT-based P2P Systems
Achieving Resilient and Efficient Load Balancing in DHT-based P2P Systems Di Wu, Ye Tian and Kam-Wing Ng Department of Computer Science & Engineering The Chinese University of Hong Kong Shatin, N.T., Hong
More informationA Load Balancing Method in SiCo Hierarchical DHT-based P2P Network
1 Shuang Kai, 2 Qu Zheng *1, Shuang Kai Beijing University of Posts and Telecommunications, shuangk@bupt.edu.cn 2, Qu Zheng Beijing University of Posts and Telecommunications, buptquzheng@gmail.com Abstract
More informationAn Optimization Model of Load Balancing in P2P SIP Architecture
An Optimization Model of Load Balancing in P2P SIP Architecture 1 Kai Shuang, 2 Liying Chen *1, First Author, Corresponding Author Beijing University of Posts and Telecommunications, shuangk@bupt.edu.cn
More informationLoad Balancing in Structured P2P Systems
1 Load Balancing in Structured P2P Systems Ananth Rao Karthik Lakshminarayanan Sonesh Surana Richard Karp Ion Stoica ananthar, karthik, sonesh, karp, istoica @cs.berkeley.edu Abstract Most P2P systems
More informationLOAD BALANCING WITH PARTIAL KNOWLEDGE OF SYSTEM
LOAD BALANCING WITH PARTIAL KNOWLEDGE OF SYSTEM IN PEER TO PEER NETWORKS R. Vijayalakshmi and S. Muthu Kumarasamy Dept. of Computer Science & Engineering, S.A. Engineering College Anna University, Chennai,
More informationAn Efficient Distributed Load Balancing For DHT-Based P2P Systems
An Efficient Distributed Load Balancing For DHT-Based P2P Systems Chahita Taank 1, Rajesh Bharati 2 1 PG Student, 2 Professor, Computer Engineering Dept DYPIET, PUNE. Abstract- In a distributed system
More informationNew Structured P2P Network with Dynamic Load Balancing Scheme
New Structured P2P Network with Dynamic Load Balancing Scheme Atushi TAKEDA, Takuma OIDE and Akiko TAKAHASHI Department of Information Science, Tohoku Gakuin University Department of Information Engineering,
More informationLoad Balancing in Structured Peer to Peer Systems
Load Balancing in Structured Peer to Peer Systems DR.K.P.KALIYAMURTHIE 1, D.PARAMESWARI 2 Professor and Head, Dept. of IT, Bharath University, Chennai-600 073 1 Asst. Prof. (SG), Dept. of Computer Applications,
More informationVaralakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
More informationDept. of Computer Engg., Bhartia Vidyapeeth, Pune, India
The Server Reassignment Problem for Load Balancing In Structured Peer to Peer Systems 1 Sumit A. Hirve, 2 Dr. S.H. Patil 1,2 Dept. of Computer Engg., Bhartia Vidyapeeth, Pune, India Abstract Application-layer
More informationLoad Balancing in Structured Peer to Peer Systems
Load Balancing in Structured Peer to Peer Systems Dr.K.P.Kaliyamurthie 1, D.Parameswari 2 1.Professor and Head, Dept. of IT, Bharath University, Chennai-600 073. 2.Asst. Prof.(SG), Dept. of Computer Applications,
More informationARTICLE IN PRESS. Journal of Network and Computer Applications
Journal of Network and Computer Applications 32 (2009) 45 60 Contents lists available at ScienceDirect Journal of Network and Computer Applications journal homepage: www.elsevier.com/locate/jnca Resilient
More informationIMPACT OF DISTRIBUTED SYSTEMS IN MANAGING CLOUD APPLICATION
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE IMPACT OF DISTRIBUTED SYSTEMS IN MANAGING CLOUD APPLICATION N.Vijaya Sunder Sagar 1, M.Dileep Kumar 2, M.Nagesh 3, Lunavath Gandhi
More informationDesign and Implementation of Performance Guaranteed Symmetric Load Balancing Algorithm
Design and Implementation of Performance Guaranteed Symmetric Load Balancing Algorithm Shaik Nagoor Meeravali #1, R. Daniel *2, CH. Srinivasa Reddy #3 # M.Tech, Department of Information Technology, Vignan's
More informationIndex Terms : Load rebalance, distributed file systems, clouds, movement cost, load imbalance, chunk.
Load Rebalancing for Distributed File Systems in Clouds. Smita Salunkhe, S. S. Sannakki Department of Computer Science and Engineering KLS Gogte Institute of Technology, Belgaum, Karnataka, India Affiliated
More informationA Parameter-Free Load Balancing Mechanism For P2P Networks
A Parameter-Free Load Balancing Mechanism For P2P Networks Tyler Steele, Vivek Vishnumurthy and Paul Francis Department of Computer Science, Cornell University, Ithaca, NY 14853 {ths22,francis,vivi}@cs.cornell.edu
More informationD1.1 Service Discovery system: Load balancing mechanisms
D1.1 Service Discovery system: Load balancing mechanisms VERSION 1.0 DATE 2011 EDITORIAL MANAGER Eddy Caron AUTHORS STAFF Eddy Caron, Cédric Tedeschi Copyright ANR SPADES. 08-ANR-SEGI-025. Contents Introduction
More informationSurvey on Load Rebalancing for Distributed File System in Cloud
Survey on Load Rebalancing for Distributed File System in Cloud Prof. Pranalini S. Ketkar Ankita Bhimrao Patkure IT Department, DCOER, PG Scholar, Computer Department DCOER, Pune University Pune university
More informationA QoS-driven Resource Allocation Algorithm with Load balancing for
A QoS-driven Resource Allocation Algorithm with Load balancing for Device Management 1 Lanlan Rui, 2 Yi Zhou, 3 Shaoyong Guo State Key Laboratory of Networking and Switching Technology, Beijing University
More informationImproving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks
Improving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks Chin-Tser Huang, Prasanth Kalakota, Alexander B. Alexandrov Department of Computer Science and Engineering University
More informationComparison on Different Load Balancing Algorithms of Peer to Peer Networks
Comparison on Different Load Balancing Algorithms of Peer to Peer Networks K.N.Sirisha *, S.Bhagya Rekha M.Tech,Software Engineering Noble college of Engineering & Technology for Women Web Technologies
More informationSOLVING LOAD REBALANCING FOR DISTRIBUTED FILE SYSTEM IN CLOUD
International Journal of Advances in Applied Science and Engineering (IJAEAS) ISSN (P): 2348-1811; ISSN (E): 2348-182X Vol-1, Iss.-3, JUNE 2014, 54-58 IIST SOLVING LOAD REBALANCING FOR DISTRIBUTED FILE
More informationA Reputation Management System in Structured Peer-to-Peer Networks
A Reputation Management System in Structured Peer-to-Peer Networks So Young Lee, O-Hoon Kwon, Jong Kim and Sung Je Hong Dept. of Computer Science & Engineering, Pohang University of Science and Technology
More informationLocality-Aware Randomized Load Balancing Algorithms for DHT Networks
Locality-Aware ized Load Balancing Algorithms for DHT Networks Haiying Shen and Cheng-Zhong Xu Department of Electrical & Computer Engineering Wayne State University, Detroit, MI 4822 {shy,czxu}@ece.eng.wayne.edu
More informationInternational Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 3, May-June 2015
RESEARCH ARTICLE OPEN ACCESS Ensuring Reliability and High Availability in Cloud by Employing a Fault Tolerance Enabled Load Balancing Algorithm G.Gayathri [1], N.Prabakaran [2] Department of Computer
More informationObject Request Reduction in Home Nodes and Load Balancing of Object Request in Hybrid Decentralized Web Caching
2012 2 nd International Conference on Information Communication and Management (ICICM 2012) IPCSIT vol. 55 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V55.5 Object Request Reduction
More informationquery enabled P2P networks 2009. 08. 27 Park, Byunggyu
Load balancing mechanism in range query enabled P2P networks 2009. 08. 27 Park, Byunggyu Background Contents DHT(Distributed Hash Table) Motivation Proposed scheme Compression based Hashing Load balancing
More informationLoad Balancing in Dynamic Structured P2P Systems
Load Balancing in Dynamic Structured P2P Systems Brighten Godfrey Karthik Lakshminarayanan Sonesh Surana Richard Karp Ion Stoica {pbg, karthik, sonesh, karp, istoica}@cs.berkeley.edu Abstract Most P2P
More informationEnhance Load Rebalance Algorithm for Distributed File Systems in Clouds
Enhance Load Rebalance Algorithm for Distributed File Systems in Clouds Kokilavani.K, Department Of Pervasive Computing Technology, Kings College Of Engineering, Punalkulam, Tamil nadu Abstract This paper
More informationLoad Balancing in Distributed Systems: A survey
Load Balancing in Distributed Systems: A survey Amit S Hanamakkanavar * and Prof. Vidya S.Handur # * (amitsh2190@gmail.com) Dept of Computer Science & Engg, B.V.B.College of Engg. & Tech, Hubli # (vidya_handur@bvb.edu)
More informationChord - A Distributed Hash Table
Kurt Tutschku Vertretung - Professur Rechnernetze und verteilte Systeme Chord - A Distributed Hash Table Outline Lookup problem in Peer-to-Peer systems and Solutions Chord Algorithm Consistent Hashing
More informationIdentity Theft Protection in Structured Overlays
Identity Theft Protection in Structured Overlays Lakshmi Ganesh and Ben Y. Zhao Computer Science Department, U. C. Santa Barbara {lakshmi, ravenben}@cs.ucsb.edu Abstract Structured peer-to-peer (P2P) overlays
More informationINTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY
[Kavita, 2(4): April, 2013] ISSN: 2277-9655 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Histogram Based Live Streaming in Peer to Peer Dynamic Balancing & Clustering System
More informationA PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM
A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM Dr.S. DHANALAKSHMI 1, R. ANUPRIYA 2 1 Prof & Head, 2 Research Scholar Computer Science and Applications, Vivekanandha College of Arts and Sciences
More informationRESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT
RESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT Bilkent University 1 OUTLINE P2P computing systems Representative P2P systems P2P data management Incentive mechanisms Concluding remarks Bilkent University
More informationTornado: A Capability-Aware Peer-to-Peer Storage Network
Tornado: A Capability-Aware Peer-to-Peer Storage Network Hung-Chang Hsiao hsiao@pads1.cs.nthu.edu.tw Chung-Ta King* king@cs.nthu.edu.tw Department of Computer Science National Tsing Hua University Hsinchu,
More informationDUP: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks
: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks Liangzhong Yin and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University University Park, PA 16802
More informationDistributed file system in cloud based on load rebalancing algorithm
Distributed file system in cloud based on load rebalancing algorithm B.Mamatha(M.Tech) Computer Science & Engineering Boga.mamatha@gmail.com K Sandeep(M.Tech) Assistant Professor PRRM Engineering College
More informationIdentity Theft Protection in Structured Overlays
Appears in Proceedings of the 1st Workshop on Secure Network Protocols (NPSec 5) Identity Theft Protection in Structured Overlays Lakshmi Ganesh and Ben Y. Zhao Computer Science Department, U. C. Santa
More informationAnonymous Communication in Peer-to-Peer Networks for Providing more Privacy and Security
Anonymous Communication in Peer-to-Peer Networks for Providing more Privacy and Security Ehsan Saboori and Shahriar Mohammadi Abstract One of the most important issues in peer-to-peer networks is anonymity.
More informationSCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS *
SCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS * Maha Abdallah LIP6, Université Paris 6, rue du Capitaine Scott 75015 Paris, France Maha.Abdallah@lip6.fr Hung Cuong Le
More informationResearch on P2P-SIP based VoIP system enhanced by UPnP technology
December 2010, 17(Suppl. 2): 36 40 www.sciencedirect.com/science/journal/10058885 The Journal of China Universities of Posts and Telecommunications http://www.jcupt.com Research on P2P-SIP based VoIP system
More informationA Review on Efficient File Sharing in Clustered P2P System
A Review on Efficient File Sharing in Clustered P2P System Anju S Kumar 1, Ratheesh S 2, Manoj M 3 1 PG scholar, Dept. of Computer Science, College of Engineering Perumon, Kerala, India 2 Assisstant Professor,
More informationMulti-service Load Balancing in a Heterogeneous Network with Vertical Handover
1 Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover Jie Xu, Member, IEEE, Yuming Jiang, Member, IEEE, and Andrew Perkis, Member, IEEE Abstract In this paper we investigate
More informationA Service Revenue-oriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
More informationA Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks
1 A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks Hasan Sözer, Metin Tekkalmaz, and İbrahim Körpeoğlu Abstract File sharing in wireless ad-hoc networks in a peerto-peer manner imposes many
More informationA P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT
A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT CATALOGUES Lican Huang Institute of Network & Distributed Computing, Zhejiang Sci-Tech University, No.5, St.2, Xiasha Higher Education Zone, Hangzhou,
More informationNew Algorithms for Load Balancing in Peer-to-Peer Systems
New Algorithms for Load Balancing in Peer-to-Peer Systems David R. Karger Matthias Ruhl MIT Laboratory for Computer Science Cambridge, MA 02139, USA {karger, ruhl}@theory.lcs.mit.edu Abstract Load balancing
More informationA Topology-Aware Relay Lookup Scheme for P2P VoIP System
Int. J. Communications, Network and System Sciences, 2010, 3, 119-125 doi:10.4236/ijcns.2010.32018 Published Online February 2010 (http://www.scirp.org/journal/ijcns/). A Topology-Aware Relay Lookup Scheme
More informationJoin and Leave in Peer-to-Peer Systems: The DASIS Approach
Join and Leave in Peer-to-Peer Systems: The DASIS Approach Keno Albrecht, Ruedi Arnold, Michael Gähwiler, Roger Wattenhofer {kenoa@inf, rarnold@inf, mgaehwil@student, wattenhofer@inf}.ethz.ch Department
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Experimental
More informationKrunal Patel Department of Information Technology A.D.I.T. Engineering College (G.T.U.) India. Fig. 1 P2P Network
Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Secure Peer-to-Peer
More informationFigure 1. The cloud scales: Amazon EC2 growth [2].
- Chung-Cheng Li and Kuochen Wang Department of Computer Science National Chiao Tung University Hsinchu, Taiwan 300 shinji10343@hotmail.com, kwang@cs.nctu.edu.tw Abstract One of the most important issues
More informationDistributed Hash Tables in P2P Systems - A literary survey
Distributed Hash Tables in P2P Systems - A literary survey Timo Tanner Helsinki University of Technology tstanner@cc.hut.fi Abstract Distributed Hash Tables (DHT) are algorithms used in modern peer-to-peer
More informationLoad Balancing in Peer-to-Peer Data Networks
Load Balancing in Peer-to-Peer Data Networks David Novák Masaryk University, Brno, Czech Republic xnovak8@fi.muni.cz Abstract. One of the issues considered in all Peer-to-Peer Data Networks, or Structured
More informationLOAD BALANCING FOR OPTIMAL SHARING OF NETWORK BANDWIDTH
LOAD BALANCING FOR OPTIMAL SHARING OF NETWORK BANDWIDTH S.Hilda Thabitha 1, S.Pallavi 2, P.Jesu Jayarin 3 1 PG Scholar,,Dept of CSE,Jeppiaar Engineering College,Chennai, 2 Research Scholar,Sathyabama University,Chennai-119.
More informationWater-Filling: A Novel Approach of Load Rebalancing for File Systems in Cloud
Water-Filling: A Novel Approach of Load Rebalancing for File Systems in Cloud Divya Diwakar Department of Information Technology SATI College, Vidisha (M.P.), India Sushil Chaturvedi Department of Information
More informationQuality of Service Routing Network and Performance Evaluation*
Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,
More informationLoad Balancing on a Grid Using Data Characteristics
Load Balancing on a Grid Using Data Characteristics Jonathan White and Dale R. Thompson Computer Science and Computer Engineering Department University of Arkansas Fayetteville, AR 72701, USA {jlw09, drt}@uark.edu
More informationDECENTRALIZED LOAD BALANCING IN HETEROGENEOUS SYSTEMS USING DIFFUSION APPROACH
DECENTRALIZED LOAD BALANCING IN HETEROGENEOUS SYSTEMS USING DIFFUSION APPROACH P.Neelakantan Department of Computer Science & Engineering, SVCET, Chittoor pneelakantan@rediffmail.com ABSTRACT The grid
More informationPEER-TO-PEER (P2P) systems have emerged as an appealing
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 21, NO. 4, APRIL 2009 595 Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems Quang Hieu Vu, Member, IEEE, Beng Chin Ooi,
More informationCosts and Benefits of Reputation Management Systems
Costs and Benefits of Reputation Management Systems Roberto G. Cascella University of Trento Dipartimento di Ingegneria e Scienza dell Informazione Via Sommarive 14, I-381 Povo (TN), Italy cascella@disi.unitn.it
More informationSecured Load Rebalancing for Distributed Files System in Cloud
Secured Load Rebalancing for Distributed Files System in Cloud Jayesh D. Kamble 1, Y. B. Gurav 2 1 II nd Year ME, Department of Computer Engineering, PVPIT, Savitribai Phule Pune University, Pune, India
More informationHow To Balance In Cloud Computing
A Review on Load Balancing Algorithms in Cloud Hareesh M J Dept. of CSE, RSET, Kochi hareeshmjoseph@ gmail.com John P Martin Dept. of CSE, RSET, Kochi johnpm12@gmail.com Yedhu Sastri Dept. of IT, RSET,
More information8 Conclusion and Future Work
8 Conclusion and Future Work This chapter concludes this thesis and provides an outlook on future work in the area of mobile ad hoc networks and peer-to-peer overlay networks 8.1 Conclusion Due to the
More informationA Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster
, pp.11-20 http://dx.doi.org/10.14257/ ijgdc.2014.7.2.02 A Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster Kehe Wu 1, Long Chen 2, Shichao Ye 2 and Yi Li 2 1 Beijing
More informationTraceroute-Based Topology Inference without Network Coordinate Estimation
Traceroute-Based Topology Inference without Network Coordinate Estimation Xing Jin, Wanqing Tu Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water
More informationReal Time Network Server Monitoring using Smartphone with Dynamic Load Balancing
www.ijcsi.org 227 Real Time Network Server Monitoring using Smartphone with Dynamic Load Balancing Dhuha Basheer Abdullah 1, Zeena Abdulgafar Thanoon 2, 1 Computer Science Department, Mosul University,
More informationLoad Balancing in Dynamic Structured P2P System
Load Balancing in Dynamic Structured P2P System B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, I. Stoica Ankit Pat November 19, 2013. Godfrey, K. Lakshminarayanan, S. Surana, Load R. Balancing Karp,
More informationBounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables
Bounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables Marcin Bienkowski 1 and Miroslaw Korzeniowski 2 1 Institute of Computer Science, University of Wroclaw, Poland. mbi@ii.uni.wroc.pl
More informationGISP: Global Information Sharing Protocol a distributed index for peer-to-peer systems
GISP: Global Information Sharing Protocol a distributed index for peer-to-peer systems Daishi Kato Computer Science Department, Stanford University Visiting from NEC Corporation Abstract This paper proposes
More informationPROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS
PROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS Hongye Fu, Naoki Wakamiya, Masayuki Murata Graduate School of Information Science and Technology Osaka University
More informationLoad Balancing for Improved Quality of Service in the Cloud
Load Balancing for Improved Quality of Service in the Cloud AMAL ZAOUCH Mathématique informatique et traitement de l information Faculté des Sciences Ben M SIK CASABLANCA, MORROCO FAOUZIA BENABBOU Mathématique
More informationRESEARCH PAPER International Journal of Recent Trends in Engineering, Vol 1, No. 1, May 2009
An Algorithm for Dynamic Load Balancing in Distributed Systems with Multiple Supporting Nodes by Exploiting the Interrupt Service Parveen Jain 1, Daya Gupta 2 1,2 Delhi College of Engineering, New Delhi,
More informationCS5412: TIER 2 OVERLAYS
1 CS5412: TIER 2 OVERLAYS Lecture VI Ken Birman Recap 2 A week ago we discussed RON and Chord: typical examples of P2P network tools popular in the cloud Then we shifted attention and peeked into the data
More informationSecure Communication in a Distributed System Using Identity Based Encryption
Secure Communication in a Distributed System Using Identity Based Encryption Tyron Stading IBM, Austin, Texas 78758, USA tjstadin@us.ibm.com Abstract Distributed systems require the ability to communicate
More informationA Survey Of Various Load Balancing Algorithms In Cloud Computing
A Survey Of Various Load Balancing Algorithms In Cloud Computing Dharmesh Kashyap, Jaydeep Viradiya Abstract: Cloud computing is emerging as a new paradigm for manipulating, configuring, and accessing
More informationAn Energy Efficient Location Service for Mobile Ad Hoc Networks
An Energ Efficient Location Service for Mobile Ad Hoc Networks Zijian Wang 1, Euphan Bulut 1 and Boleslaw K. Szmanski 1, 1 Department of Computer Science, Rensselaer Poltechnic Institute, Tro, NY 12180
More informationStorage Systems Autumn 2009. Chapter 6: Distributed Hash Tables and their Applications André Brinkmann
Storage Systems Autumn 2009 Chapter 6: Distributed Hash Tables and their Applications André Brinkmann Scaling RAID architectures Using traditional RAID architecture does not scale Adding news disk implies
More informationEFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK
EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK S.Abarna 1, R.Padmapriya 2 1 Mphil Scholar, 2 Assistant Professor, Department of Computer Science,
More informationUsing Peer to Peer Dynamic Querying in Grid Information Services
Using Peer to Peer Dynamic Querying in Grid Information Services Domenico Talia and Paolo Trunfio DEIS University of Calabria HPC 2008 July 2, 2008 Cetraro, Italy Using P2P for Large scale Grid Information
More informationPeer to Peer Networks A Review & Study on Load Balancing
Peer to Peer Networks A Review & Study on Load Balancing E.Mahender, Mr.B.Hari Krishna, Mr.K. OBULESH, Mrs.M.Shireesha Abstract - Peer-to-peer (P2P) systems increase the popularity and have become a dominant
More informationOptimal Service Pricing for a Cloud Cache
Optimal Service Pricing for a Cloud Cache K.SRAVANTHI Department of Computer Science & Engineering (M.Tech.) Sindura College of Engineering and Technology Ramagundam,Telangana G.LAKSHMI Asst. Professor,
More informationLOOKING UP DATA IN P2P SYSTEMS
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, Ion Stoica MIT Laboratory for Computer Science 1. Introduction The recent success of some widely deployed
More informationProposal of Dynamic Load Balancing Algorithm in Grid System
www.ijcsi.org 186 Proposal of Dynamic Load Balancing Algorithm in Grid System Sherihan Abu Elenin Faculty of Computers and Information Mansoura University, Egypt Abstract This paper proposed dynamic load
More informationA Novel Load Balancing Optimization Algorithm Based on Peer-to-Peer
A Novel Load Balancing Optimization Algorithm Based on Peer-to-Peer Technology in Streaming Media College of Computer Science, South-Central University for Nationalities, Wuhan 430074, China shuwanneng@yahoo.com.cn
More informationImplementation of a Lightweight Service Advertisement and Discovery Protocol for Mobile Ad hoc Networks
Implementation of a Lightweight Advertisement and Discovery Protocol for Mobile Ad hoc Networks Wenbin Ma * Department of Electrical and Computer Engineering 19 Memorial Drive West, Lehigh University Bethlehem,
More informationHeterogeneity and Load Balance in Distributed Hash Tables
Heterogeneity and Load Balance in Distributed Hash Tables P. Brighten Godfrey and Ion Stoica Computer Science Division, University of California, Berkeley {pbg,istoica}@cs.berkeley.edu Abstract Existing
More informationThe Probabilistic Model of Cloud Computing
A probabilistic multi-tenant model for virtual machine mapping in cloud systems Zhuoyao Wang, Majeed M. Hayat, Nasir Ghani, and Khaled B. Shaban Department of Electrical and Computer Engineering, University
More informationA Deduplication-based Data Archiving System
2012 International Conference on Image, Vision and Computing (ICIVC 2012) IPCSIT vol. 50 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V50.20 A Deduplication-based Data Archiving System
More informationQUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES
QUALITY OF SERVICE METRICS FOR DATA TRANSMISSION IN MESH TOPOLOGIES SWATHI NANDURI * ZAHOOR-UL-HUQ * Master of Technology, Associate Professor, G. Pulla Reddy Engineering College, G. Pulla Reddy Engineering
More informationA Survey on Load Balancing Techniques Using ACO Algorithm
A Survey on Load Balancing Techniques Using ACO Algorithm Preeti Kushwah Department of Computer Science & Engineering, Acropolis Institute of Technology and Research Indore bypass road Mangliya square
More informationA NEW FULLY DECENTRALIZED SCALABLE PEER-TO-PEER GIS ARCHITECTURE
A NEW FULLY DECENTRALIZED SCALABLE PEER-TO-PEER GIS ARCHITECTURE S.H.L. Liang Department of Geomatics Engineering, University of Calgary, Calgary, Alberta, CANADA T2N 1N4 steve.liang@ucalgary.ca Commission
More informationCooperative Monitoring for Internet Data Centers
Cooperative Monitoring for Internet Data Centers Kuai Xu Feng Wang Arizona State University Division of Mathematical and Natural Sciences New College of Interdisciplinary Arts & Sciences P.O. Box 371,
More informationWeb Email DNS Peer-to-peer systems (file sharing, CDNs, cycle sharing)
1 1 Distributed Systems What are distributed systems? How would you characterize them? Components of the system are located at networked computers Cooperate to provide some service No shared memory Communication
More informationA Novel Approach for Load Balancing In Heterogeneous Cellular Network
A Novel Approach for Load Balancing In Heterogeneous Cellular Network Bittu Ann Mathew1, Sumy Joseph2 PG Scholar, Dept of Computer Science, Amal Jyothi College of Engineering, Kanjirappally, Kerala, India1
More information