scispace - formally typeset
R

Roberto Rojas-Cessa

Researcher at New Jersey Institute of Technology

Publications -  210
Citations -  2690

Roberto Rojas-Cessa is an academic researcher from New Jersey Institute of Technology. The author has contributed to research in topics: Network packet & Clos network. The author has an hindex of 24, co-authored 201 publications receiving 2324 citations. Previous affiliations of Roberto Rojas-Cessa include Wilmington University & New York University.

Papers
More filters
Journal ArticleDOI

A Survey on Acquisition, Tracking, and Pointing Mechanisms for Mobile Free-Space Optical Communications

TL;DR: This survey categorizes ATP mechanisms according to their working principles, use cases, and implementation technology to discuss advantages and disadvantages of the surveyed ATP mechanisms, and presents a discussion on challenges and future research.
Proceedings ArticleDOI

CIXB-1: combined input-one-cell-crosspoint buffered switch

TL;DR: This work proposes a novel architecture: a combined input-one-cell-crosspoint buffer crossbar (CIXB-1) with virtual output queues (VOQs) at the inputs and round-robin arbitration that can provide 100% throughput under uniform traffic.
Proceedings ArticleDOI

CIXOB-k: combined input-crosspoint-output buffered packet switch

TL;DR: A novel architecture, a combined input-crosspoint-output buffered (CIXOB-k, where k is the size of the crosspoint buffer) Switch, which provides 100% throughput under uniform and unbalanced traffic and provides timing relaxation and scalability.
Journal ArticleDOI

Concurrent round-robin-based dispatching schemes for Clos-network switches

TL;DR: Two round-robin-based dispatching schemes to overcome the throughput limitation of the RD scheme are presented and it is shown that CMSD preserves the advantages of CRRD, reduces the scheduling time by 30% or more when arbitration time is significant and has a dramatically reduced number of crosspoints of the interconnection wires between round- robin arbiters in the dispatching scheduler with a ratio of 1/√N.
Journal ArticleDOI

Greedy scheduling of tasks with time constraints for energy-efficient cloud-computing data centers

TL;DR: This paper forms the assignments of tasks to servers as an integer-programming problem with the objective of minimizing the energy consumed by the servers of the data center, and proves that the use of a greedy task scheduler bounds the constraint service time whilst minimizing the number of active servers.