Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Packet QoS level classifier based on optical binary priority comparison

Open Access Open Access

Abstract

Next generation High-Speed optical packet switching networks require components capable of classifying incoming packet into the appropriate priority queue according to the service class of the packet. For the first time, we proposed an all-optical packet QoS (Quality of Service) level classifier employing a sequential binary packet priority comparator, which is implemented using the SOA-based optical logic gates. The performance of the optical binary packet priority comparator was verified experimentally at 1Gbit/s showing that the proposed scheme can operate higher data rates. These packet level classifier structures are attractive for all-optical network and applications.

©2010 Optical Society of America

1. Introduction

The packet switching network has been advanced to process the immense amount of packet data at a very high speed due to the explosively increasing packet-based multi-media services. All-optical packet switching networks (AOPSNs) where the packet switching and routing are implemented with the photonic signal processing have been investigated intensively to fulfill the required performances of the fast optical packet processing [1].

Optical packet classifier in AOPSN is one of the key technologies related to QoS provisioning at a packet router. The packet classifier determines a service level of information carried by a packet regarding on bandwidth, jitter, delay, loss, etc [2]. In the conventional IP-over-WDM networks, the packet processor has been implemented using electronic devices, which has posed operational limitations due to relatively slow electronic devices [3]. Such speed-limit problem becomes more serious when complicated logical functions are required in packet processing, like in the packet classifier. In an effort to realize high-speed optical packet processing, various schemes and architectures of the optical packet processor have been reported up to now [47].

In this paper, for the first time, we proposed an all-optical packet QoS level classifier which is based on the sequential binary priority comparison. Optical logics in the proposed scheme are realized utilizing semiconductor optical amplifiers (SOAs) operating in the cross-gain modulation (XGM) regime. Since the structure of the proposed packet QoS level classifier only rely on a feedforward control scheme, it can provide a high speed operability at 1 Gbps or even higher as well as a great flexibility in the packet length to be processed.

2. Proposed packet QoS level classifier structure

In a priority queuing scheme, a packet is assigned to one of the predetermined queues, for example, high, medium, normal, and low priority queues according to the service class of the packet. During transmission, a higher priority queue holds an absolute preferential treatment over low priority queues. The priority is specified by priority bits in the packet header. As an example, packets in the IP differentiated services (diffserv) are marked by a Differentiated Services Class Point (DSCP) in 6 bits of Type of Service (ToS) of an IP packet header to identify their classes.

A packet level classifier processes the incoming packet priority bits to determine the service priority level of the packet. In the packet level classifier shown in Fig. 1 , an incoming packet priority bit pattern (A) is compared with the pre-determined four classifying level patterns, B1, B2, B3 and B4. The classifier is designed to produce a noticeable output at the one of the 5 output ports, each of which corresponds to one of the 5 priority levels, for example highest, high, medium, low and lowest levels.

 figure: Fig. 1

Fig. 1 Packet level classifier based on packet priority-bits.

Download Full Size | PDF

The proposed packet level classifier is shown in Fig. 2 . It is presumed in the figure that the optical priority bit pattern was extracted from the packet header, being ready to be provided to the packet classifier. In addition, it is assumed that a triggering pulse per packet is produced and supplied to the bit pattern generators. The packet level classifier in Fig. 2 has 4 classifying bit-pattern generators, each of which produces a bit pattern representing one of the 4 classifying values B1, B2, B3 and B4. A bit pattern generator can be readily implemented by using fiber delay lines, optical splitter and combiner. Each classifying bit pattern is synchronized in time with the incoming priority bit pattern (A). The value of the incident packet priority pattern is compared with each of the classifying bit patterns in order. The result of comparison in an optical comparator block is a packet level decision, otherwise it is fed to the AND logic gate to make the next level decision process. In the following section, we will describe the optical priority comparator that is to be used in the proposed all-optical packet level classifier.

 figure: Fig. 2

Fig. 2 Proposed all-optical packet level classifier model.

Download Full Size | PDF

3. All-optical binary packet priority comparator

3.1 Binary comparison algorithm

