• ETRI Journal
• /
• v.24 no.2
• /
• pp.97-108
• /
• 2002

Optical Border Gateway Protocol (OBGP) is an extension to BGP for Optical Cross Connects (OXCs) to automatically setup multiple direct optical lightpaths between many different autonomous domains. With OBGP, the routing component of a network may be distributed to the edge of the network while the packet classification and forwarding is done in the core. However, it is necessary to analyze the stable convergence functions of OBGP in case of lightpath failures. In this paper, we first describe the architecture of the OBGP model and analyze the potential problems of OBGP, e.g., virtual BGP router convergence behavior in the presence of lightpath failure. We then propose an OBGP convergence model derived from an inter-AS (Autonomous System) relationship. The evaluation results show that the proposed model can be used for a stable OBGP routing policy and OBGP routing convergence under lightpath failures of the optical Internet.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.551-558
• /
• 2016

In multifiber all-optical networks, optical amplifiers are used for amplifying multiple optical signals with different wavelengths in fibers. An optical amplifier operates when any of lightpaths passes through it. Therefore, it should simultaneously amplify as many lightpaths as possible for efficiently utilizing its power. This paper proposes a dynamic lightpath establishment scheme considering the use efficiency of the optical amplifiers and the depletion of the wavelength resources in multifiber all-optical networks. The proposed scheme provides a routing and wavelength assignment strategy that reduces both the power consumption of the optical amplifiers and the blocking probability of the lightpath establishment. Through simulation experiments, we demonstrate the effectiveness of the proposed scheme.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.216-219
• /
• 2000

본 연구는 WDM Mesh 망에서 SDH 수요가 주어졌을 때, 여러 개의 SDH 수요를 효과적으로 routing하는 방법을 통해 grooming 효과를 극대화시켜 전체 Mesh망에서 사용되어지는 총 Lightpath의 수를 줄이는 것을 목적으로 한다. 그리고 이렇게 해서 구해진 Lightpath의 수를 각 링크의 용량제약으로 하여 SDH 수요의 routing 비용을 최소화하는 것을 부차적인 목적으로 한다. 이것을 수리모형으로 바꾸면, Network Synthesis 문제와 Integer Multicommodity 문제로 모형화 할 수 있다. 해법으로는 Path-Formulation을 통한 분지평가법을 사용하였다. 전산실험결과를 보면 상용 패키지인 CPLEX를 이용하여 푼 것에 비해 수행속도 면에서 훨씬 빠르게 나타났고, 문제의 사이즈가 커짐에 따라 CPLEX를 사용하여 해결할 수 없는 문제에 대해서도 해를 구할 수 있었다.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.466-469
• /
• 2003

This paper presents the routing and wavelength and timeslot assignment problems for a circuit-switched time division multiplexed (TDM) wavelength-routed networks. In this paper, we propose an efficient distributed control protocol for establishing lightpath dynamically. The protocol uses backward reservation to reduce the chance of blocking. we use aggressive reservation method with usable multiple channels and select only one in multiple channel. We show through simulation that the proposed protocol improves the success rate in TDM -based lightpath establishment.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.68-75
• /
• 2004

In this paper, n study a distributed establishment scheme to setup lightpath in WDM/TDM Network considering user traffic characteristics. We propose a GBTA(guaranteed-bandwidth time-slot allocation) algorithm which assigns time-slots according to the requred traffic so that it can utilize given network resources efficiently in RWTA(routing and wavelength time-slot assignment) schemes. We consider traffic specification on the basis of ATM traffic classes. Also, in order to increase link utilization and minimize blocking probability, we extend distributed lightpath establishment protocol based on GBTA algorithm. In order to establish lightpath in distributed WDM/IDM network, we use backward resonation protocol that resewes resource with recent information. We use DOWTns(Distributed Optical WDM/TDM ns) that is extended from NS(Network Simulator), in order to verify proposed GBTA-based optical wavelength routed network.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1346-1349
• /
• 2004

In this paper, we have proposed the new link-weight calculating function using for routing decision in WDM networks. The proposed link-weight calculating functions includes following factors those are available wavelengths per link, distance loss, total wavelengths, and limited wavelength conversion. The calculated link-weight is applied into the algorithm of routing decision in order to determine the available lightpath that qualifies user requests. The objective is to improve the performance of wavelengths assignment with fast determining the suitable lightpath by using the proposed link-weights calculating function. The analytical model of WDM switching networks is introduced for numerical analysis. The link-weight calculating function is performed. Finally, the performance of proposed algorithm is displayed with numerical results in term of the blocking probability, the probability that connection requests from users are rejected due to there are no available lightpath to be assigned for them. It is also shown that the blocking probability is varied in depending on the number of available wavelengths and the degree of wavelength conversion. The numerical results also show that the proposed link-weight calculating function is more cost-effective choice for the routing decision in WDM switching networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1427-1433
• /
• 2003

This paper presents the routing and wavelength and timeslot assignment problems for a circuit-switched time division multiplexed (TDM) wavelength-routed networks. In this paper, we propose an efficient distributed control protocol for establishing lightpath dynamically. The protocol uses backward reservation to reduce the chance of blocking. We use aggressive reservation method with usable multiple channels and select only one in multiple channel. We show through simulation that the proposed protocol improves the success rate in TDM-based lightpath establishment and the proposed aggressive reservation method improve blocking probability with appropriate reservation channel count.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.12
• /
• pp.41-49
• /
• 2004

Increase of internet users and new types of applied traffics, have led to demand for more bandwidth for each application. Hence, the amount of internet traffic has risen sharply and it has demanded to use limited resources, such as wavelength and bandwidth, more effectively. These kind of needs can be satisfied with OXC(Optical cross-connects) based on GMPLS that carry out IP packet switching and wavelength switching at the same time and Provide very wide bandwidth. In RSVP-TE signaling of GMPLS studied by IETF. every lambda router in core network should be able to convert wavelength. So, lots of wavelength converters and needed and building and managing cost is high. Another problem is that optimized traffic is limited. In this paper We suggest strengthened GMPLS RSVP-TE signaling algorithm for a better lightpath setup. When setup signaling is blocked suggested algorithm does not send PathErr message to Edge Router, but looks for nearest lambda router which can convert wavelength and carry out setup signaling from that node. Such algorithm can reduce the chance of blocked lightpath setup signaling and provide effective arrangement of lambda router in core network by calculating proper number of wavelength converter.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.15-18
• /
• 2008

WDM is an incredibly promising technique in which multiple channels are operated along a single fiber, providing the facilities of terabit per second bandwidth. Thus, the survivability of WDM networks becomes critical for the success of the next generation internet architecture. Despite the fact that the path-based proactive restoration scheme guarantees 100% restoration as it computes a backup light path while the primary light path is being set up, this method results in additional capacity consumption. In this paper, an ideal technique is proposed that modifies the active multi-backup paths method and results in a better restoration scheme. Based on a theoretical analysis, a new method is shown to reduce the number of hopes as well as the restoration time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.979-986
• /
• 2005

In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A RWA problem for scheduled lightpath demands (SLDs) has been solved by combinatorial optimal solution (COS) and graph coloring, or heuristic sequential RWA (sRWA). Such methods are very complex and incurs large computational overhead. In this paper, we propose an efficient RWA algorithm to utilize the time disjoint property as well as space disjoint property through fast grouping of SLDs. The computer simulation shows that our proposed algorithm indeed achieves up to $54\%$ faster computation with similar number of wavelengths than the existing heuristic sRWA algorithm.