Presentation 2005-04-22
Efficient Message Flooding Based on Unidirectional Link Cut
Kenji OHTSUKA, Taku ISHIHARA, Shigeo SHIODA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose two techniques for efficient message flooding in computer networks. Both proposals convert all both-way links into directed ones in advance so as to reduce the load of message delivery to half. One proposal randomly determines the direction of links and the other determines the direction based on the information about number of degrees of each node. Both proposals use the timeout transaction to keep reachability at 100%. We show that our techniques can reduce the load of message delivery while keeping the time for message delivery at reasonable length of time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) flooding / P2P / number of degrees / message / timeout
Paper # NS2005-15
Date of Issue

Conference Information
Committee NS
Conference Date 2005/4/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Network Systems(NS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficient Message Flooding Based on Unidirectional Link Cut
Sub Title (in English)
Keyword(1) flooding
Keyword(2) P2P
Keyword(3) number of degrees
Keyword(4) message
Keyword(5) timeout
1st Author's Name Kenji OHTSUKA
1st Author's Affiliation Urban Environment & Systems, Faculty of Engineering, Chiba University()
2nd Author's Name Taku ISHIHARA
2nd Author's Affiliation Urban Environment & Systems, Faculty of Engineering, Chiba University
3rd Author's Name Shigeo SHIODA
3rd Author's Affiliation Urban Environment & Systems, Faculty of Engineering, Chiba University
Date 2005-04-22
Paper # NS2005-15
Volume (vol) vol.105
Number (no) 13
Page pp.pp.-
#Pages 4
Date of Issue