OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: O. Gerstel and P. Iannone
  • Vol. 6, Iss. 5 — May. 1, 2014
  • pp: 459–475

Scalable Fast Scheduling for Optical Flow Switching Using Sampled Entropy and Mutual Information Broadcast

Lei Zhang and Vincent Chan  »View Author Affiliations

Journal of Optical Communications and Networking, Vol. 6, Issue 5, pp. 459-475 (2014)

View Full Text Article

Enhanced HTML    Acrobat PDF (1087 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



Optical flow switching is a promising architecture to service large transactions of end users with cost-effective and power-efficient direct access to all-optical networks. For dynamic sessions that are bursty, unscheduled, and only require short transmission times at the full rate of a single wavelength (approximately ones to tens of seconds), the network management and control effort can be substantial, even unimplementable if fast booking and initiation of flow service is needed. In this paper, we describe a fast scheduling algorithm that sets up end-to-end connections for users with urgent large transactions with a scheduling delay of slightly more than one round-trip time. This fast setup of connections is achieved by probing multiple lightpaths between the source and the destination. Probing multiple lightpaths is necessary for moderate to high network loads to achieve low blocking probability. However, the network burden of network-state updates and computational complexity of scheduling can be overwhelming and make the algorithm hard to scale to large networks. With the help of information about network regions periodically updated in the form of sampled entropy and mutual information of the network states, the required efforts can be substantially reduced. To minimize probing efforts and avoid unnecessarily tying up network resources, we use a modified Bellman–Ford Algorithm (Entropy–BF) to select the fewest lightpaths for probing that can satisfy a service-level-blocking probability agreement between the user and the network provider. By collapsing details of network states into scalar parameters for average entropy and mutual information, we can greatly reduce both the amount of network-state information collected and/or disseminated and the computation complexity of the lightpath selection process of the probing algorithm. The algorithm is also robust to variations of traffic statistics because it does not depend on detailed assumptions about the statistical model of the traffic, which is often unknown and highly variable in real networks. The throughput performance of this access protocol can be kept high while the network-state protocol burden and computation efforts are reduced by orders of magnitude.

© 2014 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.1155) Fiber optics and optical communications : All-optical networks
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms

ToC Category:
Research Papers

Original Manuscript: August 19, 2013
Revised Manuscript: December 30, 2013
Manuscript Accepted: January 3, 2014
Published: April 15, 2014

Lei Zhang and Vincent Chan, "Scalable Fast Scheduling for Optical Flow Switching Using Sampled Entropy and Mutual Information Broadcast," J. Opt. Commun. Netw. 6, 459-475 (2014)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. V. Chan, “Optical flow switching networks,” Proc. IEEE, vol.  100, no. 5, pp. 1079–1091, May 2012. [CrossRef]
  2. K. X. Lin and V. W. S. Chan, “Power optimization of optical wide area networks,” in 2012 14th Int. Conf. Transparent Optical Networks (ICTON), July2–5, 2012, pp. 1–7.
  3. G. Weichenberg, V. Chan, and M. Medard, “Design and analysis of optical flow-switched networks,” J. Opt. Commun. Netw., vol.  1, no. 3, pp. B81–B97, Aug. 2009. [CrossRef]
  4. V. Chan, A. Ganguly, and G. Weichenberg, “Optical flow switching with time deadlines for high-performance applications,” in 2009 IEEE Global Telecommunications Conf. (GLOBECOM), Dec. 2009, pp. 1–8.
  5. J. M. Simmons, Optical Network Design and Planning. New York: Springer, 2008.
  6. D. P. Valiant, “The complexity of enumeration and reliability problems,” SIAM J. Comput., vol.  8, no. 3, pp. 410–421, 1979. [CrossRef]
  7. R. G. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer Academic, 1996.
  8. T. M. Cover and J. A. Thomas, Elements of Information Theory. Hoboken, NJ: Wiley, 2006.
  9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. MIT and McGraw-Hill, 2009.
  10. D. Williams, Probability With Martingales. Cambridge, UK: Cambridge University, 1991.
  11. D. P. Bertsekas, Nonlinear Programming. Belmont, MA: Athena Scientific, 1999.
  12. L. Zhang and V. Chan, “Fast scheduling of optical flow switching,” in 2010 IEEE Global Telecommunications Conf. (GLOBECOM), Dec. 6–10, 2010, pp. 1–6.

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