JPJeremy M. Plante
Jeremy M. Plante
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jeremy M. Plante has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Dylan A. P. Davis
University of Massachusetts Lowell
1 shared publication Vinod M. Vokkarane
J. M. Planteand V. M. Vokkarane are with the Department of Electrical and Computer Engineering, University of Massachusetts, Lowell, Massachusetts 01854, USA
1 shared publication- Vinod M. Vokkarane
Department of Electrical and Computer Engineering, University of Massachusetts Lowell, Lowell, MA, USA
1 shared publication
Latest Publications
- Open Access
- 23 December 2016
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 9 (1) , 119-137
Sliding Scheduled Lightpath Establishment With Time-Slotted Wavelength-Switching
Extreme-scale transmissions exhibit schedules dependent upon the equipment used to generate data, availability of the collaborators who will investigate and analyze the data, and the availability of storage and supercomputing resources, which must be dedicated to distribution, backup, computation, and visualization of data. Given such a wide array of dependencies, these applications, which are often scientific in nature, offer the luxury of in-advance reservation of network resources prior to the demand uptimes. Advance reservation (AR) allows for efficient scheduling around or in cooperation with competing reservations from other applications. This work focuses on static inputs to two classifications of AR demands: with and without sliding-window flexibility. We further introduce the ability for a demand to be assigned to more than one dedicated wavelength at different points throughout its lifetime depending on availability. This -switching functionality is incorporated at time-slot granularity, which limits the overhead associated with reconfiguring wavelength resources at runtime and enhances opportunities for scheduling efficiency. A novel -switching integer linear program is presented to evaluate this enhancement under varying degrees of temporal flexibility. Detailed and novel proofs are provided, which demonstrate that AR scheduling with and without -switching is in the complexity class -complete. Conservative heuristics are presented to harness the benefits of -switching while lowering the trade-off from transceiver reconfiguration overhead. Lower bounds also are developed as a baseline comparison for these heuristics, and we evaluate these solutions through extensive simulation. We also introduce the notion of considering time-slotted, wavelength-routed networks from the perspective of a finer resource granularity represented by the intersection of the temporal and spectral resource domains.- 23 December 2016
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 9 (1) , 119-137
Open AccessSliding Scheduled Lightpath Establishment With Time-Slotted Wavelength-Switching
Extreme-scale transmissions exhibit schedules dependent upon the equipment used to generate data, availability of the collaborators who will investigate and analyze the data, and the availability of storage and supercomputing resources, which must be dedicated to distribution, backup, computation, and visualization of data. Given such a wide array of dependencies, these applications, which are often scientific in nature, offer the luxury of in-advance reservation of network resources prior to the demand uptimes. Advance reservation (AR) allows for efficient scheduling around or in cooperation with competing reservations from other applications. This work focuses on static inputs to two classifications of AR demands: with and without sliding-window flexibility. We further introduce the ability for a demand to be assigned to more than one dedicated wavelength at different points throughout its lifetime depending on availability. This -switching functionality is incorporated at time-slot granularity, which limits the overhead associated with reconfiguring wavelength resources at runtime and enhances opportunities for scheduling efficiency. A novel -switching integer linear program is presented to evaluate this enhancement under varying degrees of temporal flexibility. Detailed and novel proofs are provided, which demonstrate that AR scheduling with and without -switching is in the complexity class -complete. Conservative heuristics are presented to harness the benefits of -switching while lowering the trade-off from transceiver reconfiguration overhead. Lower bounds also are developed as a baseline comparison for these heuristics, and we evaluate these solutions through extensive simulation. We also introduce the notion of considering time-slotted, wavelength-routed networks from the perspective of a finer resource granularity represented by the intersection of the temporal and spectral resource domains. - 7 August 2015
- Published by Springer Nature in Photonic Network Communications
- Vol. 30 (3) , 363-375
Parallel and survivable multipath circuit provisioning in ESnet’s OSCARS
- 7 August 2015
- Published by Springer Nature in Photonic Network Communications
- Vol. 30 (3) , 363-375
Parallel and survivable multipath circuit provisioning in ESnet’s OSCARS