scispace - formally typeset
Search or ask a question
Author

Yezid Donoso

Bio: Yezid Donoso is an academic researcher from University of Los Andes. The author has contributed to research in topics: Multicast & Evolutionary algorithm. The author has an hindex of 13, co-authored 100 publications receiving 667 citations. Previous affiliations of Yezid Donoso include University of the Andes & Universidad del Norte, Colombia.


Papers
More filters
Book
23 Mar 2007
TL;DR: This presentation discusses single-Objective versus Multi-objective Optimization Traditional Methods Metaheuristics Multi- objective Solution Applying Meta heuristics, and new Optimization Functions Redefinition of Optic Transmission Functions Constraints Functions and Constraint Modeling Obtaining a Solution Using MetaheURistics.
Abstract: OPTIMIZATION CONCEPTS Local Minimum Global Minimum Convex and Nonconvex Sets Convex and Concave Functions Minimum Search Techniques MULTI-OBJECTIVE OPTIMIZATION CONCEPTS Single-Objective versus Multi-objective Optimization Traditional Methods Metaheuristics Multi-objective Solution Applying Metaheuristics COMPUTER NETWORK MODELING Computer Networks: Introduction Computer Network Modeling ROUTING OPTIMIZATION IN COMPUTER NETWORKS Concepts Optimization Functions Constraints Functions and Constraints Single-Objective Optimization Modeling and Solution Multi-objective Optimization Modeling Obtaining a Solution Using Metaheuristics MULTI-OBJECTIVE OPTIMIZATION IN OPTICAL NETWORKS Concepts New Optimization Functions Redefinition of Optic Transmission Functions Constraints Functions and Constraints Multi-objective Optimization Modeling Obtaining a Solution Using Metaheuristics MULTI-OBJECTIVE OPTIMIZATION IN WIRELESS NETWORKS Concepts New Optimization Function Constraints Function and Constraints Multi-objective Optimization Modeling Obtaining a Solution Using Metaheuristics ANNEX A ANNEX B ANNEX C

117 citations

Proceedings ArticleDOI
01 Oct 2015
TL;DR: FireWell is able to model firewall policies as formal predicates to validate, detect and prevent conflicts in firewall policies and is presented as a framework based on Alloy.
Abstract: Software-Defined Networking (SDN) is a different approach to manage a network by software. It could use well-defined software expressions and predicates to regulate network behavior. Current SDN controllers, such as Floodlight, offer a framework to develop, test and run applications that control the network operation, including the firewall function. However, they are not able to validate firewall policies, detect conflicts; neither avoids contradictory configurations on network devices. Some compilers only detect conflicts by a subset of the language; hence, it cannot detect conflicts related to contradicting rules with security controls. This paper presents our framework based on Alloy called FireWell. FireWell is able to model firewall policies as formal predicates to validate, detect and prevent conflicts in firewall policies. In addition we present the implementation of FireWell and test it using the Floodlight controller and firewall application.

51 citations

Proceedings ArticleDOI
10 Oct 2005
TL;DR: A novel Generalized Multiobjective Multitree model (GMM-model), which considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed.
Abstract: This paper presents a new traffic engineering load balancing taxonomy, classifying several publications and including their objective functions, constraints and proposed heuristics. Using this classification, a novel Generalized Multiobjective Multitree model (GMM-model) is proposed. This model considers for the first time multitree-multicast load balancing with splitting in a multiobjective context, whose mathematical solution is a whole Pareto optimal set that can include several results than it has been possible to find in the publications surveyed. To solve the GMM-model, a multi-objective evolutionary algorithm (MOEA) inspired by the Strength Pareto Evolutionary Algorithm (SPEA) is proposed. Experimental results considering up to 11 different objectives are presented for the well-known NSF network, with two simultaneous data flows.

36 citations

Journal ArticleDOI
25 Mar 2016-Sensors
TL;DR: A Delay/Disruption Tolerant Network (DTN)-based solution where all nodes have persistent storage capabilities and DTN protocols to be able to wait minutes or hours to transmit for non-real-time applications.
Abstract: Communications from remote areas that may be of interest is still a problem. Many innovative projects applied to remote sites face communications difficulties. The GOLDFISH project was an EU-funded project for river pollution monitoring in developing countries. It had several sensor clusters, with floating WiFi antennas, deployed along a downstream river’s course. Sensor clusters sent messages to a Gateway installed on the riverbank. This gateway sent the messages, through a backhaul technology, to an Internet server where data was aggregated over a map. The communication challenge in this scenario was produced by the antennas’ movement and network backhaul availability. Since the antennas were floating on the river, communications could be disrupted at any time. Also, 2G/3G availability near the river was not constant. For non-real-time applications, we propose a Delay/Disruption Tolerant Network (DTN)-based solution where all nodes have persistent storage capabilities and DTN protocols to be able to wait minutes or hours to transmit. A mechanical backhaul will periodically visit the river bank where the gateway is installed and it will automatically collect sensor data to be carried to an Internet-covered spot. The proposed forwarding protocol delivers around 98% of the messages for this scenario, performing better than other well-known DTN routing protocols.

25 citations

Journal ArticleDOI
31 Mar 2015-Sensors
TL;DR: An optimization model over the load balancing in the congestion percentage of the streets is formulated and a fully congestion-oriented route discovery mechanism is explored and a proposal on the communication infrastructure that should support it based on V2I and V2V communication is made.
Abstract: The Internet of Things is a new paradigm in which objects in a specific context can be integrated into traditional communication networks to actively participate in solving a determined problem. The Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) technologies are specific cases of IoT and key enablers for Intelligent Transportation Systems (ITS). V2V and V2I have been widely used to solve different problems associated with transportation in cities, in which the most important is traffic congestion. A high percentage of congestion is usually presented by the inappropriate use of resources in vehicular infrastructure. In addition, the integration of traffic congestion in decision making for vehicular traffic is a challenge due to its high dynamic behavior. In this paper, an optimization model over the load balancing in the congestion percentage of the streets is formulated. Later, we explore a fully congestion-oriented route discovery mechanism and we make a proposal on the communication infrastructure that should support it based on V2I and V2V communication. The mechanism is also compared with a modified Dijkstra’s approach that reacts at congestion states. Finally, we compare the results of the efficiency of the vehicle’s trip with the efficiency in the use of the capacity of the vehicular network.

