Name
Abstract | ||
|---|---|---|
This paper proposes a contention-free burst scheduling scheme in optically burst-switched WDM networks. We construct contention-free wavelength planes (lambda-planes) by assigning dedicated wavelengths to each ingress node. Bursts are transmitted to their egress nodes on lambda-planes, along routes forming a spanning tree. As a result, contention at intermediate core nodes is completely eliminated, and contention at ingress nodes is resolved by means of electric buffer. This paper develops a spanning tree construction algorithm, aiming at balancing input loads among output ports at each ingress node. Further a wavelength assignment algorithm is proposed, which is based on the amount of traffic lost at ingress nodes. We show that the proposed scheme can decrease the burst loss probability drastically, even if traffic intensities at ingress nodes are different. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1093/ietcom/e90-b.9.2524 | GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE |
Keywords | Field | DocType |
spanning tree | Wavelength-division multiplexing,Computer science,Computer network | Conference |
Volume | Issue | ISSN |
90-B | 9 | 1930-529X |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kouji Hirata | 1 | 10 | 11.28 |
| Takahiro Matsuda | 2 | 343 | 42.05 |
| Hiroshi Nagamochi | 3 | 1513 | 174.40 |
| Tetsuya Takine | 4 | 457 | 60.37 |