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)
To meet challenging 5G capacity requirements, operators are densifying their cellular networks by deploying additional small cells to cover hot spots, and such an increase in the number and density of cells may result in excessive numbers of handovers. In this study, we propose a handover reduction mechanism implemented in a cloud radio access network(More)
Ingress nodes of Optical Burst Switching (OBS) networks are responsible for assembling burst out of incoming packets and to forward these bursts into the OBS network. The most common criteria for burst assembly are based either on time or on traffic volume. The change of the statistical characteristics of a traffic stream at an ingress switch can affect the(More)
Degraded provisioning provides an effective solution to flexibly allocate resources in various dimensions to reduce blocking for differentiated demands when network congestion occurs. In this work, we investigate the novel problem of online degraded provisioning in service-differentiated multi-layer networks with optical elasticity. Quality of Service (QoS)(More)
This paper introduces an optimal batch scheduling algorithm for the scheduling of batches of bursts in optical burst switching networks. The algorithm, called BATCHOPT, considers both the requests being processed in the current batch and the requests previously scheduled in the search for an optimal solution. Moreover, an extended version of the JET(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 a novel traffic grooming algorithm for the connection establishment of deadline-driven requests. The algorithm grooms batches of requests rather than individual requests. Results indicate that the algorithm is able to significantly reduce the blocking ratio and promote a fair distribution of blocking among source destination pairs of(More)