A binary comparison algorithm is shown in Fig. 3 , where two numbers A and B are to be compared to find which is greater. For a binary comparison, A and B are expressed by binary summations respectively as follows.

A=a02N1+a12N2++ai2N1i++aN1B=b02N1+b12N2++bi2N1i++bN1
where i=0N1 is a value to specify the bit order of A and B, ai and bi are the bits at the ith order of A and B respectively. For example, a0 and b0 are the most significant coefficients of A and B respectively, a1and b1 the next significant coefficients, and so on. The comparison begins by comparing the most significant coefficients a0 and b0. If they are found to be equal, the comparison is made on the next significant coefficients of A and B. It continues by incrementing i by one until a coefficient under comparison is found to be greater than the other. For example, if it is found ai>bi, we decide A>B. If all coefficients are found to be equal, we decide A=B.

 figure: Fig. 3

Fig. 3 Binary packet priority comparison algorithm.

Download Full Size | PDF

3.2 SOA-based counter-propagating XGM logic gates

The implementation of the binary packet priority comparator in this paper is based on logic gates exploiting the XGM effect of SOA. The XGM is a nonlinear effect that occurs in an SOA when two signals pass simultaneously through the device. If a high optical input power, called the pump signal, is injected into the SOA, it causes carrier depletion in the active region through the stimulated emission resulting into a gain reduction of the SOA. In Fig. 4 , pump signal B causes carrier depletion in the SOA, which leads to a gain saturation causing the marked intensity reduction of the low-power signal, probe signal A, resulting into no signal at the SOA output port. When the pump signal is not present, the low-power signal is amplified by the SOA and its logic state is transferred to the SOA output. This operation can be summarized as AB¯ as shown in the Table 1 . The counter-propagating configuration has the merit of capable of using the same or different wavelengths for the pump and probe input signals. It is however known that the speed of the XGM-based logic gate is limited by the SOA length [6]; operation at 25Gps is allowed with 2 mm SOAs, and further advancement with shorter SOAs could be expected with advent of advanced PLC (Planar Lightwave Circuit) technologies.

 figure: Fig. 4

Fig. 4 Counter-propagating configuration of the SOA-based basic logic.

Download Full Size | PDF

Tables Icon

Table 1. Truth table of logic function based on XGM

3.3 Implementation of binary packet priority comparator

Figure 5(a) shows a digital gate level architecture of the proposed packet priority comparator, which consists of two functional blocks, a bit-comparator and a bigger-value indicator. The inputs to the bit-comparator are two input bit patterns, A (packet priority bit pattern) and B (classifying bit pattern). Two outputs of the bigger-value indicator, O1 and O2 represents two comparison results, A>B and AB, respectively. It means that “1” will appear at either output port O1 or O2 as the comparison result depending on A>B or AB.

 figure: Fig. 5

Fig. 5 Proposed all-optical binary packet priority comparator, (a) digital gate-level architecture of packet priority comparator; (b) optical packet priority comparator corresponding to (a); (c) operation timeline of proposed scheme.

Download Full Size | PDF

The bit-comparator is to compare binary bits A[i] and B[i] of A and B sequentially in order. This comparison operation can be described by two logic functions B[i]¯A[i] for G1 gate and A[i]¯B[i] for G2 gate. As shown in the logical truth table of the bit-comparator in Table 2 , U port will have “1” if A[i]>B[i]. On the other hand, bit “1” will appear at L port for the case of A[i]<B[i]. In order to take care of the case of A = B, an extra bit is added after the bit sequence of B.

Tables Icon

Table 2. Truth table for bit-comparator

