Paulo Pinto

Paulo Pinto

Auto-generated profile, based on publicly available information

Paulo Pinto

Universidade Nova de Lisboa

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

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

Representative Publications

View All Publications
19 December 2016
Verified
Conference Paper
Closed access
Pedro AmaralPedro Amaral
Pedro Amaral
JDJoao Dinis
Joao Dinis
PPPaulo Pinto
Paulo Pinto
LBLuis Bernardo
Luis Bernardo
Joao Manuel R.S. TavaresJoao Manuel R.S. Tavares
Joao Manuel R.S. Tavares
HMHenrique S. Mamede
Henrique S. Mamede
Software Defined Networks (SDNs) provides a separation between the control plane and the forwarding plane of networks. The software implementation of the control plane and the built in data collection mechanisms of the OpenFlow protocol promise to be excellent tools to implement Machine Learning (ML) network control applications. A first step in that direction is to understand the type of data that can be collected in SDNs and how information can be learned from that data. In this work we describe a simple architecture deployed in an enterprise network that gathers traffic data using the OpenFlow protocol. We present the data-sets that can be obtained and show how several ML techniques can be applied to it for traffic classification. The results indicate that high accuracy classification can be obtained with the data-sets using supervised learning.

1 February 2009 in Computer Communications
Verified
Journal Article
Closed access
RDRodolfo Oliveira - DEE
Rodolfo Oliveira - DEE
LBLuis Bernardo
Luis Bernardo
PPPaulo Pinto
Paulo Pinto

1 January 2007
Verified
Conference Paper
Closed access
LBLuis Bernardo
Luis Bernardo
RDRodolfo Oliveira - DEE
Rodolfo Oliveira - DEE
MPMiguel Pereira
Miguel Pereira
MMMario Macedo
Mario Macedo
PPPaulo Pinto
Paulo Pinto
This paper proposes MH-MAC, a new MAC protocol for wireless sensor networks capable of handling applications that generate infrequent huge peaks of traffic. Existing protocols are not adapted to this kind of applications. Asynchronous protocols are energy efficient for the long inactive periods, but fail to cope with the bandwidth and latency requirements of the traffic peaks when more than two nodes are sending data to a common sink. Synchronous protocols that support contention free slots provide good throughput for handling the load peaks, but consume unnecessary energy maintaining clocks synchronized for very long idle periods. MH-MAC is a multimode hybrid protocol that can be configured by the application to run in asynchronous mode or in synchronous mode, with or without contention, providing the best possible trade-off. MH-MAC is a single-hop MAC, which supports multi-hop applications through a cross-layering API. The paper includes simulation results with the energy consumption, latency and throughput for the operation modes of MH-MAC, showing the asynchronous-synchronous trade-offs and the state transition overhead.

1 April 2010
Verified
Conference Paper
Closed access
RDRodolfo Oliveira - DEE
Rodolfo Oliveira - DEE
MLMiguel Luís
Miguel Luís
LBLuis Bernardo
Luis Bernardo
Rui Miguel Henriques Dias DinisRui Miguel Henriques Dias Dinis
Rui Miguel Henriques Dias Dinis
PPPaulo Pinto
Paulo Pinto
Several routing protocols for Mobile Ad Hoc Networks (MANETS), including the well known Ad hoc On-Demand Distance Vector Routing (AODV) and Optimized Link State Routing (OLSR), propose the use of periodic messages (Hello messages) to detect neighbor nodes. After receiving the first Hello message from one of its neighbors, a node starts the link sensing task by setting up a sensing timer. Each time a new Hello message is received from the same neighbor, the sensing timer is restarted and the link duration is prolonged. If the sensing timer expires, it indicates a long time interval without receiving an Hello message and, consequently, the link is considered broken. The transmission frequency of the Hello messages and the expiration value of the sensing timer truly depends on node's mobility: if the nodes are moving quickly and the Hello messages are rarely transmitted, the neighbor nodes can be in communication range but they are not detected; in the same scenario, if the expiration value of the sensing timer is too high, a link is sensed broken too late. In this paper, we consider a MANET under the Random Waypoint mobility model. We investigate the relationship between the transmission frequency of the Hello messages and the sensing timer expiration value with the network node's mobility. We formally deduce the probability of link existence after β periods of transmission of the Hello message. The probability is later used to define the sensing timer expiration value, considering a given probability that the Hello message transmission fails. Finally, we evaluate our study through both numerically analysis and simulations, which confirms the effectiveness and accuracy of our approach.


1 January 2007
Verified
Conference Paper
Closed access
RDRodolfo Oliveira - DEE
Rodolfo Oliveira - DEE
LBLuis Bernardo
Luis Bernardo
PPPaulo Pinto
Paulo Pinto
The existing models for IEEE 802.11 DCF networks only consider unicast frames, ignoring the existence of broadcast traffic. In a real scenario, the stations are most of the times non-saturated and unicast and broadcast frames exist. These specific characteristics influence the service time which consequently affects the queue behaviour. In this paper, the authors model the total frame's delay for IEEE 802.11 DCF networks in presence of both unicast and broadcast traffic. Our theoretical analysis proposes a model able to compute the time between the instant when a new frame is inserted on the transmission queue and the instant when its transmission finishes. The time needed to serve a frame (service time) is formally deduced from the IEEE 802.11 transmission procedure, conceptually using the view of one network's node. The authors use an M/M/1/K queue model in order to model each frame's queueing delay. The authors validate the total frame's delay using several simulations and present some results. These are analysed for different scenarios of broadcast/unicast network loads and different number of nodes.