| Paper Abstract and Keywords |
| Presentation |
2006-10-20 09:00
Number of Attempts till Discovery Completion for GE-PON and GE-OSAN Hiromi Ueda, Tetsuya Sofue, Toshinori Tsuboi, Hiroyuki Kasai (Tokyo Univ. of Tech.), Takumi Nomura (NCOS) |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (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) |
| (in English) |
GE-PON / GE-OSAN / Discovery / ranging / random delay / / / |
| Reference Info. |
IEICE Tech. Rep., vol. 106, no. 304, CS2006-42, pp. 35-40, Oct. 2006. |
| Paper # |
CS2006-42 |
|