Three-Domain Burst Scheduling in Optically Burst-Switched WDM Networks

Kouji Hirata; Takahiro Matsuda; Tetsuya Takine

doi:10.1364/JOCN.2.000332

Journal of Optical Communications and Networking
Vol. 2,
Issue 6,
pp. 332-343
(2010)
•https://doi.org/10.1364/JOCN.2.000332

Three-Domain Burst Scheduling in Optically Burst-Switched WDM Networks

Kouji Hirata, Takahiro Matsuda, and Tetsuya Takine

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Kouji Hirata, Takahiro Matsuda, and Tetsuya Takine, "Three-Domain Burst Scheduling in Optically Burst-Switched WDM Networks," J. Opt. Commun. Netw. 2, 332-343 (2010)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Abstract

This paper proposes three-domain (3-D) burst scheduling in optically burst-switched WDM networks. This scheme completely eliminates contention at intermediate core nodes by combining contention avoidance schemes in the space, wavelength, and time domains. In the space and wavelength domains, the proposed scheme constructs multiple fixed, tree-shaped routes for burst transmission called λ-trees, each of which is assigned a wavelength. Note that λ-trees with the same wavelength do not share any links, and therefore the proposed scheme provides contention-free transmission among bursts transmitted on different λ-trees. Furthermore, in the time domain, the proposed scheme introduces an ingenious offset time assignment scheme named burst grooming, which eliminates contention on each λ-tree. As a result, contention at intermediate core nodes is completely eliminated because each ingress node schedules incoming bursts onto λ-trees with burst grooming. We provide λ-tree construction and burst scheduling algorithms, which aim to minimize the overall burst loss probability. Extensive simulation experiments show that the proposed scheme improves the overall burst loss performance dramatically without wavelength conversion.

Full Article | PDF Article

More Like This

High-Priority First Transmission to Efficiently Support Service Differentiation in Just-in-Time OBS Networks

Guido Marchetto
J. Opt. Commun. Netw. 2(12) 1031-1041 (2010)

Investigation of the Design of MAC Protocols for TT-TR-Based WDM Burst-Switched Ring Networks

Li-Mei Peng and Young-Chon Kim
J. Opt. Commun. Netw. 1(2) A25-A34 (2009)

Performance Evaluation of an Optical Burst Switched Core Node With Generalized Arrivals and Partial Wavelength Conversion Capability

Mohamed H. Morsy-Osman, Mohammed Y. S. Sowailem, Ahmed I. Abd El-Rahman, and Hossam M. H. Shalaby
J. Opt. Commun. Netw. 4(12) 997-1007 (2012)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (16)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (2)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (9)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription


$G = (V, E)$	a directed graph
$W$	a set of wavelengths
$λ_{i, j}$	the mean arrival rate of bursts transmitted from ingress node $i ∊ V$ to egress node $j ∊ V$
$M_{λ}$	a matrix of $λ_{i, j}$ $(i, j ∊ V)$
$Λ_{i, j}$	the amount of overflow traffic from ingress node $i ∊ V$ to egress node $j ∊ V$
$P_{i, j}$	the loss probability of bursts transmitted from node $i ∊ V$ to node $j ∊ V$ in a new established λ-tree
$L_{p}$	a set of primary λ-trees
$L_{s}$	a set of secondary λ-trees
$X_{w}$	a set of edges to which wavelength $w ∊ W$ is assigned
$T_{i} = (V, E_{i})$	a spanning tree of G with node $i ∊ V$ as the root
$G_{w}$	a subgraph of G for wavelength $w ∊ W$
$G_{i, w}$	a subgraph of $G_{w}$ $(w ∊ W)$ , which consists of all reachable nodes and edges from ingress node $i ∊ V$ on $G_{w}$
$T_{i, w}$	a spanning tree of $G_{i, w}$ $(i ∊ V, w ∊ W)$ , whose root is node i
$E_{i}$	a set of edges from node $i ∊ V$
$T_{i, e, w} =$ $(V_{i, e, w}, E_{i, e, w})$	a partial tree of $T_{i, w}$ $(i ∊ V, w ∊ W)$ , which includes edge $e ∊ E_{i}$ , with node i as the root
$T$	a set of $T_{i, e, w}$
$J_{i, e, w}$	a set of egress nodes on $T_{i, e, w}$ ( $i ∊ V$ , $e ∊ E$ , $w ∊ W$ )
$R_{i, e, w}$	the total amount of overflow traffic from ingress node $i ∊ V$ to each egress node $j ∊ J_{i, e, w}$
$U (T_{i, e, w})$	a set of ingress nodes on a tree $T_{i, e, w}$ except the root ingress node
$D_{k} (T_{i, e, w})$	a set of egress nodes of ingress node $k ∊ U (T_{i, e, w})$ on a tree $T_{i, e, w}$


$G = (V, E)$	a directed graph
$W$	a set of wavelengths
$λ_{i, j}$	the mean arrival rate of bursts transmitted from ingress node $i ∊ V$ to egress node $j ∊ V$
$M_{λ}$	a matrix of $λ_{i, j}$ $(i, j ∊ V)$
$Λ_{i, j}$	the amount of overflow traffic from ingress node $i ∊ V$ to egress node $j ∊ V$
$P_{i, j}$	the loss probability of bursts transmitted from node $i ∊ V$ to node $j ∊ V$ in a new established λ-tree
$L_{p}$	a set of primary λ-trees
$L_{s}$	a set of secondary λ-trees
$X_{w}$	a set of edges to which wavelength $w ∊ W$ is assigned
$T_{i} = (V, E_{i})$	a spanning tree of G with node $i ∊ V$ as the root
$G_{w}$	a subgraph of G for wavelength $w ∊ W$
$G_{i, w}$	a subgraph of $G_{w}$ $(w ∊ W)$ , which consists of all reachable nodes and edges from ingress node $i ∊ V$ on $G_{w}$
$T_{i, w}$	a spanning tree of $G_{i, w}$ $(i ∊ V, w ∊ W)$ , whose root is node i
$E_{i}$	a set of edges from node $i ∊ V$
$T_{i, e, w} =$ $(V_{i, e, w}, E_{i, e, w})$	a partial tree of $T_{i, w}$ $(i ∊ V, w ∊ W)$ , which includes edge $e ∊ E_{i}$ , with node i as the root
$T$	a set of $T_{i, e, w}$
$J_{i, e, w}$	a set of egress nodes on $T_{i, e, w}$ ( $i ∊ V$ , $e ∊ E$ , $w ∊ W$ )
$R_{i, e, w}$	the total amount of overflow traffic from ingress node $i ∊ V$ to each egress node $j ∊ J_{i, e, w}$
$U (T_{i, e, w})$	a set of ingress nodes on a tree $T_{i, e, w}$ except the root ingress node
$D_{k} (T_{i, e, w})$	a set of egress nodes of ingress node $k ∊ U (T_{i, e, w})$ on a tree $T_{i, e, w}$

Abstract

Cited By

Figures (16)

Tables (2)

Equations (9)

Journal of Optical Communications and Networking