Gustavo B. Figueiredo

Learn More
— Minimum Interference Routing is instrumental to MPLS Traffic Engineering under realistic assumptions of unknown traffic demand. This work presents a new algorithm for minimum interference routing, called Light Minimum Interference Routing (LMIR). This algorithm introduces a new approach for critical link identification that reduces the computational(More)
Minimum Interference Routing algorithms are designed to reduce rejections of future requests for the establishment of Label Switched Paths (LSPs) but make no assumption about specific patterns of arrival request. This paper introduces a novel minimum interference routing algorithm, Light Minimum Interference Routing (LMIR), which is based on a new approach(More)
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(More)
This paper introduces optimal batch scheduling algorithms for the problem of scheduling batches of bursts in optical burst switching networks. The problem is modelled as a job scheduling problem with identical machines. The consideration of previously scheduled bursts in the scheduling allows such modeling. Two optimal algorithms with polynomial time(More)
Ingress nodes in optical burst switching (OBS) networks are responsible for assembling burst from incoming packets and forwarding these bursts into the OBS network core. Changes in the statistical characteristics of a traffic stream at an ingress switch can affect the capacity of the network to provide quality of service. Therefore, the statistical(More)