Presentation 2008-03-06
Routing Algorithms Considering Delay Constraints in Multiple Flow Environments
Koichi SARASHIYA, Toyofumi TAKENAKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) As a network becomes high-speed and broadband, streaming services such as audio and video have gained great popularity and services such as HDTV are expected to be in commerce in near future in the Internet. These services require strict delay constraint to prevent their service quality from being deteriorated. This paper proposes CSPF (Constraint Shortest Path Fast) algorithms which satisfy delay constraint and make route as optimal as possible by using empty wavelength information as the cost function. We also show the effectiveness of our proposed CSPF algorithms by simulation experiments.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Delay / Constrained / CSPF / Routing algorithm
Paper # NS2007-147
Date of Issue

Conference Information
Committee NS
Conference Date 2008/2/28(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) Routing Algorithms Considering Delay Constraints in Multiple Flow Environments
Sub Title (in English)
Keyword(1) Delay
Keyword(2) Constrained
Keyword(3) CSPF
Keyword(4) Routing algorithm
1st Author's Name Koichi SARASHIYA
1st Author's Affiliation Graduate School of Engineering, Nihon Univ.()
2nd Author's Name Toyofumi TAKENAKA
2nd Author's Affiliation Graduate School of Engineering, Nihon Univ.
Date 2008-03-06
Paper # NS2007-147
Volume (vol) vol.107
Number (no) 524
Page pp.pp.-
#Pages 4
Date of Issue