Abstract

With the development of the gigabit-Ethernet passive optical network (GEPON), the polling mechanism is widely used in allocating bandwidth of GEPON in order to solve the bottleneck problem of an access network. The polling mechanism is effective in GEPON bandwidth allocation. However, the mechanism has some problems of its own that are quite prominent and cannot be solved by the mechanism itself, such as the waste of time slot, waste of authorized window, waste of idle queue, and so on. This paper proposes a dynamic programmable scheduling mechanism that can effectively solve the problems of the polling mechanism. At the same time, the dynamic programmable scheduling mechanism can provide a greater degree of flexibility that enables service providers to decide, adjust, and achieve their own bandwidth allocation logic after the network is fixed. In addition, to a large extent, the proposed mechanism can promote interoperability among different GEPON systems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.