Presentation 2006-10-20
Number of Attempts till Discovery Completion for GE-PON and GE-OSAN
Hiromi UEDA, Tetsuya SOFUE, Toshinori TSUBOI, Hiroyuki KASAI, Takumi NOMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) OLT needs to discover ONUs connected newly in the Gigabit Ethernet Passive Optical Network (GE-PON) and our proposed Gigabit Ethernet Optical Switched Access Network (GE-OSAN); OLT measures round trip times between OLT and them and then assigns a Logical Link Identifier (LLID) to them. In this discovery, REGISTER_ACK messages that they sent in response to a discovery GATE message from OLT may collide with each other at passive optical splitters. To decrease this collision probability, each of them sends a REGISTER_ACK message at time when it adds a random delay time to the grand start time given by the discovery GATE message. This paper evaluates the relationship between the maximum value of random delay time and the number of attempts expected to be taken to register all ONUs for GE-PON using computer simulations, and then presents the suitable value of the maximum delay time. Based on the results, this paper also clarifies those for GE-OSAN.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) GE-PON / GE-OSAN / Discovery / ranging / random delay
Paper # CS2006-42
Date of Issue

Conference Information
Committee CS
Conference Date 2006/10/12(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 Communication Systems (CS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Number of Attempts till Discovery Completion for GE-PON and GE-OSAN
Sub Title (in English)
Keyword(1) GE-PON
Keyword(2) GE-OSAN
Keyword(3) Discovery
Keyword(4) ranging
Keyword(5) random delay
1st Author's Name Hiromi UEDA
1st Author's Affiliation School of Computer Science, Tokyo University of Technology()
2nd Author's Name Tetsuya SOFUE
2nd Author's Affiliation School of Computer Science, Tokyo University of Technology
3rd Author's Name Toshinori TSUBOI
3rd Author's Affiliation School of Computer Science, Tokyo University of Technology
4th Author's Name Hiroyuki KASAI
4th Author's Affiliation School of Computer Science, Tokyo University of Technology
5th Author's Name Takumi NOMURA
5th Author's Affiliation NEC Communication Systems, Ltd.
Date 2006-10-20
Paper # CS2006-42
Volume (vol) vol.106
Number (no) 304
Page pp.pp.-
#Pages 6
Date of Issue