GOSPF: An energy efficient implementation of the OSPF routing protocol

Energy saving iscurrently one of the most challenging issues for the Internet research community. In- deed, 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 infra- structures, 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 solutionis 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

A cooperation-based approach to energy optimization in wireless ad hoc networks

A well known and still open issue for wireless ad hoc networks is the unfair energy consumption among the nodes. The specific position of certain nodes composing an ad hoc network makes them more involved in network operations than others, causing a faster drain of their energy. To better distribute the energy level and increase the lifetime of the whole network, we propose to periodically force the cooperation of less cooperative nodes while overwhelmed ones deliberately stop their service. A dedicated ad hoc network routing protocol is introduced to discover alternative paths without degradation in the overall network performance

Can cooperation improve energy efficiency in ad hoc wireless networks?

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

A scheme for time-dependent resource reservation in QoS-enabled IP networks

Abstract. A number of distributed applications require communication services with Quality of Service (QoS) guarantees. The QoS provisioning issue in the Internet has been addressed by the IETF with the definition of the Integrated Services (IntServ) and Differentiated Services (Diffserv) frameworks. Resource reservation mechanisms on which these models are based are totally time-unaware. Yet, we believe that, in some cases, associating a time interval to network resource reservations could be useful for both users and network providers. In this paper we present a distributed scheme for time-dependent reservations in QoS-enabled IP networks. We also show how the standard signalling protocol RSVP may support this new reservation style, with only a few minor modifications. Finally, we present a first prototype implementation of the major component of the proposed architecture and we provide some hints on future applicability scenarios of the advance reservation paradigm and its impact on related topics such as policing and charging techniques in QoS-enabled IP networks.