Presentation 2002/11/14
An Efficient Allocation Process for Optical Access Networks
Kenichi TAYAMA, Hiroyuki MURATA, Tsutomu MARUYAMA, Hiroshi UNO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) To provide the services cost-effectively and quickly, an operation support system (OSS) that effectively uses network elements and reduces time of delivery to users is important. Because optical access networks (OANs) consist of several elements, it is also necessary to control the sequence of element allocation and re-allocation. We have determined the most efficient allocation process for allocating OAN elements in consideration of allocation conditions and various OAN types such as an outside splitter. This process can reduce 30% allocation step in an OAN model.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) allocation / operation / optical fiber / access network / process
Paper # CQ 2002-98
Date of Issue

Conference Information
Committee CQ
Conference Date 2002/11/14(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 Quality (CQ)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) An Efficient Allocation Process for Optical Access Networks
Sub Title (in English)
Keyword(1) allocation
Keyword(2) operation
Keyword(3) optical fiber
Keyword(4) access network
Keyword(5) process
1st Author's Name Kenichi TAYAMA
1st Author's Affiliation NTT Access Service Systems Laboratories, NTT Corporation()
2nd Author's Name Hiroyuki MURATA
2nd Author's Affiliation NTT Access Service Systems Laboratories, NTT Corporation
3rd Author's Name Tsutomu MARUYAMA
3rd Author's Affiliation NTT Access Service Systems Laboratories, NTT Corporation
4th Author's Name Hiroshi UNO
4th Author's Affiliation NTT Access Service Systems Laboratories, NTT Corporation
Date 2002/11/14
Paper # CQ 2002-98
Volume (vol) vol.102
Number (no) 460
Page pp.pp.-
#Pages 6
Date of Issue