Presentation 2009-04-16
A Study on Deterministic End-to-End Delay Bounds with Sink-Tree Aggregation
Yosuke KANAI, Kenji NAKAGAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper disscusses on new deterministic delay bound analysis scheme which gives better accuracy than conventional ones in Diffserv network with sink-tree aggregation. At first, we review Network Calculus which is a basis of delay bound analysis and show Nakamura's bound, Lenzini's bound, and their characteristics. Secondly, we propose new alalysis scheme which combines the concept of Nakamura bound and Lenzini bound. We compare proposed bound with others by the simulation using NS-2 (Network Simulator-2) and confirmed accuracy of proposed scheme. Then for applying other topology we try to expand proposed bound.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Diffserv / Network Calculus / Delay Bound
Paper # NS2009-3
Date of Issue

Conference Information
Committee NS
Conference Date 2009/4/9(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) A Study on Deterministic End-to-End Delay Bounds with Sink-Tree Aggregation
Sub Title (in English)
Keyword(1) Diffserv
Keyword(2) Network Calculus
Keyword(3) Delay Bound
1st Author's Name Yosuke KANAI
1st Author's Affiliation Department of Electrical Engineering, Nagaoka University of Technology()
2nd Author's Name Kenji NAKAGAWA
2nd Author's Affiliation Department of Electrical Engineering, Nagaoka University of Technology
Date 2009-04-16
Paper # NS2009-3
Volume (vol) vol.109
Number (no) 3
Page pp.pp.-
#Pages 6
Date of Issue