Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space

Load-balancing in existing P2P technologies is still not ideally solved, such as low load-balancing degree and excess assumption conditions and so on. Here an improved load-balancing algorithm is presented. The algorithm assigns rational ID address space that can be dynamically regulated to every pe...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhitang Li, Chuiwei Lu, Yejiang Zhang
Format: Conference Proceeding
Language:English
Subjects:
Automatic control
Bandwidth
Computer networks
Costs
Delay
Lighting control
Load balancing
Load management
Network servers
P2P
Peer to peer computing
Ring address
Space technology
Virtual servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 403
container_issue
container_start_page 400
container_title
container_volume 1
creator Zhitang Li
Chuiwei Lu
Yejiang Zhang
description Load-balancing in existing P2P technologies is still not ideally solved, such as low load-balancing degree and excess assumption conditions and so on. Here an improved load-balancing algorithm is presented. The algorithm assigns rational ID address space that can be dynamically regulated to every peer based on its load capacity. In addition, the improved algorithm also adopts flow control mechanism, which can automatically select light-load peers with low delay and high bandwidth for load transfer. The simulation experiments demonstrate the improved algorithm owns faster velocity of load-balancing and less cost on load-transfer compared to traditional Chord protocol. Furthermore, the improved algorithm can maintain high load-balancing degree even under the condition of heavy network load, and has no particular requirement to the property of peers.
doi_str_mv 10.1109/ITCS.2009.286
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5190096</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5190096</ieee_id><sourcerecordid>5190096</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-eb56b30a7a078e42846319fbf703f185d1a79d3418edfe9eaddf0db4d6705c0c3</originalsourceid><addsrcrecordid>eNotj0tLw0AURgekoK1dunIzfyD1TibzWrbxVahabF2Xm8wdO1qTkgmU_ntbdPXB4XDgY-xGwEQIcHfzdbma5ABuklt9wYZgtFNSWysHbHjmDnLjxCUbp_QFAMJpo3J3xTbvlAi7esvbwBct-myGO2zq2Hzy2PBlvuSv1B_a7pvPMJHnbcNfsK-3Z-Hs8xL3WMf-yA-x3_L5PZ9631FKfHXidM0GAXeJxv87Yh-PD-vyOVu8Pc3L6SKLwqg-o0rpSgIaBGOpyG2hpXChCgZkEFZ5gcZ5WQhLPpAj9D6ArwqvDagaajlit3_dSESbfRd_sDtulHCn71r-AutQUrg</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Zhitang Li ; Chuiwei Lu ; Yejiang Zhang</creator><creatorcontrib>Zhitang Li ; Chuiwei Lu ; Yejiang Zhang</creatorcontrib><description>Load-balancing in existing P2P technologies is still not ideally solved, such as low load-balancing degree and excess assumption conditions and so on. Here an improved load-balancing algorithm is presented. The algorithm assigns rational ID address space that can be dynamically regulated to every peer based on its load capacity. In addition, the improved algorithm also adopts flow control mechanism, which can automatically select light-load peers with low delay and high bandwidth for load transfer. The simulation experiments demonstrate the improved algorithm owns faster velocity of load-balancing and less cost on load-transfer compared to traditional Chord protocol. Furthermore, the improved algorithm can maintain high load-balancing degree even under the condition of heavy network load, and has no particular requirement to the property of peers.</description><identifier>ISBN: 0769536883</identifier><identifier>ISBN: 9780769536880</identifier><identifier>DOI: 10.1109/ITCS.2009.286</identifier><identifier>LCCN: 2009902791</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automatic control ; Bandwidth ; Computer networks ; Costs ; Delay ; Lighting control ; Load balancing ; Load management ; Network servers ; P2P ; Peer to peer computing ; Ring address ; Space technology ; Virtual servers</subject><ispartof>2009 International Conference on Information Technology and Computer Science, 2009, Vol.1, p.400-403</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5190096$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2053,27907,54902</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5190096$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhitang Li</creatorcontrib><creatorcontrib>Chuiwei Lu</creatorcontrib><creatorcontrib>Yejiang Zhang</creatorcontrib><title>Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space</title><title>2009 International Conference on Information Technology and Computer Science</title><addtitle>ITCS</addtitle><description>Load-balancing in existing P2P technologies is still not ideally solved, such as low load-balancing degree and excess assumption conditions and so on. Here an improved load-balancing algorithm is presented. The algorithm assigns rational ID address space that can be dynamically regulated to every peer based on its load capacity. In addition, the improved algorithm also adopts flow control mechanism, which can automatically select light-load peers with low delay and high bandwidth for load transfer. The simulation experiments demonstrate the improved algorithm owns faster velocity of load-balancing and less cost on load-transfer compared to traditional Chord protocol. Furthermore, the improved algorithm can maintain high load-balancing degree even under the condition of heavy network load, and has no particular requirement to the property of peers.</description><subject>Automatic control</subject><subject>Bandwidth</subject><subject>Computer networks</subject><subject>Costs</subject><subject>Delay</subject><subject>Lighting control</subject><subject>Load balancing</subject><subject>Load management</subject><subject>Network servers</subject><subject>P2P</subject><subject>Peer to peer computing</subject><subject>Ring address</subject><subject>Space technology</subject><subject>Virtual servers</subject><isbn>0769536883</isbn><isbn>9780769536880</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotj0tLw0AURgekoK1dunIzfyD1TibzWrbxVahabF2Xm8wdO1qTkgmU_ntbdPXB4XDgY-xGwEQIcHfzdbma5ABuklt9wYZgtFNSWysHbHjmDnLjxCUbp_QFAMJpo3J3xTbvlAi7esvbwBct-myGO2zq2Hzy2PBlvuSv1B_a7pvPMJHnbcNfsK-3Z-Hs8xL3WMf-yA-x3_L5PZ9631FKfHXidM0GAXeJxv87Yh-PD-vyOVu8Pc3L6SKLwqg-o0rpSgIaBGOpyG2hpXChCgZkEFZ5gcZ5WQhLPpAj9D6ArwqvDagaajlit3_dSESbfRd_sDtulHCn71r-AutQUrg</recordid><startdate>200907</startdate><enddate>200907</enddate><creator>Zhitang Li</creator><creator>Chuiwei Lu</creator><creator>Yejiang Zhang</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200907</creationdate><title>Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space</title><author>Zhitang Li ; Chuiwei Lu ; Yejiang Zhang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-eb56b30a7a078e42846319fbf703f185d1a79d3418edfe9eaddf0db4d6705c0c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Automatic control</topic><topic>Bandwidth</topic><topic>Computer networks</topic><topic>Costs</topic><topic>Delay</topic><topic>Lighting control</topic><topic>Load balancing</topic><topic>Load management</topic><topic>Network servers</topic><topic>P2P</topic><topic>Peer to peer computing</topic><topic>Ring address</topic><topic>Space technology</topic><topic>Virtual servers</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhitang Li</creatorcontrib><creatorcontrib>Chuiwei Lu</creatorcontrib><creatorcontrib>Yejiang Zhang</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhitang Li</au><au>Chuiwei Lu</au><au>Yejiang Zhang</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space</atitle><btitle>2009 International Conference on Information Technology and Computer Science</btitle><stitle>ITCS</stitle><date>2009-07</date><risdate>2009</risdate><volume>1</volume><spage>400</spage><epage>403</epage><pages>400-403</pages><isbn>0769536883</isbn><isbn>9780769536880</isbn><abstract>Load-balancing in existing P2P technologies is still not ideally solved, such as low load-balancing degree and excess assumption conditions and so on. Here an improved load-balancing algorithm is presented. The algorithm assigns rational ID address space that can be dynamically regulated to every peer based on its load capacity. In addition, the improved algorithm also adopts flow control mechanism, which can automatically select light-load peers with low delay and high bandwidth for load transfer. The simulation experiments demonstrate the improved algorithm owns faster velocity of load-balancing and less cost on load-transfer compared to traditional Chord protocol. Furthermore, the improved algorithm can maintain high load-balancing degree even under the condition of heavy network load, and has no particular requirement to the property of peers.</abstract><pub>IEEE</pub><doi>10.1109/ITCS.2009.286</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769536883
ispartof 2009 International Conference on Information Technology and Computer Science, 2009, Vol.1, p.400-403
issn
language eng
recordid cdi_ieee_primary_5190096
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Automatic control
Bandwidth
Computer networks
Costs
Delay
Lighting control
Load balancing
Load management
Network servers
P2P
Peer to peer computing
Ring address
Space technology
Virtual servers
title Research of Load-Balancing in P2P Network Based on Matching Load Capacity with ID Address Space
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T08%3A24%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Research%20of%20Load-Balancing%20in%20P2P%20Network%20Based%20on%20Matching%20Load%20Capacity%20with%20ID%20Address%20Space&rft.btitle=2009%20International%20Conference%20on%20Information%20Technology%20and%20Computer%20Science&rft.au=Zhitang%20Li&rft.date=2009-07&rft.volume=1&rft.spage=400&rft.epage=403&rft.pages=400-403&rft.isbn=0769536883&rft.isbn_list=9780769536880&rft_id=info:doi/10.1109/ITCS.2009.286&rft_dat=%3Cieee_6IE%3E5190096%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-eb56b30a7a078e42846319fbf703f185d1a79d3418edfe9eaddf0db4d6705c0c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5190096&rfr_iscdi=true