Energy-Aware Traffic Engineering for Wired IP Networks

RÉSUMÉ Même si l'Internet est souvent considéré comme un moyen formidable pour réduire l'impact des activités humaines sur l'environnement, sa consommation d'énergie est en train de devenir un problème en raison de la croissance exponentielle du trafic et de l'expansion rapide des infrastructures de communication dans le monde entier. En 2007, il a été estimé que les équipements de réseau (sans tenir compte de serveurs dans les centres de données) étaient responsables d'une consommation d'énergie de 22 GW, alors qu'en 2010 la consommation annuelle des plus grands fournisseurs de services Internet (par exemple AT$T) a dépassé 10 TWh par an. En raison de cette tendance alarmante, la réduction de la consommation d'énergie dans les réseaux de télécommunication, et en particulier dans les réseaux IP, est récemment devenue une priorité. Une des stratégies les plus prometteuses pour rendre plus vert l'Internet est le sleep-based energy-aware network management (SEANM), selon lequel la configuration de réseau est adaptée aux niveaux de trafic afin d'endormir tous les éléments redondantes du réseau. Dans cette thèse nous développons plusieurs approches centralisées de SEANM, afin d'optimiser la configuration de réseaux IP qui utilisent différents protocoles (OSPF or MPLS) ou transportent différents types de trafic (élastique or inélastique). Le choix d'adresser le problème d'une manière centralisée, avec une plate-forme de gestion unique qui est responsable de la configuration et de la surveillance de l'ensemble du réseau, est motivée par la nécessité d'opérateurs de maintenir en tout temps le contrôle complet sur le réseau. Visant à mettre en œuvre les approches proposées dans un environnement réaliste du réseau, nous présentons aussi un nouveau cadre de gestion de réseau entièrement configurable que nous avons appelé JNetMan. JNetMan a été exploité pour tester une version dynamique de la procédure SEANM développée pour les réseaux utilisant OSPF.----------ABSTRACT Even if the Internet is commonly considered a formidable means to reduce the impact of human activities on the environment, its energy consumption is rapidly becoming an issue due to the exponential traffic growth and the rapid expansion of communication infrastructures worldwide. Estimated consumption of the network equipment, excluding servers in data centers, in 2007 was 22 GW, while in 2010 the yearly consumption of the largest Internet Service Providers, e.g., AT&T, exceeded 10 TWh per year. The growing energy trend has motivated the development of new strategies to reduce the consumption of telecommunication networks, with particular focus on IP networks. In addition to the development of a new generation of green network equipment, a second possible strategy to optimize the IP network consumption is represented by sleep-based energy-aware network management (SEANM), which aims at adapting the whole network power consumption to the traffic levels by optimizing the network configuration and putting to sleep the redundant network elements. Device sleeping represents the main potential source of saving because the consumption of current network devices is not proportional to the utilization level: so that, the overall network consumption is constantly close to maximum. In current IP networks, quality of service (QoS) and network resilience to failures are typically guaranteed by substantially over-dimensioning the whole network infrastructure: therefore, also during peak hours, it could be possible to put to sleep a non-negligible subset of redundant network devices. Due to the heterogeneity of current network technologies, in this thesis, we focus our efforts to develop centralized SEANM approaches for IP networks operated with different configurations and protocols. More precisely, we consider networks operated with different routing schemes, namely shortest path (OSPF), flow-based (MPLS) and take into account different types of traffic, i.e., elastic or inelastic. The centralized approach, with a single management platform responsible for configuring and monitoring the whole network, is motivated by the need of network operators to be constantly in control of the network dynamics. To fully guarantee network stability, we investigate the impact of SEANM on network reliability to failures and robustness to traffic variations. Ad hoc modeling techniques are integrated within the proposed SEANM frameworks to explicitly consider resilience and robustness as network constraints. Finally, to implement the proposed procedures in a realistic network environment, we propose a novel, fully configurable network management framework, called JNetMan. We use JNetMan to develop and test a dynamic version of the SEANM procedure for IP networks operated with shortest path routing protocols

Topics in access, storage, and sensor networks

In the first part of this dissertation, Data Over Cable Service Interface Specification (DOCSIS) and IEEE 802.3ah Ethernet Passive Optical Network (ETON), two access networking standards, are studied. We study the impact of two parameters of the DOCSIS protocol and derive the probability of message collision in the 802.3ah device discovery scheme. We survey existing bandwidth allocation schemes for EPONs, derive the average grant size in one such scheme, and study the performance of the shortest-job-first heuristic. In the second part of this dissertation, we study networks of mobile sensors. We make progress towards an architecture for disconnected collections of mobile sensors. We propose a new design abstraction called tours which facilitates the combination of mobility and communication into a single design primitive and enables the system of sensors to reorganize into desirable topologies alter failures. We also initiate a study of computation in mobile sensor networks. We study the relationship between two distributed computational models of mobile sensor networks: population protocols and self-similar functions. We define the notion of a self-similar predicate and show when it is computable by a population protocol. Transition graphs of population protocols lead its to the consideration of graph powers. We consider the direct product of graphs and its new variant which we call the lexicographic direct product (or the clique product). We show that invariants concerning transposable walks in direct graph powers and transposable independent sets in graph families generated by the lexicographic direct product are uncomputable. The last part of this dissertation makes contributions to the area of storage systems. We propose a sequential access detect ion and prefetching scheme and a dynamic cache sizing scheme for large storage systems. We evaluate the cache sizing scheme theoretically and through simulations. We compute the expected hit ratio of our and competing schemes and bound the expected size of our dynamic cache sufficient to obtain an optimal hit ratio. We also develop a stand-alone simulator for studying our proposed scheme and integrate it with an empirically validated disk simulator

Journal of Telecommunications and Information Technology, 2006, nr 4

kwartalni

Optimization algorithm for reconfiguration process of the IP over optical networks, Journal of Telecommunications and Information Technology, 2003, nr 3

The IP over optical (IPO) network is becoming one of the most interesting among all proposed models of transport networks nowadays. In an IPO network, the recon- figuration capability of the network could be used in order to balance the load of its network elements (NEs). Reconfiguration operations (i.e., switching in OXC nodes and rerouting in IP routers) take place in real-time. Consequently, intensive changes in NEs settings might cause failures in the existing connections in the network. For that reason, changes in NEs settings should be coordinated in a reconfiguration process. In this paper, the author has proposed an optimization method for such reconfiguration process. The mathematical model of the method including computation results has been presented

Journal of Telecommunications and Information Technology, 2012, nr 2

kwartalni

Journal of Telecommunications and Information Technology, 2009, nr 3

kwartalni

Journal of Telecommunications and Information Technology, 2003, nr 3

kwartalni

Advances in Computer Recognition, Image Processing and Communications, Selected Papers from CORES 2021 and IP&C 2021

As almost all human activities have been moved online due to the pandemic, novel robust and efficient approaches and further research have been in higher demand in the field of computer science and telecommunication. Therefore, this (reprint) book contains 13 high-quality papers presenting advancements in theoretical and practical aspects of computer recognition, pattern recognition, image processing and machine learning (shallow and deep), including, in particular, novel implementations of these techniques in the areas of modern telecommunications and cybersecurity