The operation timeline of the proposed priority comparator scheme is shown in Fig. 5(c) for the example of A = 11011 and B = 100011. There will be two bits on the time-slots t0 and t1 at U, and one bit in the time-slot t2at L. Such bits indicate the results of the comparisons made on each coefficient of the binary expressions of A and B, as described in Eq. (1). The bit at t0 represents that the second significant coefficient a1of A is greater than the second significant coefficient b1of B, resulting that A is larger than B. Therefore, the further comparison result bits at U and L are no longer needed, and thereby should be ignored. Such action is carried out by the bigger value indicator block following after the bit comparator block as shown in Fig. 5(a) and 5(b). The clearing bit generator in the bigger value indicator block generates a chain of N bits (where N is the bit-length of A and B), starting from the time instant where the first decision of inequality between the significant coefficients of A and B is found. The clearing bit streams is delayed by one bit interval and applied to AND gates G3 and G4 in order to prohibit any influence from the next comparison result bits to the first comparison result bit that is the bit on t0 at U in the given example. Consequently, only the first “1” of the bit comparison result is forwarded to either O1 or O2, representing A>B or AB. Optical implementation of bit clearing is realized by using SOAs, SOA3 and SOA 4 as in Fig. 5(b). The SOAs operate as AND logic gates based on XGM effect [8]. Strong pump signal a is supplied to the right port of the SOA and saturates the device whereas weak probe signal b is applied to the left port of the SOA. Consequently, SOA works as the logic function a¯b, where a is the pump signal that is the bits from a clearing bit stream, and b is the bit from a probe signal that is the comparison result bits in Fig. 5(b).

4. Experiment and discussions

Figure 6 shows the experiment setup to demonstrate the performance of the proposed optical binary comparator for 4 bit-length binary numbers. A pulse pattern generator (PPG) generates the binary number A (packet priority bits). The binary number B (classifying value) is generated by one-bit delaying A for the experimental simplicity. The generated two priority bit patterns are now A = 1011 and B = 0101, and B has a one additional bit to form 01011 as explained before. The experiment was carried out at 1Gb/s. The optical intensity modulator used in our experiment is a 2x2 LiNbO3 interferometric switch. The laser source operates at 1550nm. The clearing bit generator employs four delay lines with 1-bit, 2-bit, 3-bit, and 4-bit delay respectively.

 figure: Fig. 6

Fig. 6 Experiment setup for all-optical packet priority comparator.

Download Full Size | PDF

Two packet priority bit patterns, A and B are shown in Fig. 7(a) and Fig. 7(b), respectively. The SOA1 and SOA2 are biased by 100mA, and the pump and probe signal powers are 0.97dBm and −6.8dBm, respectively. The signals measured at U and L obtained with A = 1011 and B = 0101 are shown in Fig. 7(c) and 7(d), which are then applied to SOA3 and SOA4 respectively as probe signals. The signal in Fig. 7(e) is the clearing bit stream, starting from the first bit at U port with one-bit delay, which is used as the pump signal to both SOA3 and SOA4. Figure 7(f) and Fig. 7(g) show the decision result measured at O1 (A>B) and O2 (AB), respectively. Since A>B, we have only one pulse at O1 while there is no bit found at O2. The extinction ratio of the output signal at O1 is about 6.4dB.

 figure: Fig. 7

Fig. 7 Experiment result of comparison for A = 1011 and B = 01011, (a) input signal A; (b)input signal B; (c) signal at U when A[i]>B[i]; (d) signal at L when A[i]<B[i]; (e) clearing bit stream at C; (f) output at O1 when A>B; (g) output at O2 when A≤B.

Download Full Size | PDF

From the experiment results, we have shown that the proposed optical binary comparator operates accurately as expected enough to be used in the all-optical packet level classifier shown in Fig. 2. The proposed optical binary comparator was examined at the speed of 1Gb/s, and it can be modified to work at a higher data rate because only a timing-sensitive device, XGM-based SOA logic device is involved in the proposed scheme [6,8].

5. Conclusion

In this paper, we proposed an optical packet level classifier structure, for which a new all-optical packet priority comparator structure was proposed and examined experimentally to demonstrate its practical validity. The proposed packet priority comparator is expected to operate at a higher date rate because there is no speed-limiting device employed except the XGM-based SOA logic gates and no timing-sensitive structure such as a feedback loop control mechanism. The proposed all optical comparator is also flexible in the bit-length of packet priority bit pattern because only the length of delay lines in the bit pattern generator should be adjusted if necessary.

