Presentation 1999/12/17
Path Accommodation Methods for the Bidirectional Ring with Optical Compression TDM
Kazuhiro Gokyu, Ken-ichi Baba, Masayuki Murata,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose path accommodation methods for bidirectional rings based on an optical compression TDM (OCTDM) technology. We first derive a theoretical lower bound on the numbers of slots and frames in order to allocate all paths among nodes. The relationships between the lower bound and such parameters as the compression rate and the numbers of transmitters/receivers are then discussed. Three path accommodation algorithms are next proposed to achieve the lower bound as close as possible. Through numerical examples, we show that each of three algorithms has parameter regions achieving the best results. Our recommendation is therefore that three algorithm are all performed, then the best one should be chosen.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Optical Compression TDM / Path Accommodation Method / Optical Bidirectional Ring Network / Theoretical lower bound
Paper # SSE99-130
Date of Issue

Conference Information
Committee SSE
Conference Date 1999/12/17(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 Switching Systems Engineering (SSE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Path Accommodation Methods for the Bidirectional Ring with Optical Compression TDM
Sub Title (in English)
Keyword(1) Optical Compression TDM
Keyword(2) Path Accommodation Method
Keyword(3) Optical Bidirectional Ring Network
Keyword(4) Theoretical lower bound
1st Author's Name Kazuhiro Gokyu
1st Author's Affiliation Department of Informatics and Mathematical Science Graduate School of Engineering Science, Osaka University()
2nd Author's Name Ken-ichi Baba
2nd Author's Affiliation Computation Center, Osaka University
3rd Author's Name Masayuki Murata
3rd Author's Affiliation Department of Informatics and Mathematical Science Graduate School of Engineering Science, Osaka University
Date 1999/12/17
Paper # SSE99-130
Volume (vol) vol.99
Number (no) 507
Page pp.pp.-
#Pages 6
Date of Issue