OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Richard A. Linke
  • Vol. 6, Iss. 2 — Feb. 1, 2007
  • pp: 166–179

Virtual topology-based traffic scheduling algorithm for slotted optical networks

Yang Qin, Daojun Xue, and Chee Kheong Siew  »View Author Affiliations


Journal of Optical Networking, Vol. 6, Issue 2, pp. 166-179 (2007)
http://dx.doi.org/10.1364/JON.6.000166


View Full Text Article

Acrobat PDF (272 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

We consider the scheduling problem in a new slotted optical network called TWIN. The TWIN architecture possesses interesting properties, which may offer solutions for next-generation optical networks. Besides, TWIN has the ability to support quality of service (QoS) by controlling two important parameters: queueing delay and delay variance. However, to the best of our knowledge, the existing scheduling algorithms in TWIN focused mainly on maximizing the throughput and ignored the consideration of QoS. We formulate the scheduling problem into an integer linear programming problem and propose a heuristic--virtual topology-based dynamic scheduling (VTBDS) algorithm to solve it fast and efficiently. Besides, we derive an analytical model for TWIN and investigate the performance of VTBDS in it. By means of simulations, we demonstrate that our model approximates the TWIN network very well, and VTBDS incurs smaller queueing delay and delay variance, which are advantageous for guaranteeing better QoS.

© 2007 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.4510) Fiber optics and optical communications : Optical communications

ToC Category:
RESEARCH PAPERS

History
Original Manuscript: August 18, 2006
Revised Manuscript: November 27, 2006
Manuscript Accepted: November 30, 2006
Published: January 24, 2007

Citation
Yang Qin, Daojun Xue, and Chee Kheong Siew, "Virtual topology-based traffic scheduling algorithm for slotted optical networks," J. Opt. Netw. 6, 166-179 (2007)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-6-2-166


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. A. Chiu and E. Modiano, 'Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks,' J. Lightwave Technol. 18, 2-12 (2000). [CrossRef]
  2. S. Yao, S. Dixit, and B. Mukherjee, 'Advances in photonic packet switchings: an overview,' IEEE Commun. Mag. 84-94 (2000).
  3. C. Qiao and M. Yoo, 'Optical burst switching (OBS)--a new paradigm for an optical Internet,' J. High Speed Networks 8, 69-84 (1999).
  4. I. Widjaja, I. Saniee, R. Giles, and D. Mitra, 'Light core and intelligent edge for a flexible, thin-layered and cost-effective optical transport network,' IEEE Commun. Mag. 41, S30-S365 (2003).
  5. C. Nuzman and I. Widjaja, 'Time-domain wavelength interleaved networking with wavelength reuse,' in Proceedings of IEEE INFOCOM (IEEE, 2006).
  6. K. Ross, N. Bambos, K. Kumaran, I. Saniee, and I. Widjaja, 'Scheduling bursts in time-domain wavelength interleaved networks,' IEEE J. Sel. Areas Commun. 21, 1441-1451 (2003).
  7. L. Zhang, 'Virtual clock: a new traffic control algorithm for packet switching networks,' in Proceedings of ACM SIGCOMM (1990).
  8. A. K. Parekh and R. G. Gallager, 'A generalized processor sharing approach to flow control: the single node case,' in Proceedings of IEEE INFOCOM (IEEE, 1992).
  9. J. C. R. Bennett and H. Zhang, 'WF2Q: worst-case fair weighted fair queueing,' in Proceedings of IEEE INFOCOM (IEEE, 1996).
  10. N. McKeown, 'The iSLIP scheduling algorithm for input-queued switches,' IEEE/ACM Trans. Netw. 7, 188-201 (1999).
  11. W. Wang, L. Dong, and W. Wolf, 'iSKIP: a fair and efficient scheduling algorithm for input-queued crossbar switches,' in Proceedings of IEEE Global Telecommunications Conference (GLOBECOM) (IEEE, 2002).
  12. K. Ross, N. Bambos, K. Kumaran, I. Saniee, and I. Widjaja, 'Dynamic scheduling of optical data bursts in time-domain wavelength interleaved networks,' in Proceedings of IEEE Symposium on Hot Interconnects (HOTI 2003) (IEEE, 2003).
  13. Y. Qin, D.-J. Xue, C. K. Siew, I. Saniee, and I. Widjaja, 'A topology based dynamic traffic scheduling in time-domain wavelength interleaved networks,' in Proceedings of IEEE International Conference on Networks (ICON) (IEEE, 2004).
  14. D.-J. Xue, Y. Qin, and C. K. Siew, 'A slotted dynamic traffic scheduling algorithm in time-domain wavelength interleaved networks,' in Proceedings of IEEE International Conference on Networks (ICON) (IEEE, 2005).
  15. J. von Neumann, 'A certain zero-sum two-person game equivalent to the optimal assignment problem,' Contrib. Theory Games 2, 147-151 (1946).
  16. B. Li and Y. Qin, 'Traffic scheduling in a photonic packet switching system with QoS guarantee,' J. Lightwave Technol. 16, 2281-2295 (1998).
  17. L. Kleinrock, Queueing Systems, Volume I: Theory (Wiley, 1976), pp. 189-191.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited