Design and routing algorithm of PPCAN

Wei Gao; Guoyin Zhang; Yanmei Li

doi:10.1109/ICICSE.2009.67

Design and routing algorithm of PPCAN

Wei Gao^*
, Guoyin Zhang
, Yanmei Li

^*Corresponding author for this work

Harbin Engineering University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

After we analyzed the existing DHT networks, we propose a novel CAN, called PPCAN. The improved-CAN adopts 2-D polar coordinates and a power series expansion subspace hops to obtain a high routing efficiency with a lower maintenance cost. We introduce the associated landmarks help optimize the relay sequenced peers through the hops. Our architecture can be implemented at an application level. Some improved routing algorithms based CAN can also be implemented in PPCAN.

Original language	English
Title of host publication	Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009
Publisher	IEEE Computer Society
Pages	118-121
Number of pages	4
ISBN (Print)	9780769540276
DOIs	https://doi.org/10.1109/ICICSE.2009.67
State	Published - 2009
Externally published	Yes

Publication series

Name	Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009

Keywords

CAN
P2P
Routing algorithm

Access to Document

10.1109/ICICSE.2009.67

Cite this

Gao, W., Zhang, G., & Li, Y. (2009). Design and routing algorithm of PPCAN. In Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009 (pp. 118-121). Article 5521621 (Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009). IEEE Computer Society. https://doi.org/10.1109/ICICSE.2009.67

@inproceedings{b22e773379274369aa182e3063f85ee2,

title = "Design and routing algorithm of PPCAN",

abstract = "After we analyzed the existing DHT networks, we propose a novel CAN, called PPCAN. The improved-CAN adopts 2-D polar coordinates and a power series expansion subspace hops to obtain a high routing efficiency with a lower maintenance cost. We introduce the associated landmarks help optimize the relay sequenced peers through the hops. Our architecture can be implemented at an application level. Some improved routing algorithms based CAN can also be implemented in PPCAN.",

keywords = "CAN, P2P, Routing algorithm",

author = "Wei Gao and Guoyin Zhang and Yanmei Li",

year = "2009",

doi = "10.1109/ICICSE.2009.67",

language = "英语",

isbn = "9780769540276",

series = "Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009",

publisher = "IEEE Computer Society",

pages = "118--121",

booktitle = "Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009",

address = "美国",

}

Gao, W, Zhang, G & Li, Y 2009, Design and routing algorithm of PPCAN. in Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009., 5521621, Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009, IEEE Computer Society, pp. 118-121. https://doi.org/10.1109/ICICSE.2009.67

Design and routing algorithm of PPCAN. / Gao, Wei; Zhang, Guoyin; Li, Yanmei.
Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009. IEEE Computer Society, 2009. p. 118-121 5521621 (Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Design and routing algorithm of PPCAN

AU - Gao, Wei

AU - Zhang, Guoyin

AU - Li, Yanmei

PY - 2009

Y1 - 2009

N2 - After we analyzed the existing DHT networks, we propose a novel CAN, called PPCAN. The improved-CAN adopts 2-D polar coordinates and a power series expansion subspace hops to obtain a high routing efficiency with a lower maintenance cost. We introduce the associated landmarks help optimize the relay sequenced peers through the hops. Our architecture can be implemented at an application level. Some improved routing algorithms based CAN can also be implemented in PPCAN.

AB - After we analyzed the existing DHT networks, we propose a novel CAN, called PPCAN. The improved-CAN adopts 2-D polar coordinates and a power series expansion subspace hops to obtain a high routing efficiency with a lower maintenance cost. We introduce the associated landmarks help optimize the relay sequenced peers through the hops. Our architecture can be implemented at an application level. Some improved routing algorithms based CAN can also be implemented in PPCAN.

KW - CAN

KW - P2P

KW - Routing algorithm

UR - https://www.scopus.com/pages/publications/77958591024

U2 - 10.1109/ICICSE.2009.67

DO - 10.1109/ICICSE.2009.67

M3 - 会议稿件

AN - SCOPUS:77958591024

SN - 9780769540276

T3 - Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009

SP - 118

EP - 121

BT - Proceedings - 4th International Conference on Internet Computing for Science and Engineering, ICICSE 2009

PB - IEEE Computer Society

ER -

Design and routing algorithm of PPCAN

Abstract

Publication series

Keywords

Access to Document

Other files and links

Fingerprint

Cite this