|
DDC
| 005 |
|
Tác giả CN
| Nguyễn, Đình Nghĩa |
|
Nhan đề
| Congestion control algorithm for messagerouting in structured peer - to - peer network / Nguyễn Đình Nghĩa, Nguyễn Hoài Sơn |
|
Mô tả vật lý
| 15 p. |
|
Tóm tắt
| ln structured peer-to-peer (P2P) networks. every node must perform message routing to deliver query messages to destination nodes. Therefore they often have to process a large number of query messages quickly and efficiently . When the number of query messages sending to a node exceeds its routing capacity a local congestion on the node occurs and reduces the information processing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through congested nodes. The performance of the proposed the method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process. |
|
Từ khóa tự do
| Thuật toán |
|
Từ khóa tự do
| Algorithm |
|
Từ khóa tự do
| Cấu trúc mạng |
|
Từ khóa tự do
| Messagerouting |
|
Từ khóa tự do
| Networks |
|
Từ khóa tự do
| Structured |
|
Tác giả(bs) CN
| Nguyễn, Hoài Sơn |
|
Nguồn trích
| Tạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics 2018Page 145 - 159
Số: 02
Tập: 34 |
|
|
000
| 00000nab#a2200000ui#4500 |
|---|
| 001 | 21469 |
|---|
| 002 | 9 |
|---|
| 004 | BC0AF1C0-0DBD-4EFF-A860-C9B0F6930445 |
|---|
| 005 | 202006011121 |
|---|
| 008 | 081223s vm| vie |
|---|
| 009 | 1 0 |
|---|
| 039 | |y20200601112124|zbacntp |
|---|
| 082 | |a005 |
|---|
| 100 | |aNguyễn, Đình Nghĩa |
|---|
| 245 | |aCongestion control algorithm for messagerouting in structured peer - to - peer network / |cNguyễn Đình Nghĩa, Nguyễn Hoài Sơn |
|---|
| 300 | |a15 p. |
|---|
| 520 | |aln structured peer-to-peer (P2P) networks. every node must perform message routing to deliver query messages to destination nodes. Therefore they often have to process a large number of query messages quickly and efficiently . When the number of query messages sending to a node exceeds its routing capacity a local congestion on the node occurs and reduces the information processing of the other nodes in the network. This paper proposes a congestion control algorithm for message routing in structured P2P networks by changing the routing table of nodes in the network to route the packet to the destination without going through congested nodes. The performance of the proposed the method has been evaluated and compared with the conventional Chord protocol. The result shows that our proposed method improves the query success rate significantly while minimizing the number of packets generated during congestion control process. |
|---|
| 653 | |aThuật toán |
|---|
| 653 | |aAlgorithm |
|---|
| 653 | |aCấu trúc mạng |
|---|
| 653 | |aMessagerouting |
|---|
| 653 | |aNetworks |
|---|
| 653 | |aStructured |
|---|
| 700 | |aNguyễn, Hoài Sơn |
|---|
| 773 | |tTạp chí Tin học và Điều khiển học = Journal of Computer Science And Cybernetics |d2018|gPage 145 - 159|v34|i02 |
|---|
| 890 | |c0|a0|b0|d0 |
|---|
|
|
Không tìm thấy biểu ghi nào
Không có liên kết tài liệu số nào