International Journal of Computer Networking,

Wireless and Mobile Communications (IJCNWMC)

ISSN(P): 2250-1568; ISSN(E): 2278-9448
Vol. 6, Issue 5, Oct 2016, 17-22
TJPRC Pvt. Ltd

RECONFIGURING COMPOSITE CODING LABELS TO ADAPT TO

PACKET TRAFFIC IN OPTICAL MPLS NETWORK
KAI-SHENG CHEN, JEN-FA HUANG & TING-RU SU
Institute of Computer and Communication, Department of Electrical Engineering,
National Chen Kung University, Taiwan
ABSTRACT
Many optical multi-protocol label switching (MPLS) networks use optical codes as packets labels, and there is
a considerable amount of literature on the label-generating and recognizing mechanism. However, there is little specific
guidance on how to apply label codes to the network that supports traffic adaptation. Using spectral amplitude coding
(SAC) labels as an example, this paper proposes a composite label set made of M-sequence codes. These composite labels
can switch packets over heavy and light traffic, as well as being capable of label stacking. The switching processes of
traffic adaptation in optical MPLS work are numerically illustrated.
KEYWORDS: Multi-Protocol Label Switching (MPLS), Spectral Amplitude Coding (SAC), M-sequence Codes

INTRODUCTION
Nowadays, internet protocol (IP) are commonly used to transfer multimedia and data [1]. In traditional IP
network, each router defines the next hop by executing routing algorithms individually. When a packet is

Original Article

Received: Jul 23, 2016; Accepted: Aug 22, 2016; Published: Aug 25, 2016; Paper Id.: IJCNWMCOCT20162

transmitted, the router operation is called store and forward. When a router receives a packet, it stores the packet,
analyzes the routing path, and then looks up the routing table to forward. Moreover, if packets have the same
destination, it must perform the repeated procedures, which is inefficient and consumes router power and memory
space.
Multi-protocol label switching (MPLS) is a referenced technology of label switching [2]. There are two
kinds of nodes in MPLS network, edge nodes and core nodes. An edge node is responsible for finding the shortest
path for a packet to pass through the network, and a core node transmits a packet to its destination by identifying
the label. As a result, processing delay is shortened at each node since label analysis in the network layer is not
necessary. In other words, MPLS simplifies the forwarding function of nodes.
In recent years, developing optical packet switched (OPS) networks that overcome the bottlenecks in
transport and access network has become popular. To support such demand, optical packet router is treated as an
edge device that functions as an interface between electronic and optical domain [3]. To increase the user number
in the network, label coding schemes based on two different optical receivers, serial interference cancellation (SIC)
receiver and conventional correlation receiver (CCR), are investigated in [4]. Comparison of system performance
between these two receivers is also reported.
However, existing research in MPLS network has ignored the label switching mechanism in different
packet traffics. Hence, this paper introduces a composite label code [5] of spectral amplitude coding (SAC), to

www.tjprc.org

editor@tjprc.org

18

Kai-Sheng
Sheng Chen, Jen-Fa
Jen
Huang & Ting-Ru Su

support packet switching in heavy andd light traffic over optical MPLS network. In such scheme, label number assigned to
each core node and the length of label switching path (LSP) are adjusted with data traffics. The proposed reconfiguring
labels enable the packets to switch under various traffic
traffic conditions, to meet the requirement of practical scenario.
NODE ARCHITECTURE OF RECPNFIGURING COMPOSITE LABELS
In the proposed MPLS network, the labels are encoded by spectral-amplitude-coding
spectral
coding (SAC) because of the
consistency with label stacking, fast
st recognition, and low system cost. At edge node, the composite SAC labels are
generated by an encoder structured on arrayed-waveguide-grating
arrayed
grating (AWG) routers, as shown in Figure 1. By using the
cyclic properties of AWG routers and M-sequence
M
codes, the codec
ec pair can encode/decode multiple labels simultaneously.
Thus, all labels share the same hardware for coding process [6]. Then the SAC labels are combined with the payload bits to
form a packet.

Figure 1: Composite Label Generator Based on AWG

The proposed composite label processor is shown in Figure 2. At core node, the stacked labels are first filtered by
a filter that directs to the wavelength of BLS. Then the label is decoded by executing correlation subtraction. The multiple
label interference (MLI) is eliminated by a balanced detector, and we can know whether the label is matched or not. Only
when the label code of the incoming packet matches the one assigned to the core node, a matched indication signal is
generated, and the modulator stays in an on condition. In contrast, when the packet label does not match, no indication
signal exists, and the modulator remains in an off condition.

Impact Factor (JCC): 6.2143

NAAS Rating: 3.27

Reconfiguring Composite Coding Labels to Adapt to Packet Traffic in Optical MPLS Network

19

Figure 2: Composite Label Processor Based on AWG