25 citations


Cited by
More filters
Posted Content
TL;DR: This paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies which are adaptive, distributed, asynchronous, and verifiably correct.
Abstract: This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

2,198 citations

Journal ArticleDOI
TL;DR: In this article, the authors provide a tutorial and survey of recent research and development efforts addressing this issue by using the technique of multi-objective optimization (MOO), and elaborate on various prevalent approaches conceived for MOO, such as the family of mathematical programming-based scalarization methods, and a variety of other advanced optimization techniques.
Abstract: Wireless sensor networks (WSNs) have attracted substantial research interest, especially in the context of performing monitoring and surveillance tasks. However, it is challenging to strike compelling tradeoffs amongst the various conflicting optimization criteria, such as the network’s energy dissipation, packet-loss rate, coverage, and lifetime. This paper provides a tutorial and survey of recent research and development efforts addressing this issue by using the technique of multi-objective optimization (MOO). First, we provide an overview of the main optimization objectives used in WSNs. Then, we elaborate on various prevalent approaches conceived for MOO, such as the family of mathematical programming-based scalarization methods, the family of heuristics/metaheuristics-based optimization algorithms, and a variety of other advanced optimization techniques. Furthermore, we summarize a range of recent studies of MOO in the context of WSNs, which are intended to provide useful guidelines for researchers to understand the referenced literature. Finally, we discuss a range of open problems to be tackled by future research.

311 citations

Journal ArticleDOI
TL;DR: This paper seeks to identify some of the many challenges where new and current researchers can still contribute to the advancement of SDN and further hasten its broadening adoption by network operators.
Abstract: Having gained momentum from its promise of centralized control over distributed network architectures at bargain costs, software-defined Networking (SDN) is an ever-increasing topic of research. SDN offers a simplified means to dynamically control multiple simple switches via a single controller program, which contrasts with current network infrastructures where individual network operators manage network devices individually. Already, SDN has realized some extraordinary use cases outside of academia with companies, such as Google, AT&T, Microsoft, and many others. However, SDN still presents many research and operational challenges for government, industry, and campus networks. Because of these challenges, many SDN solutions have developed in an ad hoc manner that are not easily adopted by other organizations. Hence, this paper seeks to identify some of the many challenges where new and current researchers can still contribute to the advancement of SDN and further hasten its broadening adoption by network operators.

185 citations

Journal ArticleDOI
TL;DR: This work conducted a systematic literature review to identify the primary studies on the use of ontologies in RE, following a predefined review protocol, and identified several promising research opportunities that are quite important and interesting but underexplored in current research and practice.
Abstract: There is an increase use of ontology-driven approaches to support requirements engineering (RE) activities, such as elicitation, analysis, specification, validation and management of requirements. However, the RE community still lacks a comprehensive understanding of how ontologies are used in RE process. Thus, the main objective of this work is to investigate and better understand how ontologies support RE as well as identify to what extent they have been applied to this field. In order to meet our goal, we conducted a systematic literature review (SLR) to identify the primary studies on the use of ontologies in RE, following a predefined review protocol. We then identified the main RE phases addressed, the requirements modelling styles that have been used in conjunction with ontologies, the types of requirements that have been supported by the use of ontologies and the ontology languages that have been adopted. We also examined the types of contributions reported and looked for evidences of the benefits of ontology-driven RE. In summary, the main findings of this work are: (1) there are empirical evidences of the benefits of using ontologies in RE activities both in industry and academy, specially for reducing ambiguity, inconsistency and incompleteness of requirements; (2) the majority of studies only partially address the RE process; (3) there is a great diversity of RE modelling styles supported by ontologies; (4) most studies addressed only functional requirements; (5) several studies describe the use/development of tools to support different types of ontology-driven RE approaches; (6) about half of the studies followed W3C recommendations on ontology-related languages; and (7) a great variety of RE ontologies were identified; nevertheless, none of them has been broadly adopted by the community. Finally, we conclude this work by showing several promising research opportunities that are quite important and interesting but underexplored in current research and practice.

171 citations

Journal Article
TL;DR: This work develops a framework for understanding the robustness of interacting networks subject to cascading failures and presents exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks.
Abstract: Complex networks have been studied intensively for a decade, but research still focuses on the limited case of a single, non-interacting network. Modern systems are coupled together and therefore should be modelled as interdependent networks. A fundamental property of interdependent networks is that failure of nodes in one network may lead to failure of dependent nodes in other networks. This may happen recursively and can lead to a cascade of failures. In fact, a failure of a very small fraction of nodes in one network may lead to the complete fragmentation of a system of several interdependent networks. A dramatic real-world example of a cascade of failures (‘concurrent malfunction’) is the electrical blackout that affected much of Italy on 28 September 2003: the shutdown of power stations directly led to the failure of nodes in the Internet communication network, which in turn caused further breakdown of power stations. Here we develop a framework for understanding the robustness of interacting networks subject to such cascading failures. We present exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks. Surprisingly, a broader degree distribution increases the vulnerability of interdependent networks to random failure, which is opposite to how a single network behaves. Our findings highlight the need to consider interdependent network properties in designing robust networks.

132 citations