Multihoming Aware Optimization Mechanism
Total Page:16
File Type:pdf, Size:1020Kb
101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 101010101010101010101010101010101010101010 Bruno Miguel de Oliveira Sousa Multihoming Aware Optimization Mechanism Tese de Doutoramento em Engenharia Informática (pré Bolonha) orientada por Marilia Pascoal Curado e Konstantinos Pentikousis Departamento de Engenharia Informática da Faculdade de Ciências e Tecnologia da Universidade de Coimbra Julho de 2013 Multihoming Aware Optimization Mechanism Mecanismo de Optimiza¸c˜ao com Suporte de M ´ultiplosCaminhos Bruno Miguel de Oliveira Sousa Department of Informatics Engineering Faculty of Sciences and Technology University of Coimbra A thesis submitted for the degree of Doctor of Philosophy 2013 Multihoming Aware Optimization Mechanism Bruno Miguel de Oliveira Sousa Department of Informatics Engineering Faculty of Sciences and Technology University of Coimbra Thesis submitted as partial fulfillment of the requirements of Doctor of Philosophy on Infor- matics Engineering (before Bologna) in the University of Coimbra, for the award of Doctor in the domain of Telematics Networking and Communications under the care of advisor Profes- sor Marilia Pascoal Curado and co-advisor Dr. Konstantinos Pentikousis. Grant from Fundac¸ao˜ para a Cienciaˆ e a Tecnologia (FCT) SFRH/BD/61256/2009. 2013 To my mother Alzira and to my brother Pedro, whose sacrifice and love, have tailored the person I am today. Acknowledgements A thesis is a work of a high magnitude, requiring the best of us. Believing in every moment, probably is the first step to arrive here. To my supervisor, It’s unfair to acknowledge the support throughout the thesis within a few words, my sincere excuses for this. You made me believe that it was possible, that the best of me could reach it with success. The remarkable guidance lead me to work with the feeling that I was performing a ‘big and important mission’ - research. I was paving the way, to a better world tomorrow, with efficient multihoming mechanisms. Dear Marilia Curado, my eternal thanks. To my co-supervisor, Konstantinos Pentikousis, for pushing me to high limits, to overcome my limitations with success. Thanks for your courage to demonstrate that, in some moments, I could have done better, perfection is, indeed, your Lemma. Thanks for sharing and teaching me that the perfection Lemma lead us to horizons never thought before. Life gives us friends that share knowledge life moments, that some way grow up with us. Vitor Bernardo thanks for the fruitful discussions, and I must confess that I admire your courage and dedication when you read my article with almost twenty pages, with plenty of mathematical formulas. David thank you for sharing things you just learned in the moment and for the active comments. I do remember that I’ve shared with you some LATEX tips, but afterall you became the master. Probably, there is always someone in every project that must do the hard work. Ricardo Santos you were this one, without afraid of the job. Without you I could not have tested MeTHODICAL in the cloud, in a real testbed. Alexandre thanks for programming on the implementation of mCoA++. Love can inspire us to move mountains. To my wife, Celia´ I express my deep grat- itude, for being there in the ‘optimized’ moments and for keeping my perseverance in high levels to overcome the moments when there was no light. To my two daughters, the oldest, Susana for asking me what was the thesis about, It made me believe in it with other perspective. To the youngest, Luana whose premise is enjoying life by playing, but smart enough to understand that thesis was very important to Daddy. To you, Luana, I ask my excuses for the time stolen by the thesis. Abstract HE always best connected paradigm has gain a lot of interest in the research and scientific community. The availability of different wireless technologies T and the proliferation of devices supporting multiple connections are open- ing new possibilities for users to share information everywhere and everytime. The multihoming support is being enriched to levels never before established. Indeed, users can configure devices to meet their own requirements, decrease communication costs by choosing links with no expenses associated, or opting for links that provide extended coverage. Such kind of configuration is often limited to static policies that aim the maximization of a single requirement, such as monetary cost or coverage. This approach is not efficient. For instance, if the optimization aims to decrease cost, extend coverage and increase security support simultaneously, static policies do not scale and have narrow support for multihoming goals, namely resilience, ubiquity and load sharing. Multihoming is an important aspect in computer networks. To enable higher lev- els of availability or optimize recovery processes in the presence of failures are goals that mechanisms improving resilience aim to support. Other goals, in a ubiquity as- pect, can include networks providing extended coverage but with minimized costs. To successfully achieve such goals and others, multihoming must be considered from the early phases of Internet architectures development. The choice of protocols and technologies with the best multihoming support is an important step to conceive net- work architectures that are multihoming efficient. With this concern in mind, this the- sis introduces the specification of resilience and ubiquity frameworks that assess the support of resilience and ubiquity goals in protocols. These evaluation frameworks provide a taxonomy that fully characterize multihoming goals. Efficient multihoming support requires the optimization of multiple criteria com- prising diverse goals. This NP-hard problem considers benefits criteria providing profit and costs criteria introducing some kind of overhead. Techniques like Mul- tiple Attribute Decision Mechanism (MADM) provide ideal solutions for such kind of optimization problems, as they are not tied to a specific number of criteria. Even though, previously defined MADM techniques include criteria preferences, they do not specify how these preferences can be expressed in objective and consistent ways. In addition, they can introduce side-effects, such as unnecessary handovers. Bear- ing with these issues in mind, this work introduces MeTHODICAL, an optimization