Service plane has been proposed to meet the increasing complexity in the NGON. In this paper, an in-depth research on self-adaptation service plane extension in NGON is made. Firstly, through the analysis of network developing trend and future service characteristics, the principle of introducing service plane is cleared. Then the self-adaptation technology is explained for the purpose of adapting to the development of optical network. Subsequently through the description of service self-adaptation capacity, the self-adaptation framework of service-oriented NGON is built. After that, according to the extraction of service plane functional requirements, service plane functional elements are built and the flow of access services is illustrated. Through this paper, a reference is provided for more deeply research of service optical network.
Though analyzing and summarizing the strategies of dynamic multicast traffic grooming, the strategies embody that
which optimization criterion would be chose for the requirement of low-speed multicast service to select grooming
routing in the grooming network, and the different strategic combination would obtain the different effect of multicast
traffic grooming. On this basis, the Light Tree based Integrated Grooming (LTIG) and the Markov Finite Horizon
Decision Algorithm of Shortest Path Tree are studied deeply, The research indicates that what the min-cost grooming
routing calculation of LTIG adopts is MPH algorithm and Dijikstra algorithm which has higher complexity. But the
Markov Finite Horizon Decision Algorithm of Shortest Path Tree has low complexity and it only seeks solutions in
General network and isn't applicable to multicast traffic grooming. Subsequently, the Markov Finite Horizon Decision
Algorithm of Shortest Path Tree is introduced to LTIG algorithm and a new MTGA-SPT algorithm is proposed.
MTGA-SPT algorithm can resolve the route selection problem of resource node to multi-destination nodes, thus forming
the light tree. Through the analysis of algorithm complexity, the complexity of MTGA-SPT algorithm mainly depends
on the calculation of traffic grooming routing, and adopts the Markov Finite Horizon Decision Algorithm of Shortest
Path Tree to compute min-cost grooming routing, making the complexity of MTGA-SPT algorithm descended, The
complexity of Markov Finite Horizon Decision Algorithm of Shortest Path Tree is O((V-1)•W), and other step algorithm
complexity is about O(V). To sum up, MTGA-SPT algorithm can reduce the time delay effectively.
This paper describes a way of creating the OVPN through the management plane and manages the OVPN with a centralized method in Automatic Switch Optical Network (ASON). Through the extension of resource management, signal mechanism and connection control, the architecture of OVPN creation and OVPN maintenance with a centralized method is efficiently realized, and the requirements of multi- granularity, bandwidth modification and link monitory are realized. Moreover, Service Lever Agreement (SLA) can be included in OVPN through Switched Connection (SC) and Soft permanent connection (SPC). If further study is carried through on this scenario, the optical multicast will be realized under both the mechanisms of management plane and control plane. At last, the applications area, account model and development prospect of OVPN are discussed.
In this paper, The Next Generation Optical Network Service Platform(NGOSP) based on the architecture of ASON was studied. The paper presented the layered concept of service function around the telecommunication service requirement base on the analysis for the evolution trend of service optical network and modes of service provision, and definitized the reference model and constructed the function framework of service optical network. The general function components also were abstracted from service perspective and a thought of mapping function of service layer to network technical layers was presented.
Optical burst switching (OBS) is a promising solution for building terabit optical routers and realizing IP over WDM. In this paper, we describe the basic concept of OBS and present a simulation model. The objective of our simulation is to estimate the throughput and the burst loss probability in such a network of OBS nodes. The traffic characteristics and reservation schemes are essential on burst loss probability. We give some comparison of these schemes by using our simulation model, as we can see, while low self-similarity traffic distribution and JET (just enough time) reservation schemes may have a potential positive effect on the overall blocking probability of the OBS network.
It is believed that on-demand dynamic lightpath provisioning will enable service providers to respond quickly and economically to customer demands. One of the challenges involved in designing wavelength-routed networks with dynamic traffic demands is to develop efficient algorithms and protocols for establishing lightpaths. This paper proposes a novel dynamic path-selection algorithm that combines service path link using probability weight with efficient disjoint-path restoration bandwidth sharing to obtain a balanceable traffic distribution during the wavelength route selection, and consider the wavelength bandwidth capability sharing between the disjoint paths for the failure scenario. At the same time, to realize dynamic lightpath establishment, this paper discusses the strategy of lightpath establishment based on Automatically Switched Optical Network (ASON), and also presents the extension of GMIPLS protocols to efficiently collect and distribute the necessary information in ASON architecture frame. Through the distributed IP-centric protocol we can realize link state update and dissemination. To sum up, in this paper we hope to show a full and efficient dynamic path establishment mechanism with ASON control plane function and GMPLS principle.