COMPOSITE LABEL ASSIGNMENT FOR TRAFFIC ADAPTATION
Packet Routing in Light Traffic (7 Nodes with 3 Labels/Node)
For packet routing in light traffic situation, let there be three packets at the same time. We take M-sequence code
vectors C1 = (1,1,0) of length N1=3 and C2 = (1,1,1,0,0,1,0) of length N2=7 to build a composite label code space. By
combining each of the codes in code set #1 (C1, TC1 and T2C1) with code C2, we get a code a subset of TiC1C2, i=0, 1, 2,
where Ti the cyclic right shift operation of i chips and is the module-2 operation. Similarly, we can combine each of the
codes in code set #1 with code TC2 to get another code subset of TiC1TC2, i=0, 1, 2. In this way, each of the codes in
code set #1 can be assigned to codes of TjC2, j=0, 1, , 6, to get a composite code set of TiC1TjC2. Finally, there are total
seven groups, each of them providing three label codes for network label assignment.
A seven-node network topology with two LSPs (A-C-D-G) and (A-B-G) is shown in Figure 3. After the packet is
transmitted from its origination, each node on LSP checks the stacked labels sequentially to determine whether the packet
should be switched. When a packet has the matched label, it is simply passed to the next node.

Figure 3: Seven Core Nodes with Three Labels per Node for Packet Switching in Light Traffic
For LSP #1 in Figure 3, the stacked label is S1 = C1 + C3 + C4 + C7 = (132 212 111 223 213 322 123). Now we
need to recognize the labels of associated data packet from node A to node G. Table 1 enumerates correlation processes
www.tjprc.org

editor@tjprc.org

20

Kai-Sheng Chen, Jen-Fa Huang & Ting-Ru Su

between the stacked labels and the local one for this path. At node A, the correlation subtraction results in S1C1 S2C1 = 22
- 18 = 4 units energy. This means that a label code matches the one of node A. Then control signal of logic on is generated
and allows the data packet to pass to node C. At node C, the result of correlation subtraction is S1C2 S1C2 = 4 and the data
packet is again sent to node D. Similar procedures of label decoding can be used for LSP# 2, as shown in Table 1.
Table 1: Correlation Calculation at Each Node for Packet Routing in Light Traffic

Packet Routing in Heavy Traffic (3 Nodes with 7 Labels/Node)

For the situation of heavy packet traffic, let there be 7 packets at the same time. For such code assignment, we can
combine C1 with each of the codes in code set #2 (C2, TC2, ..., T6C5) to get a label code subset of C1TjC2, j=0, 1, , 6.
Similarly, we can combine the TC1 with each of codes in code set #2 to get another subset of TC1TjC2, j=0, 1, , 6. In
this way, there are total three groups, each of them providing seven label codes for network label assignment.
Figure 4 depicts the discussed heavy traffic case, where only three core nodes are available, each of them
including seven labels. The packet travels along LSP of (A-B-C) and the stacked label is S1 = C1 + C2 + C3 = (1221211
1221211 1221211). To recognize labels of the associated data packet at each node within path (A-B-C), correlations
between stacked label and the local one are sequentially evaluated. For node A, S1C1 S1C1 = 16 - 14 = 2, the label is
matched, and the packet is switched. Note that, if the packet comes from an un-destined route, label recognitions are failed.
Table 2 enumerates such correlation processes between stacked labels and the local node label for this path.

Impact Factor (JCC): 6.2143

NAAS Rating: 3.27

Reconfiguring Composite Coding Labels to Adapt to Packet Traffic in Optical MPLS Network

21

Figure 4: Three Core Nodes with Seven Labels per Node for Packet Switching in Heavy Traffic
Table 2: Correlation Calculation at Each Node for Packet Switching in Heavy Traffic

CONCLUSIONS
In this paper, we propose a new structure to implement optical MPLS. MLI between SAC-labels are cancelled
clearly by successful label recognition. The mechanism of traffic adaptation is demonstrated in the switching processes of
different LSPs. Based on the correlation subtraction results of the proposed composite labels, packet switching is achieved
both in light and heavy traffic.

www.tjprc.org

editor@tjprc.org

22

Kai-Sheng Chen, Jen-Fa Huang & Ting-Ru Su

REFERENCES
1.

Wei, Z., & Ghafouri-Shiraz, H. (2002). IP routing by an optical spectral amplitude-coding CDMA network. IEE ProceedingsCommunications, 149(56), 265-269.

2.

Black, U. (2002). MPLS and label switching networks, 2nd edition. Englewood Cliffs, NJ: Prentice-Hall.

3.

OMahony, M. J., Simeonidou, D., Hunter, D. K., & Tzanakaki, A. (2001). The application of optical packet switching in future
communication networks. IEEE Communications Magazine, 39(3), 128135.

4.

Mrabet, H., Dayoub, I., Attia, R. & Haxha, S. (2009). Performance improving of OCDMA system using 2-D optical codes with
optical SIC receiver. IEEE Journal of Lightwave and Technology, 27(21), 4744-4753.

5.

Huang, J. F., Chen, K. S., Lin, Y. C., & Li, C. Y. (2014). Reconfiguring waveguide gratings based M-signature codecs to
enhance OCDMA network confidentiality, Optics Communications, 313, 223-230.

6.

Yang, C. C., Huang, J. F., & Tseng, S. P. (2004). Optical CDMA network codecs structured with M-sequence codes over
waveguide-grating routers. IEEE Photonics Technology Letters, 16(2), 641-643.

Impact Factor (JCC): 6.2143

NAAS Rating: 3.27