About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
1st International IEEE Workshop on Optical Burst/Packet Switching

Research Article

Weight Functions for Shortest Path Routi Periodically Scheduled Burst Flows

Cite
BibTeX Plain Text
  • @INPROCEEDINGS{10.1109/BROADNETS.2007.4550404,
        author={Li Lei and Srinivas Sampalli},
        title={Weight Functions for Shortest Path Routi Periodically Scheduled Burst Flows},
        proceedings={1st International IEEE Workshop on Optical Burst/Packet Switching},
        proceedings_a={WOBS},
        year={2008},
        month={6},
        keywords={Assembly  Optical buffering  Optical burst switching  Optical packet switching  Quality of service  Scheduling  Telecommunication traffic  Traffic control  WDM networks  Wavelength routing},
        doi={10.1109/BROADNETS.2007.4550404}
    }
    
  • Li Lei
    Srinivas Sampalli
    Year: 2008
    Weight Functions for Shortest Path Routi Periodically Scheduled Burst Flows
    WOBS
    IEEE
    DOI: 10.1109/BROADNETS.2007.4550404
Li Lei1,*, Srinivas Sampalli1,*
  • 1: Faculty of Computer Science, Dalhousie University, Halifax, Nova Scotia B3H 1W5, Canada
*Contact email: llei@cs.dal.ca, srini@cs.dal.ca

Abstract

We investgate weighted shortest path routing mechanisms based on Dijkstra’s algorithm to find optimal paths for periodically scheduled burst flows in optical burst switching networks. Our objective is to reduce the flow blocking rate. We propose three dynamic weight functions to estimate the path level flow blocking probability based on wavelength utilization. We evaluate the performance of these weight functions using simulation. Results show that the weight function that incorporates both wavelength utilization and the number of inbound traffic sources has the best performance.

Keywords
Assembly Optical buffering Optical burst switching Optical packet switching Quality of service Scheduling Telecommunication traffic Traffic control WDM networks Wavelength routing
Published
2008-06-24
Modified
2011-08-09
http://dx.doi.org/10.1109/BROADNETS.2007.4550404
Copyright © 2007–2025 IEEE
EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL