Roberto Rojas-Cessa

Roberto Rojas-Cessa

Auto-generated profile, based on publicly available information

Roberto Rojas-Cessa

Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 April 2007 in Computer Communications
Verified
Journal Article
Closed access
RRRoberto Rojas-Cessa
Roberto Rojas-Cessa
CLChuan-Bi Lin
Chuan-Bi Lin

18 October 2013 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
KSKhondaker M. Salehin
Khondaker M. Salehin
RRRoberto Rojas-Cessa
Roberto Rojas-Cessa
CLChuan-Bi Lin
Chuan-Bi Lin
ZDZiqian (Cecilia) Dong
Ziqian (Cecilia) Dong
TKTaweesak Kijkanjanarat
Taweesak Kijkanjanarat
As transmission speeds increase faster than processing speeds, the packet processing time (PPT) of a host is becoming more significant in the measurement of different network parameters in which packet processing by the host is involved. The PPT of a host is the time elapsed between the arrival of a packet at the data-link layer and the time the packet is processed at the application layer (RFCs 2679 and 2681). To measure the PPT of a host, stamping the times when these two events occur is needed. However, time stamping at the data-link layer may require placing a specialized packet-capture card and the host under test in the same local network. This makes it complex to measure the PPT of remote end hosts. In this paper, we propose a scheme to measure the PPT of an end host connected over a single- or multiple-hop path and without requiring time stamping at the data-link layer. The proposed scheme is based on measuring the capacity of the link connected to the host under test. The scheme was tested on an experimental testbed and in the Internet, over a U.S. inter-state path and an international path between Taiwan and the U.S. We show that the proposed scheme consistently measures PPT of a host.

26 February 2007 in IEEE Communications Letters
Verified
Journal Article
Closed access
CLChuan-Bi Lin
Chuan-Bi Lin
RRRoberto Rojas-Cessa
Roberto Rojas-Cessa
Current schemes for configuration of input-queued three-stage Clos-network (IQC) switches involve port matching and path routing assignment, in that order. The implementation of a scheduler capable of matching thousands of ports in large-size switches is complex. To decrease the scheduler complexity for such switches (e.g., 1024 ports or more), we propose a configuration scheme for IQC switches that hierarchizes the matching process. In a practical scenario our scheme performs routing first and port matching thereafter. This approach reduces the scheduler size and the configuration complexity of IQC switches. We show that the switching performance of the proposed approach using weight-based and weightless selection schemes is high under uniform and nonuniform traffic

1 April 2006
Verified
Conference Paper
Closed access
RRRoberto Rojas-Cessa
Roberto Rojas-Cessa
ZDZiqian Dong
Ziqian Dong
The performance of Internet routers is greatly defined by the adopted switch architecture. Combined input-crosspoint buffered (CICB) packet switches are being considered of research interest because of their high switching performance. One of the main requirements in these switches is that the amount of memory needed to achieve 100% throughput under flows with high data rates must be proportional to the number of ports and crosspoint buffer size, which is set by the distance between the line cards and the buffered crossbar. Therefore, long distances between the line cards and the buffered crossbar can make a CICB switch costly to implement or infeasible. In this paper, we propose and discuss two CICB packet switches with flexible access to crosspoint buffers. The proposed switches allow an input to use any available crosspoint buffer at a given output, instead of having rigid access where an input can only access a dedicated crosspoint buffer at a given output, as is the case on previous existing architectures. The proposed switches provide high switching performance and support long distances between the buffered crossbar and the line cards, while using crosspoint buffers of small size. Our switches reduce the required crosspoint buffer size by a factor of TV, where TV is the number of ports, keep service of cells in sequence, and use no speedup

1 March 2006
Verified
Conference Paper
Closed access
ZQZhen Qin
Zhen Qin
RRRoberto Rojas-Cessa
Roberto Rojas-Cessa
NANirwan Ansari
Nirwan Ansari
Networks with quality of service (QoS) provisioning rely on QoS routing schemes to select paths between end-to-end hosts that can satisfy the requested service requirements. In this paper, we focus on networks that use a new service paradigm as a nested DiffServ model, which has been described as service vectors in combination with the explicit end-point admission control (EEAC) scheme [1]. The main objectives of service vectors are to improve the QoS granularity and service routing flexibility. These improvements enhances both network utilization and user benefits. However, QoS routing schemes need to consider service vectors to achieve such improvements. In this paper, we discuss a new set of requirements that are added into QoS routing schemes to avoid false routing and low network utilization when using service vectors. The OSPF protocol, as the widely used protocol, guarantees feasible deployability of service vectors in existing networks. Furthermore, we introduce a network architecture that integrates security into the set of QoS parameters and show how security-enabled QoS (SQoS) can also use the OSPF protocol for SQoS routing.

12 May 2011 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
RRRoberto Rojas-Cessa
Roberto Rojas-Cessa
ZDZiqian (Cecilia) Dong
Ziqian (Cecilia) Dong
Combined input-crosspoint buffered (CICB) switches can achieve high switching performance without speedup. However, the dedicated crosspoint buffers in a CICB switch may not be efficiently used, and throughput degradation may occur. This throughput degradation is especially observable under flows with high data rates and long distances between the line cards and the buffered crossbar. This paper introduces two load-balanced CICB switches: the load-balancing CICB switch with full access (LB-CICB-FA) and the load-balancing CICB switch with single access (LB-CICB-SA). The proposed switches use the crosspoint buffers efficiently and support long distances between the line cards and buffered crossbar with crosspoint buffers smaller than those in a CICB switch by a factor of N, where N is the number of ports. It is proven that the LB-CICB-FA switch with random selection of the configuration of the load-balancing stage, input queues, and crosspoint queues is weakly stable under admissible independent and identical distributed (i.i.d.) traffic. Additional simulation results support the correctness of the theoretical analysis. Furthermore, it is shown that the throughput of the LB-CICB-SA switch with the longest-queue first (LQF) and first-come first-served (FCFS) as input and output arbitrations, respectively, is 100% under admissible i.i.d. traffic. The proposed switches keep cells in sequence and use no speedup. The low implementation complexity of the load-balancing stage is discussed and shown to be small.