Presentation 2010-01-22
Decreasing measurement conflict on overlay networks based on randomized algorithms
Go HASEGAWA, Masayuki MURATA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this report, we propose a randomized algorithm to decrease measurement conflicts in overlay network. The proposed algorithm is based on the number of overlay paths which share some router-level links in their route and determine the measurement timing in a random fashion. By simulation experiments with some network topologies, we present that the proposed mechanism can increase the successful measurements while decreasing measurement conflicts, regardless of the network topologies and overlay node density.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Overlay networks / network measurement / route / probabilistic method
Paper # ICM2009-39
Date of Issue

Conference Information
Committee ICM
Conference Date 2010/1/14(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 Information and Communication Management(ICM)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Decreasing measurement conflict on overlay networks based on randomized algorithms
Sub Title (in English)
Keyword(1) Overlay networks
Keyword(2) network measurement
Keyword(3) route
Keyword(4) probabilistic method
1st Author's Name Go HASEGAWA
1st Author's Affiliation Cybermedia Center, Osaka University()
2nd Author's Name Masayuki MURATA
2nd Author's Affiliation Graduate School of Information Science and Technology, Osaka University
Date 2010-01-22
Paper # ICM2009-39
Volume (vol) vol.109
Number (no) 378
Page pp.pp.-
#Pages 6
Date of Issue