Journal of High Speed Networks - Special issue on optical networking
On the equivalent bandwidth of self-similar sources
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and simulation of communication networks
Schedule burst proactively for optical burst switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A minimum interference routing algorithm with reduced computational complexity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Envelope process and computation of the equivalent bandwidth of multifractal flows
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Control architecture in optical burst-switched WDM networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Efficient burst scheduling algorithms in optical burst-switched networks using geometric techniques
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Optical burst switching: a new area in optical networking research
IEEE Network: The Magazine of Global Internetworking
Threshold-based preemption scheme for improving throughput in OBS networks
Photonic Network Communications
Photonic Network Communications
| Hi-index | 0.00 |
This paper presents a novel channel scheduling policy for optical burst switching networks called least reusable channel (LRC). LRC decides to which interval of the output channel (void) an incoming burst should be allocated on the basis of reuse of the remaining voids. LRC dynamically uses information available to make allocation decisions. It is shown here that LRC produces lower blocking probability and distributes losses more uniformly among routes than do other existing scheduling policies.