• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.34-39
• /
• 2005

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical Wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop count. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose the Just Enough Time(JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.6 no.3
• /
• pp.1-7
• /
• 2007

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide efficient utilization in optical networks. Under several legacy schemes, a switch drops the burst with the shortest time regardless of its traversed hop count. As a result, a dropped burst that have been traversed many hops might cause increased bandwidth waste compared to one that has traversed a few hops. To improve this problem, we propose the Just Enough Time (JET) with a hop counting scheme which can reduce the wasted bandwidth by prioritizing the burst traversed many hops over others. From the simulation result, it is preyed, we show that the proposed scheme has advantages against legacy schemes in terms of the burst blocking probability and the link utilization.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.3
• /
• pp.251-258
• /
• 2003

Optical Switching Matrix (OSM) or Optical Multistage Interconnection Networks (OMINs) comprising photonic switches have been studied extensively as important interconnecting blocks for Optical Cross Connects (OXC) based on Optical Burst Switching (OBS). A basic element of photonic switching networks is a 2$\times$2 directional coupler with two inputs and two outputs. This paper is concerned with the diagnosis of multiple crosstalk-faults in OSM. As the network size becomes larger in these days, the conventional diagnosis methods based on tests and simulation become inefficient, or even more impractical. We propose a simple and easily implementable algorithm for detection and isolation of the multiple crosstalk-faults in OSM. Specifically. we develop an algorithm for isolation of the source fault in switching elements whenever the multiple crosstalk-faults arc detected in OSM. The proposed algorithm is illustrated by an example of 16$\times$16 OSM.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.682-684
• /
• 2007

A new scheme to alleviate contention in optical burst switching networks is proposed. It consists of preventively reserving resources in a node, to be used if resources are busy on the next hop node. The burst is sent back to the preceding node and then resent forward. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution based on deflection routing.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.274-285
• /
• 2022

Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.51-58
• /
• 2003

In this paper, we propose a group scheduling scheme to efficiently utilize network resources for core nodes in optical burst switching networks. This scheme schedules multiple bursts utilizing an interval graph to obtain the maximum stable set using the information such as arrival times and burst lengths from the collected header packets. Simultaneous scheduling of multiple bursts in a scheduling window results in lower burst loss probability and increased channel utilization than those proposed previously using one-to-one mapping. Simulation results for both cases of variable and fixed burst sizes show that the group scheduling scheme is better than the immediate scheduling, so called Latest Available Unused Channel with Void Filling, scheme in both performance metrics above mentioned.

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

In this paper, we take advantage of the characteristics of optical burst switching (OBS) to support service-differentiation in optical networks. With the offset time between control packet and burst data, the proposed scheme uses different offset time of each service class. As contrasted with the Previous method, in which the high Priority service use only long offset time, it derives the burst loss rate as a QoS parameter in consideration of conservation law and given service-differential ratios and decides a reasonable offset time for this QoS finally Firstly proposed method classifies services into one of high or low class and is an algorithm deciding the offset time for supporting the required QoS of high class. In order to consider the multi-classes environment, we expand the analysis method of first algorithm and propose the second algorithm. It divides services into one of high or low group according to their burst loss rate and decides the offset time for high group, and lastly cumulates the offset time of each class. The proposed algorithms are evaluated through simulation. The result of simulation is compared with that of analysis to verify the proposed scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.24-34
• /
• 2003

In this paper, we investigated the problems of the offset time based service differentiation scheme for optical burst switching (OBS) networks, and proposed the preemption-based service differentiation scheme which combines a preemption channel selection algorithm and channel partitioning algorithm. The proposed preemption channel selection algorithm minimizes the length of preempted bursts to improve the channel efficiency, while the proposed channel partitioning algorithm controls the degree of service differentiation between service classes. The simulation results showed that the proposed schemes could improve the end-to-end performance and effectively provide controllable service differentiation in the multiple hop network environments.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.8-15
• /
• 2003

In this paper, we address how to provide absolute differentiated services for optical burst switching (OBS) networks based on dynamic wavelength assignment. Unlike existing quality of service (QoS), such as buffer-based and offset-time based scheme, our proposed dynamicvirtual lambda partitioning (DVLP) scheme does not mandate any buffer or extra offset time, but can achieve absolute service differentiation between classes. This new DVLP scheme shares wavelength resources based on several different priority of classes in an efficient and QoS guaranteed manner. The performance results show that the proposed scheme effectively guarantees a target blocking probability of each traffic classes both in Poisson and Self-similar traffic environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8B
• /
• pp.721-729
• /
• 2004

In this paper, we applied a group scheduling algorithm to core nodes in an optical burst switching (OBS) network and measured its performance by simulation. For the case of core nodes with multi-channel input/output ports, performance of the group scheduling has been compared to that of the immediate scheduling. Since the group scheduling has a characteristic of scheduling a group of bursts simultaneously in a time window using information collected from corresponding burst header packets arrived earlier to a core node, simulation results show that the group scheduling outperforms the immediate scheduling in terms of both burst loss probability and channel utilization and the difference gets larger as the load increases. Another node configuration in which wavelength converters are equipped at the output ports has also been considered. In this case, even though both performance metrics of the group scheduling are almost the same as those of the immediate scheduling in the offered load range between 0.1 and 0.9, the group scheduling has lower wavelength conversion rate than the immediate scheduling by at least a factor of seven. This fact leads us to the conclusion that the group scheduling makes it possible to implement more economical OBS core nodes.