Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/69437
DC Field | Value | |
---|---|---|
dc.title | Application-level multicast using DINPeer in P2P networks | |
dc.contributor.author | Guo, H. | |
dc.contributor.author | Ngoh, L.H. | |
dc.contributor.author | Wong, W.C. | |
dc.date.accessioned | 2014-06-19T03:00:41Z | |
dc.date.available | 2014-06-19T03:00:41Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Guo, H.,Ngoh, L.H.,Wong, W.C. (2005). Application-level multicast using DINPeer in P2P networks. Lecture Notes in Computer Science 3421 (II) : 754-761. ScholarBank@NUS Repository. | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/69437 | |
dc.description.abstract | In this paper, we propose a DINPeer middleware to overcome limitations in current peer-to-peer (P2P) overlay systems. DINPeer exploits a spiral-ring method to discover an inner ring with relative largest bandwidth to form a DINloop (Data-in-Network loop). DINPeer further integrates DINloop with P2P overlay network. The key features of DINPeer include using DINloop to replace a multicast rendezvous point and turning DINloop into a cache to achieve application data persistency. Simulations show that DINPeer is able to optimize application-level multicast that when the size of the DINloop is capped within a limit, it can achieve a better performance than native IP multicast and P2P overlay multicast systems. © Springer-Verlag Berlin Heidelberg 2005. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.description.sourcetitle | Lecture Notes in Computer Science | |
dc.description.volume | 3421 | |
dc.description.issue | II | |
dc.description.page | 754-761 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.