Acknowledgements

This work was supported by the IT R&D program of MKE/KEIT [KI001822, Research on Ubiquitous Mobility Management Methods for Higher Service Availability] and partly by the BLS project from the Seoul Metropolitan City.

References and links

1. R. Caenegem, D. Colle, M. Pickavet, P. Demeester, K. Christodoulopoulos, K. Vlachos, E. Varvarigos, L. Stampoulidis, D. Roccato, and R. Vilar, “The design of an all-optical packet switching network,” IEEE Commun. Mag. 45(11), 52–61 (2007). [CrossRef]  

2. J. Segarra, V. Sales, and J. Prat, “An all-optical access-metro interface for hybrid WDM/TDM PON based on OBS,” J. Lightwave Technol. 25(4), 1002–1016 (2007). [CrossRef]  

3. M. C. Yuang, P. L. Tien, J. Shih, and S. S. W. Lee, Yu-Min Lin and J. J. Chen, “A QoS optical packet-switching system for metro WDM networks,” in Proceedings of ECOC, (2005), pp. 351–352.

4. Y. Wang, X. Zhang, J. Dong, and D. Huang, “Simultaneous demonstration on all-optical digital encoder and comparator at 40 Gb/s with semiconductor optical amplifiers,” Opt. Express 15(23), 15080–15085 (2007). [CrossRef]   [PubMed]  

5. A. D. Barman, S. Debnath, M. Scaffardi, L. Poti, and A. Bogoni, “Modelling and implementation of photonic digital subsystem for bit comparison,” in Proceedings of IEEE Photonics in Switching, (Institute of Electrical and Electronics Engineers, 2007), pp. 61–62.

6. M. Scaffardi, P. Ghelfi, E. Lazzeri, L. Poti, and A. Bogoni, “Photonic Processing for Digital Comparison and Full Addition Based on Semiconductor Optical Amplifiers,” IEEE J. Sel. Top. Quantum Electron. 14(3), 826–833 (2008). [CrossRef]  

7. N. Andriolli, M. Scaffardi, A. Das Barman, P. Castoldi, L. Poti, and A. Bogoni, “All-optical packet-switched interconnection network based on modular photonic digital processing,” IET Commun. 3(3), 477–486 (2009). [CrossRef]  

8. C. W. Son, S. H. Kim, Y. T. Byun, Y. M. Jhon, S. Lee, D. H. Woo, S. H. Kim, and T.-H. Yoon, “Realisation of all-optical multi-functional logic gates using semiconductor optical amplifiers,” Electron. Lett. 42(18), 1057–1058 (2006). [CrossRef]  

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (7)

Fig. 1
Fig. 1 Packet level classifier based on packet priority-bits.
Fig. 2
Fig. 2 Proposed all-optical packet level classifier model.
Fig. 3
Fig. 3 Binary packet priority comparison algorithm.
Fig. 4
Fig. 4 Counter-propagating configuration of the SOA-based basic logic.
Fig. 5
Fig. 5 Proposed all-optical binary packet priority comparator, (a) digital gate-level architecture of packet priority comparator; (b) optical packet priority comparator corresponding to (a); (c) operation timeline of proposed scheme.
Fig. 6
Fig. 6 Experiment setup for all-optical packet priority comparator.
Fig. 7
Fig. 7 Experiment result of comparison for A = 1011 and B = 01011, (a) input signal A; (b)input signal B; (c) signal at U when A[i]>B[i]; (d) signal at L when A[i]<B[i]; (e) clearing bit stream at C; (f) output at O1 when A>B; (g) output at O2 when A≤B.

Tables (2)

Tables Icon

Table 1 Truth table of logic function based on XGM

Tables Icon

Table 2 Truth table for bit-comparator

Equations (1)

Equations on this page are rendered with MathJax. Learn more.

A = a 0 2 N 1 + a 1 2 N 2 + + a i 2 N 1 i + + a N 1 B = b 0 2 N 1 + b 1 2 N 2 + + b i 2 N 1 i + + b N 1
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.