The Software-Defined Networking (SDN) paradigm does represent an effective approach aimed at enha... more The Software-Defined Networking (SDN) paradigm does represent an effective approach aimed at enhancing the performance of core networks by introducing a clean separation between the routing plane and the forwarding plane. However, the centralized architecture of SDN networks raises resiliency concerns that are addressed by a class of algorithms falling under the Controller Placement Problem (CPP) umbrella term. Such algorithms seek the optimal placement of the SDN controller. In this paper, we evaluate the main CPP algorithms and provide an experimental analysis of their performance, as well as of their capability to dynamically adapt to network malfunctions and disconnections.
ABSTRACT Wireless Sensor Networks have proven their capability to deal with problems where wide a... more ABSTRACT Wireless Sensor Networks have proven their capability to deal with problems where wide and hardly accessible areas need to be monitored. Among the other systems there are also sensor networks in which nodes can voluntarily modify their positions to better adapt to changes of monitored phenomenon. One of the major issues arising in these situations is the energy consumption: as all the movements affect the batteries lifetime, the life of a sensor can be extended by equipping the device with power generators that exploit renewable sources, albeit this solution does not always avoid a full battery discharge. In this paper a Fluid Stochastic Petri Net modelling framework is presented to provide a wide evaluation of all the factors that contribute to the energy dissipation in mobile wireless sensor nodes. The framework allows the generation of extensible and composable models capable to evaluate the energy consumption due to sensing, communication and movement functions as well as the impact of power saving mechanisms on the energetical balance of the node. The approach is applied to a marine sensing problem and is validated by comparing the model analysis results with experimental results achieved through an existing off-the-shelf sensor network simulator.
Journal of Network and Computer Applications, 2016
Abstract Energy saving is currently one of the most challenging issues for the Internet research ... more Abstract Energy saving is currently one of the most challenging issues for the Internet research community. Indeed, the exponential growth of applications and services induces a remarkable increase in power consumption and hence calls for novel solutions which are capable to preserve energy of the infrastructures, at the same time maintaining the required Quality of Service guarantees. In this paper we introduce a new mechanism for saving energy through intelligent switch off of network links. The mechanism has been implemented as an extension to the Open Shortest Path First routing protocol. We first show through simulations that our solution is capable to dramatically reduce energy consumption when compared to the standard OSPF implementation. We then illustrate a real-world implementation of the proposed protocol within the Quagga routing software suite.
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2015
Unfairness in wireless ad hoc networks is often due to the different ways the single nodes decide... more Unfairness in wireless ad hoc networks is often due to the different ways the single nodes decide to participate in relay operations. We propose to introduce a dedicated ad hoc routing protocol based on results of game theory to force the cooperation of less operative nodes and mitigate the effort of overwhelmed ones. Simulations on an experimental testbed show a better distribution of the energy consumption and an increased fairness in the average delivery ratio achieved by nodes, as well as a prolonged network lifetime.
2010 Second International Conference on Advances in Future Internet, 2010
AbstractCurrent ad hoc networks rely on a silent mutual agreement among nodes to relay packets t... more AbstractCurrent ad hoc networks rely on a silent mutual agreement among nodes to relay packets to the destinations. The efforts made by each single node to serve the others are usually repaid with the chance to successfully set up its own traffic sessions. However, limited power, ...
First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007
... Engineering Dept. SW7 2BT London, UK g.sakellari@imperial.ac.uk MaurizioD'Arienzo Second... more ... Engineering Dept. SW7 2BT London, UK g.sakellari@imperial.ac.uk MaurizioD'Arienzo Seconda Universit`a degli studi di Napoli Via del setificio 15 San Leucio (CE) 81020, Italy maudarie@unina.it Abstract Multimedia traffic ...
... 10. D'Arienzo M, Romano SP, Ventre G. DiVA: QoS-aware streaming of multimedia content ov... more ... 10. D'Arienzo M, Romano SP, Ventre G. DiVA: QoS-aware streaming of multimedia content over the Internet. Proceedings of PROMS 2000, Krakov, October 2000. 11. ... 1629). Springer: Berlin, 1999; 229245. Copyright c 2003 John Wiley & Sons, Ltd. Softw. Pract. Exper. ...
Abstract This paper presents a market-enabling framework where users, content providers and netwo... more Abstract This paper presents a market-enabling framework where users, content providers and network operators can interact in the seamless, transparent sale and delivery of a wide range of services. The framework allows for dynamic creation, configuration and delivery of services with quality assurance, via automated management of Service Level Agreements (SLAs). We propose an approach relying on a systemic treatment
ABSTRACT To make an ad hoc network work properly, wireless nodes are usually requested to coopera... more ABSTRACT To make an ad hoc network work properly, wireless nodes are usually requested to cooperate in routing operations. However, there is currently a lack of behavior-tracking mechanisms, so certain nodes can freely play a selfish role at the detriment of altruistic ones. In this paper we try to answer the question in the title, by showing how cooperation can definitely help reduce the overall energy consumed in an ad hoc network. By exploiting a behavior-tracking algorithm mutuated from game theory, we allow traffic to be forwarded only towards cooperative nodes. We hence prove that we can reduce power wastage at the same time maximizing the delivery rate. With the mentioned approach, selfish nodes are isolated from the network unless they decide to start cooperating. Our experimental tests aim at verifying the quick reaction time in response to variable nodes’ behaviors as well as presenting a comparative analysis of the actual energy spent to successfully send traffic towards destinations.
ACM Transactions on Autonomous and Adaptive Systems, 2008
Smart networks have grown out of the need for stable, reliable, and predictable networks that wil... more Smart networks have grown out of the need for stable, reliable, and predictable networks that will guarantee packet delivery under Quality of Service (QoS) constraints. In this article we present a measurement-based admission control algorithm that helps control traffic congestion and guarantee QoS throughout the lifetime of a connection. When a new user requests to enter the network, probe packets are sent from the source to the destination to estimate the impact that the new connection will have on the QoS of both the new and the existing users. The algorithm uses a novel algebra of QoS metrics, inspired by Warshall's algorithm, to look for a path with acceptable QoS values to accommodate the new flow. We describe the underlying mathematical principles and present experimental results obtained by evaluating the method in a large laboratory test-bed operating the Cognitive Packet Network (CPN) protocol.
The Software-Defined Networking (SDN) paradigm does represent an effective approach aimed at enha... more The Software-Defined Networking (SDN) paradigm does represent an effective approach aimed at enhancing the performance of core networks by introducing a clean separation between the routing plane and the forwarding plane. However, the centralized architecture of SDN networks raises resiliency concerns that are addressed by a class of algorithms falling under the Controller Placement Problem (CPP) umbrella term. Such algorithms seek the optimal placement of the SDN controller. In this paper, we evaluate the main CPP algorithms and provide an experimental analysis of their performance, as well as of their capability to dynamically adapt to network malfunctions and disconnections.
ABSTRACT Wireless Sensor Networks have proven their capability to deal with problems where wide a... more ABSTRACT Wireless Sensor Networks have proven their capability to deal with problems where wide and hardly accessible areas need to be monitored. Among the other systems there are also sensor networks in which nodes can voluntarily modify their positions to better adapt to changes of monitored phenomenon. One of the major issues arising in these situations is the energy consumption: as all the movements affect the batteries lifetime, the life of a sensor can be extended by equipping the device with power generators that exploit renewable sources, albeit this solution does not always avoid a full battery discharge. In this paper a Fluid Stochastic Petri Net modelling framework is presented to provide a wide evaluation of all the factors that contribute to the energy dissipation in mobile wireless sensor nodes. The framework allows the generation of extensible and composable models capable to evaluate the energy consumption due to sensing, communication and movement functions as well as the impact of power saving mechanisms on the energetical balance of the node. The approach is applied to a marine sensing problem and is validated by comparing the model analysis results with experimental results achieved through an existing off-the-shelf sensor network simulator.
Journal of Network and Computer Applications, 2016
Abstract Energy saving is currently one of the most challenging issues for the Internet research ... more Abstract Energy saving is currently one of the most challenging issues for the Internet research community. Indeed, the exponential growth of applications and services induces a remarkable increase in power consumption and hence calls for novel solutions which are capable to preserve energy of the infrastructures, at the same time maintaining the required Quality of Service guarantees. In this paper we introduce a new mechanism for saving energy through intelligent switch off of network links. The mechanism has been implemented as an extension to the Open Shortest Path First routing protocol. We first show through simulations that our solution is capable to dramatically reduce energy consumption when compared to the standard OSPF implementation. We then illustrate a real-world implementation of the proposed protocol within the Quagga routing software suite.
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2015
Unfairness in wireless ad hoc networks is often due to the different ways the single nodes decide... more Unfairness in wireless ad hoc networks is often due to the different ways the single nodes decide to participate in relay operations. We propose to introduce a dedicated ad hoc routing protocol based on results of game theory to force the cooperation of less operative nodes and mitigate the effort of overwhelmed ones. Simulations on an experimental testbed show a better distribution of the energy consumption and an increased fairness in the average delivery ratio achieved by nodes, as well as a prolonged network lifetime.
2010 Second International Conference on Advances in Future Internet, 2010
AbstractCurrent ad hoc networks rely on a silent mutual agreement among nodes to relay packets t... more AbstractCurrent ad hoc networks rely on a silent mutual agreement among nodes to relay packets to the destinations. The efforts made by each single node to serve the others are usually repaid with the chance to successfully set up its own traffic sessions. However, limited power, ...
First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007
... Engineering Dept. SW7 2BT London, UK g.sakellari@imperial.ac.uk MaurizioD'Arienzo Second... more ... Engineering Dept. SW7 2BT London, UK g.sakellari@imperial.ac.uk MaurizioD'Arienzo Seconda Universit`a degli studi di Napoli Via del setificio 15 San Leucio (CE) 81020, Italy maudarie@unina.it Abstract Multimedia traffic ...
... 10. D'Arienzo M, Romano SP, Ventre G. DiVA: QoS-aware streaming of multimedia content ov... more ... 10. D'Arienzo M, Romano SP, Ventre G. DiVA: QoS-aware streaming of multimedia content over the Internet. Proceedings of PROMS 2000, Krakov, October 2000. 11. ... 1629). Springer: Berlin, 1999; 229245. Copyright c 2003 John Wiley & Sons, Ltd. Softw. Pract. Exper. ...
Abstract This paper presents a market-enabling framework where users, content providers and netwo... more Abstract This paper presents a market-enabling framework where users, content providers and network operators can interact in the seamless, transparent sale and delivery of a wide range of services. The framework allows for dynamic creation, configuration and delivery of services with quality assurance, via automated management of Service Level Agreements (SLAs). We propose an approach relying on a systemic treatment
ABSTRACT To make an ad hoc network work properly, wireless nodes are usually requested to coopera... more ABSTRACT To make an ad hoc network work properly, wireless nodes are usually requested to cooperate in routing operations. However, there is currently a lack of behavior-tracking mechanisms, so certain nodes can freely play a selfish role at the detriment of altruistic ones. In this paper we try to answer the question in the title, by showing how cooperation can definitely help reduce the overall energy consumed in an ad hoc network. By exploiting a behavior-tracking algorithm mutuated from game theory, we allow traffic to be forwarded only towards cooperative nodes. We hence prove that we can reduce power wastage at the same time maximizing the delivery rate. With the mentioned approach, selfish nodes are isolated from the network unless they decide to start cooperating. Our experimental tests aim at verifying the quick reaction time in response to variable nodes’ behaviors as well as presenting a comparative analysis of the actual energy spent to successfully send traffic towards destinations.
ACM Transactions on Autonomous and Adaptive Systems, 2008
Smart networks have grown out of the need for stable, reliable, and predictable networks that wil... more Smart networks have grown out of the need for stable, reliable, and predictable networks that will guarantee packet delivery under Quality of Service (QoS) constraints. In this article we present a measurement-based admission control algorithm that helps control traffic congestion and guarantee QoS throughout the lifetime of a connection. When a new user requests to enter the network, probe packets are sent from the source to the destination to estimate the impact that the new connection will have on the QoS of both the new and the existing users. The algorithm uses a novel algebra of QoS metrics, inspired by Warshall's algorithm, to look for a path with acceptable QoS values to accommodate the new flow. We describe the underlying mathematical principles and present experimental results obtained by evaluating the method in a large laboratory test-bed operating the Cognitive Packet Network (CPN) protocol.
Uploads
Papers by Maurizio D'Arienzo