Prof. Juan Antonio Cordero Fuertes

@inproceedings{nokey,

title = {AIvolution, Assessing the Potential and Impact of AI and Digital Technologies in the EU},

author = {Juan Antonio Cordero},

year  = {2024},

date = {2024-09-18},

urldate = {2024-09-18},

booktitle = {Proc. of the IEEE International Symposium on Technology and Society (ISTAS 2024) },

publisher = {IEEE},

abstract = {As automation and digitalisation become more pervasive, understanding their social implications, opportunities and risks, as well as appropriate policies and regulatory needs, require increasing inter-disciplinary efforts.

This paper describes the motivation, format and outcomes of the AIvolution event about AI and digital technologies, organized in the European Parliament (EP) on November 2023, for that purpose.

It presents the main topics addressed, the key contributions that were presented, the discussions that took place, and the main takeaways, as well as the perspectives to continue these exchanges in further initiatives.},

keywords = {Scientific dissemination},

pubstate = {forthcoming},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {On the Dynamics of Single-Orbit Requester-Provider Systems},

author = {Juan Antonio Cordero},

url = {https://dl.acm.org/doi/10.1145/3616388.3617517},

doi = {10.1145/3616388.3617517},

year  = {2023},

date = {2023-10-30},

urldate = {2023-10-30},

booktitle = {Proc. 26th ACM International Conference on Modeling, Analysis 

and Simulation of Wireless and Mobile Systems (MSWiM'2023)},

publisher = {ACM},

abstract = {This paper considers decentralized systems of multiple agents that interact in order to perform distributed computing or efficient information transfer in variant, constrained environments. These systems appear in various relevant use cases, including reliable multicast distribution, or dynamic resource allocation in systems in the Internet edge (datacenters, IOT deployments). This paper introduces an abstract, mathematical model, that allows to study analytically the behavior of these systems, as a set of interacting requesters and providers. The paper describes system orbits, and concentrates on the study of single-orbit systems. Ergodicity of system behavior in the single-orbit case is proved, and a full description of the stationary system behavior is derived. Closed expressions of the stationary distribution of requester decisions are provided. Analytical results are validated through extensive simulations. These single-orbit results are a necessary step for the analysis and further optimization of dynamic performance of these systems.},

keywords = {Autoconfiguration, Constrained Networks, DynSys, Infrastructure for Big Data, IoT, Modeling},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {Metasurface for Enhanced Millimeter-Wave Communications under Imperfect Beam Alignment},

author = {Jesús A. Cumana Morales and Marceau Coupechoux and Juan Antonio Cordero},

year  = {2023},

date = {2023-09-04},

urldate = {2023-09-04},

booktitle = {Proc. IEEE International Mediterranean Conference on Communications and Networking (MeditCom'2023)},

publisher = {IEEE},

abstract = {In this work, we investigate the impact of beam misalignment in the performance of a wireless system employing a metasurface to improve coverage in a non-line-of-sight (NLOS) scenario. The metasurface is modeled by an array of small radiating elements each of them terminated with a complex load. An equivalent Array Factor is defined, which allows visualizing the beamsteering properties of the metasurface in far-field conditions. Angular misalignment is modeled using a truncated Gaussian distribution and an expression to evaluate signal-to-noise ratio (SNR) in the presence of misalignment is derived. Numerical results show an SNR degradation close to 8 dB for 5° error magnitude and up to 14 dB if high-gain unit cells are used. Three mechanisms are explored, which can be used to reduce SNR degradation: increasing Metasurface dimensions allows recovering SNR by 7.4 dB, low unit cell gain allows improving SNR by close to 10.5 dB when compared to a high-gain cell and base station beamwidth decrease from 25.6° to 12.7° allows recovering SNR by 4 dB thanks to the higher BS beam gain.  },

keywords = {Performance, Performance Evaluation, Wireless},

pubstate = {forthcoming},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {Understanding Semantics in Feature Selection for Fault Diagnosis in Network Telemetry Data},

author = {Thomas Feltin and Juan Antonio Cordero and Thomas Clausen and Frank Brockners},

url = {https://www.epizeuxis.net/wp-content/uploads/2023/06/2023009866.pdf},

year  = {2023},

date = {2023-05-08},

urldate = {2023-05-08},

booktitle = {Proc. IEEE/IFIP Network Operations and Management Symposium 2023},

publisher = {IEEE},

abstract = {Expert systems for fault diagnosis are computationally expensive to build and maintain, and lack scalability and inherent adaptability to unknown events or modifications in the topology of the monitored system. While data-driven feature se- lection mechanisms can facilitate diagnosis without the hardship of developing and maintaining expert systems, purely data-driven mechanisms lack understanding of semantic importance within a feature set, and would benefit from additional domain knowledge. Part of this additional knowledge can be extracted from meta-data. The proposed approach combines data-driven metrics and semantic information contained in the feature names to produce selections of features which best represent an underlying event. This study extends a cross entropy based optimization method to join semantic importance with data behavior. A benchmarking architecture is introduced to evaluate the benefits of semantic analysis, and demonstrate the performance and robustness of semantic feature selection on different types of faults in network telemetry datasets, modeled with the YANG data modeling language. The results illustrate the interest of such a complementary meta-data analysis for data-driven fault diagnosis, and highlight the robustness of the studied approach against variations in the input feature set.},

keywords = {},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokeyg,

title = {Efficient Data-Driven Network Functions},

author = {Zhiyuan Yao and Yoann Desmouceaux and Juan Antonio Cordero and Mark Townsley and Thomas Clausen},

url = {https://arxiv.org/pdf/2208.11385},

year  = {2022},

date = {2022-10-18},

urldate = {2022-10-18},

booktitle = {30th International Symposium on the Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2022)},

abstract = {Cloud environments require dynamic and adaptive networking policies. It is preferred to use heuristics over advanced learning algorithms in Virtual Network Functions (VNFs) in production becuase of high-performance constraints. This paper proposes Aquarius to passively yet efficiently gather observations and enable the use of machine learning to collect, infer, and supply accurate networking state information-without incurring additional signalling and management overhead. This paper illustrates the use of Aquarius with a traffic classifier, an autoscaling system, and a load balancer-and demonstrates the use of three different machine learning paradigms-unsupervised, supervised, and reinforcement learning, within Aquarius, for inferring network state. Testbed evaluations show that Aquarius increases network state visibility and brings notable performance gains with low overhead.},

keywords = {Chaire Cisco, Infrastructure for Big Data, Machine Learning, Network Management},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{nokey,

title = {Réactivité, efficacité et apprentissage: problèmes d’aide à la prise de décision dans des réseaux décentralisés},

author = {Juan Antonio Cordero},

year  = {2022},

date = {2022-02-23},

urldate = {2022-02-23},

booktitle = {23ème Congrès de la ROADEF},

organization = {Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF)},

keywords = {Autoconfiguration, IoT, Scientific dissemination},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Perez2017,

title = {ODMAC++: An IoT Communication Manager based on Energy Harvesting Prediction},

author = {Samuel Perez and Juan Antonio Cordero and Marceau Coupechoux},

year  = {2017},

date = {2017-10-08},

booktitle = {Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'2017).},

publisher = {IEEE},

abstract = {In large low-power networks of battery-driven sen- sors, power outages are a major concern and communication rates have to be carefully designed in order to optimize energy consumption, network connectivity and sensors lifetime. In some IoT use cases, power can be supplied to sensors by way of renewable energy automatic harvesting (solar panels, etc.). Given the high variability of energy arrival processes, energy consumption in sensors, in particular caused by transmissions to the sink, has to be aligned with energy harvesting patterns, so as to maximize throughput while avoiding power outages that may arise when the battery is empty. This paper proposes ODMAC++, an extension to a well-known protocol for sensor transmission scheduling in a WSN. ODMAC++ relies on learning techniques to adapt sensors communication rate to energy harvesting patterns, and uses a beaconing mechanism whose frequency is adjusted based on past measurements on the harvested energy process. Simulations based on analytical energy arrival models and on real solar radiation measurements indicate that ODMAC++ is able to avoid power outages and to cope with battery limitation and energy variations due to variability in time.},

keywords = {Chaire Cisco, Constrained Networks, IoT, Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2016b,

title = {Not So Far: Improving Autonomous Content Discovery and Delivery within Mobile Pedestrian Crowds},

author = {Juan Antonio Cordero and Wei Lou},

year  = {2016},

date = {2016-08-01},

publisher = {Proceedings of the 25th International Conference on Computer Communication and Networks (ICCCN 2016).},

abstract = {The explosion of traffic demands in the edge of the Internet, mostly by mobile users, is putting under pressure current networking infrastructure. This is particularly acute when huge amounts of users and active wireless devices gather in reduced geographical spaces, increasing the risk of exceeding planned capacity of deployed infrastructure. This trend motivates research on mechanisms to offload part of the user injected traffic from the access infrastructure networks and reduce the need of Internet requests and retrievals. This paper concentrates on the ability of mobile meshes to fulfill the requests for contents originated within the mesh, with minimal intervention of the Internet access infrastructure. We propose, discuss and evaluate simple heuristics to improve autonomous content discovery and dissemination within such mobile meshes, characterized by high density and low (pedestrian) mobility, by combining notions already explored in the context of MANET routing: deliberate jittering and autonomous overlay pruning based on link distance. Results over synthetic networks and real mobility traces indicate that proposed mechanisms can be easily deployed and are able to improve efficiency and quality of content request discoveries, by reducing significantly the collisions and increasing the stability of discovered paths in crowded mesh pedestrian networks.},

note = {Accepted},

keywords = {Broadcast, MANET, MANET Broadcast},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Jiménez2015,

title = {Measuring Robustness of SDN Control Layers},

author = {Yury Andrea Jiménez and Juan Antonio Cordero and Cristina Cervelló-Pastor},

url = {http://dl.ifip.org/db/conf/im/im2015p/137468.pdf},

year  = {2015},

date = {2015-05-01},

publisher = {Proceedings of the 14th IFIP/IEEE International Symposium on Integrated Network Management (IM 2015)},

abstract = {The controller placement problem remains a key aspect of Software Defined Networking (SDN). The selection of a suboptimal controller may impact severely the performance of the control layer and, in consequence, cause a substantial degradation in the data layer. Different approaches for controller placement have been proposed with various objectives in mind, but most of them do not consider the characteristics of the resulting control layer in terms of robustness. In this paper we propose and formalize a complete metric for estimating robustness of a SDN control layer, and we evaluate two heuristics for controller selection and control layer construction: Fast Failover and a simplified version of k-Critical. The results of the performed evaluation indicate that the control layer topology induced by k-Critical is less prone to failures, more robust and more homogenous than those computed by Fast Failover.},

keywords = {Autoconfiguration},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2014,

title = {Understanding the topological properties of Internet traffic: a view from the edge},

author = {Juan Antonio Cordero and Olivier Bonaventure},

url = {https://www.researchgate.net/publication/263584074_Understanding_the_topological_properties_of_Internet_traffic_A_view_from_the_edge},

year  = {2014},

date = {2014-06-01},

publisher = {Proceedings of the IFIP Networking 2014 Conference},

abstract = {Traffic between an edge network and the rest of the Internet can be represented as a dynamic loop-free graph. Understanding in depth the dynamics in time and space (spatial structure, topological breadth, destination persistency, traffic dominating paths) of this graph provides significant insight on the Internet internal architecture and capabilities. This paper analyzes interdomain traffic from a large campus network based on one month by way of Netflow measurements. Our analysis reveals the topological properties and structure of the traffic graph (breadth, depth, volume), the stability of contacted destinations and the relationship between their popularity and their path length. Based on the observed traffic, we explore the suitability of a simple mathematical model to describe the structure of the outgoing traffic graph.},

keywords = {Internet Measurements},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013g,

title = {Jitter Considerations in On-demand Route Discovery for Mobile Ad Hoc Networks},

author = {Jiazi Yi and Juan Antonio Cordero and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-NBIS-Jitter-Considerations-in-On-demand-Route-Discovery-for-Mobile-Ad-Hoc-Networks.pdf},

doi = {10.1109/NBiS.2013.28},

year  = {2013},

date = {2013-09-01},

publisher = {The 16th International Conference on Network-Based Information Systems (NBiS-2013)},

abstract = {Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmis- sions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the “LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation” (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using “naive” jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues – with the performance hereof, when compared to “naive” jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for “naive” jitter.},

keywords = {Ad-Hoc, Jitter, LOADng, MANET, MESH, Sensor Networks, Smart Grid, SOGRID},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Clausen2013c,

title = {Optimization of jitter configuration for reactive route discovery in wireless mesh networks},

author = {Juan Antonio Cordero and Jiazi Yi and Thomas Clausen},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2013-WiOpt-Optimization-of-Jitter-Configuration-for-Reactive-Route-Discovery-in-Wireless-Mesh-Networks.pdf},

isbn = {978-1-61284-824-2},

year  = {2013},

date = {2013-05-01},

publisher = {Modeling & Optimization in Mobile, Ad Hoc & Wireless Networks (WiOpt), 2013 11th International Symposium on},

abstract = {Jitter is a small, random variation of timing before message emission that is widely used in non-synchronized wireless communication. It is employed to avoid collisions caused by simultaneous transmissions by adjacent nodes over the same channel. In reactive (on-demand) routing protocols, such as AODV and LOADng, it is recommended to use jitter during the flooding of Route Request messages. This paper analyzes the cost of jitter mechanisms in route discovery of on-demand routing protocols, and examines the drawbacks of the standard and commonly used uniformly distributed jitter. The main studied drawback is denominated delay inversion effect. Two variations on the jitter mechanism --window jitter and adaptive jitter-- are proposed to address this effect, which take the presence and the quality of traversed links into consideration to determine the per-hop forwarding delay. These variations allow to effectively reduce the routing overhead, and increase the quality of the computed paths with respect to the standard uniform jitter mechanism. Simulations are also performed to compare the performance of different jitter settings in various network scenarios.},

keywords = {Ad-Hoc, Jitter, LLN, LOADng, MANET, MESH, Sensor Networks, Smart Grid},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2012b,

title = {Routing across Wired and Wireless Mesh Networks: Experimental Compound Internetworking with OSPF},

author = {Juan Antonio Cordero and Matias Philipp and Emmanuel Baccelli},

url = {https://www.researchgate.net/publication/236883800_Routing_Across_Wired_and_Wireless_Mesh_Networks_Experimental_Compound_Internetworking_with_OSPF},

doi = {10.1109/IWCMC.2012.6314296},

year  = {2012},

date = {2012-08-01},

publisher = {Proceedings of the 8th IEEE International Wireless Communications and Mobile Computing Conference (WCMC 2012)},

abstract = {As wireless mesh networks are deployed, a new concept emerges: compound internetworks, i.e., internetworks that contain both wired networks and wireless mesh networks. Routing is one of the key challenges that arises in compound internetworks: indeed, while specific routing protocols are typically used for wired networks on one hand, and for wireless mesh networks on the other hand, it has been observed that operating a single routing protocol to manage a compound internetwork as a whole brings several advantages. In this realm, the IETF has thus standardized protocol extensions to Open Shortest Path First (OSPF, the routing protocol used by more than 50 % of the wired routers in today's Internet), enabling OSPF to operate simultaneously on wired networks, and on wireless mesh or moderately mobile ad hoc networks (MANETs). This paper evaluates the performance of OSPF coupled with such a protocol extension for MANETs on an experimental compound internetwork testbed. This paper reports on experiments carried out with OSPF operating simul-taneously over Ethernet and 802.11b. Despite the limitations of the testbed, these experiments provide both a proof-of-concept and complementary results compared to prior work in the domain, which was mostly based on simulations, and focused on wireless ad hoc network scenarios only.},

keywords = {MANET, MESH, OSPF, OSPF4MANET, Performance Evaluation},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2012,

title = {Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc Networks: Model and Analysis},

author = {Juan Antonio Cordero and Philippe Jacquet and Emmanuel Baccelli},

url = {https://www.researchgate.net/publication/236883781_Impact_of_Jitter-based_Techniques_on_Flooding_over_Wireless_Ad_hoc_Networks_Model_and_Analysis},

doi = {10.1109/INFCOM.2012.6195587},

issn = {0743-166X},

year  = {2012},

date = {2012-03-25},

pages = {2059-2067},

publisher = {Proceedings of the 31st Annual IEEE International Conference on Computer Communications (INFOCOM 2012).},

address = {Orlando, FI, United States.},

organization = {IEEE},

abstract = {Jitter is used in wireless ad hoc networks to reduce the number of packet collisions and the number of transmissions. This is done by scheduling random back-off for each packet to be transmitted and by piggybacking multiple packets in a single transmission. This technique has been standardized by the IETF in RFC 5148. This paper investigates on the impact of the standardized jitter mechanism on network-wide packet dissemination – i.e. flooding, an important component for many protocols used today. A novel analytical model is introduced, capturing standard jitter traits. From this model is derived accurate characterization of the effects of jittering on flooding performance, including the additional delay for flooded packets on each traversed network interface, the reduction of the number of transmissions over each network interface, and the increased length of transmissions, depending on jitter parameters. This paper also presents an analysis of the use of jitter in practice, over an 802.11 wireless link layer based on CSMA. The analytical results are then validated via statistical discrete event simulations. The paper thus provides a comprehensive overview of the impact of jittering in wireless ad hoc networks.

},

keywords = {Jitter, MANET Broadcast, OLSR, OLSRv2, OSPF, OSPF4MANET},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Fuertes2011,

title = {MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF},

author = {Juan Antonio Cordero and Thomas Clausen and Emmanuel Baccelli},

url = {http://www.thomasclausen.net/wp-content/uploads/2015/12/2011-HICSS-MPRSP-Towards-a-Unified-MPR-based-MANET-Extension-for-OSPF.pdf},

doi = {10.1109/HICSS.2011.313},

year  = {2011},

date = {2011-01-01},

publisher = {Hawaii International Conference on System Sciences},

abstract = {Heterogeneous networks combining both wired and wireless components – fixed routers as well as mobile routers – emerge as wireless mesh networks are being deployed. Such heterogeneity is bound to become more and more present in the near future as mobile ad hoc networking becomes a reality. While it is possible to cope with heterogeneity by employing different routing protocols for the fixed / wired part and for the wireless / ad hoc part of the network, this may lead to sub-optimal performance, e.g. by way of longer routing paths due to these routing protocols sharing prefixes and ”connecting” the network only at distinct gateways between the two routing domains. Thus, the establishment of a single unified routing domain, and the use of a single routing protocol, for such heterogeneous networks is desired. OSPF is a natural candidate for this task, due to its wide deployment, its modularity and its similarity with the popular ad hoc routing protocol OLSR. Multiple OSPF extensions for MANETs have therefore been specified by the IETF. This paper introduces a novel OSPF extension for operation on ad hoc networks, MPRSP, and compares it with the existing OSPF extensions via simulations, which show that MPR+SP outperforms prior art.},

keywords = {Ad-Hoc, MANET, MESH, MPR, OSPF, OSPF4MANET},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Baccelli2010b,

title = {Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad Hoc Networks},

author = {Emmanuel Baccelli and Juan Antonio Cordero and Philippe Jacquet},

url = {https://www.researchgate.net/publication/224204276_Optimization_of_Critical_Data_Synchronization_via_Link_Overlay_RNG_in_Mobile_Ad_Hoc_Networks},

doi = {10.1109/MASS.2010.5663945},

issn = {2155-6806},

year  = {2010},

date = {2010-11-01},

pages = {402-411},

publisher = {Proceedings of the 7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS’2010).},

address = {San Francisco, CA, United States.},

organization = {IEEE},

abstract = {In practice, ad hoc networks are still too unreliable for standard mobile and vehicular communications. It is thus important to complement current protocols in this context, with schemes guaranteeing the exchange of critical data when needed. A promising approach in this realm is to use an overlay subgraph, over which critical messages are exchanged and acknowledged in a peer to peer fashion. Overlay nodes' local databases remain thus synchronized over time, at least concerning critical data. This paper elaborates on the problem of performance, related to the discovery and maintenance of such overlay networks in a mobile ad hoc context. We analyze SLOT, an overlay selected based on a Relative Neighbour Graph (RNG) scheme. We then apply SLOT to a standard IP protocol: OSPF, a popular routing protocol which has recently been extended, with RFC 5449 and RFC 5614, to work also on mobile ad hoc networks, and which makes use of a similar overlay synchronization subgraph. This paper compares the performance of these existing OSPF mechanisms with that of SLOT-OSPF, a novel OSPF extension for mobile ad hoc networks using SLOT. Simulations show that SLOT-OSPF produces drastically less control traffic than RFC 5449 or RFC 5614, allowing SLOT-OSPF to function correctly while the other existing approaches stall, when the number of routers in the domain is large.},

keywords = {Ad-Hoc, MANET, OSPF, OSPF4MANET},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2010,

title = {Adjacency Persistency in OSPF MANET},

author = {Juan Antonio Cordero},

url = {https://www.researchgate.net/publication/46388530_Adjacency_Persistency_in_OSPF_MANET},

year  = {2010},

date = {2010-10-01},

publisher = {Proceedings of the 4th IET China-Ireland International Conference on Information and Communication Technologies (CIICT’2010).},

abstract = {Link-state routing remains as one of the most challenging issues in ad hoc networking, due to the special conditions and requirements that hold in such networks, which cannot be handled by classical routing protocols. In the last decade, several efforts have been deployed either to design new routing solutions adapted to ad hoc conditions, either to extend existing solutions for wired networks to the domain of wireless mobile scenarios. This paper elaborates on the latter alternative, focusing on the standard OSPF MANET extension RFC 5449. It analyzes the impact and interest of the persistency principle to the main OSPF MANET operations, in particular the adjacency synchronization and the other operations that relate to it (flooding and route construction). The presented results show that such persistent approach is appropriate for managing adjacencies in the context of RFC 5449, and significant improvements might be achieved by extending the persistent principle into the topology selection mechanism.},

keywords = {MANET, OSPF, OSPF4MANET, Performance Evaluation},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2010b,

title = {MPR-based Pruning Techniques for Shortest Path Tree Computation},

author = {Juan Antonio Cordero},

url = {https://www.researchgate.net/publication/224190067_MPR-based_pruning_techniques_for_Shortest_Path_Tree_computation},

year  = {2010},

date = {2010-09-01},

publisher = {Proceedings of the 18th IEEE International Conference on Software Telecommunications and Computer Networks (SoftCom).},

abstract = {Multi-Point Relaying (MPR) is a well-known relay pruning algorithm that has proved to be useful for efficient dissemination in Mobile Ad hoc Networks (MANETs). But this technique may be useful for other tasks in MANET link-state routing as well. In particular, the approach is attractive for the selection of topology information to be flooded across the network. Requirements for such topology selection are however different from those applying for efficient dissemination, so approaches in such direction need to address these requirements and adapt or complement the MPR mechanism accordingly. This paper analyzes the main asymptotic properties of MPR and MPR-based topology selection algorithms, and provides sufficient conditions for the correctness of MPR-based topology selection. It examines as well in detail the MPR-based topology selection algorithm of MPR-OSPF, Path MPR, and shows that this algorithm may be unable, in certain conditions, to preserve optimal routes in its topology selection. The paper concludes by proposing and validating a modification of the Path MPR algorithm to overcome this sub-optimal performance.},

keywords = {MANET, MPR, OSPF, OSPF4MANET},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Baccelli2010,

title = {Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs},

author = {Emmanuel Baccelli and Juan Antonio Cordero and Philippe Jacquet},

url = {https://www.researchgate.net/publication/224155213_Using_Relative_Neighborhood_Graphs_for_Reliable_Database_Synchronization_in_MANETs},

doi = {10.1109/WIMESH.2010.5507907},

year  = {2010},

date = {2010-06-01},

pages = {1-6},

publisher = {Proceedings of the 5th IEEE SECON Workshop on Wireless Mesh Networks (WiMesh 2010).},

address = {Boston, MA, United States.},

abstract = {Achieving reliable communication of critical data on mobile ad hoc networks is a must before MANETs can be considered practical for standard mobile and vehicular communications. This paper thus focuses on schemes that complement existing ad hoc broadcast mechanisms (inherently unreliable), which can guarantee the full diffusion of critical messages, when necessary. An interesting approach in this domain is the use of an overlay network, over which critical messages are acknowledged peer to peer, in order to verify the actual dissemination. This paper elaborates on the problem of performance, related to the discovery and the maintenance of such an overlay network, in a mobile ad hoc context. We present an analysis of a novel algorithm, SLOT (Synchronized Link Overlay - Triangular), an overlay selected based on a Relative Neighborhood Graph (RNG) scheme, and we compare its performance with that of other existing algorithms, in the context of the industry-standard IP routing protocol OSPF, which uses alternative overlay algorithms to synchronize link state databases of routers. The results presented in this paper show that SLOT outperforms other existing overlays by necessitating drastically less control traffic in order to function, enabling OSPF to scale to larger mobile ad hoc topologies.},

keywords = {Ad-Hoc, MANET, OSPF, OSPF4MANET},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Baccelli2009b,

title = {Multi-Hop Relaying Techniques with OSPF on Ad Hoc Networks},

author = {Emmanuel Baccelli and Juan Antonio Cordero and Philippe Jacquet},

url = {https://www.researchgate.net/publication/232640050_Multi-point_Relaying_Techniques_with_OSPF_on_Ad_Hoc_Networks},

year  = {2009},

date = {2009-09-01},

publisher = {Proceedings of the 4th IEEE International Conference on Systems and Networks Communications (ICSNC – SoftNet 2009)},

abstract = {Incorporating multi-hop ad hoc wireless networks in the IP infrastructure is an effort to which a growing community participates. One instance of such activity is the extension of the most widely deployed interior gateway routing protocol on the Internet, OSPF (Open Shortest Path First), for operation on Mobile Ad hoc Networks (MANETs).Such extension allows OSPF to work on heterogeneous networks encompassing both wired and wireless routers,which may self-organize as multi-hop wireless subnetworks, and be mobile. Three solutions have been proposed for this extension, among which two based on techniques derived from multi-point relaying (MPR). This paper analyzes these two approaches and identifies some fundamental discussion items that pertain to adapting OSPF mechanisms to multi hop wireless networking, before concluding with a proposal for a unique, merged solution based on this analysis.},

keywords = {Ad-Hoc, MANET, MESH, MPR, OSPF, OSPF4MANET},

pubstate = {published},

tppubtype = {inproceedings}

}

@inproceedings{Cordero2019,

title = { Modeling Dynamic Resource Allocation in the Edge},

author = {Juan Antonio Cordero and Wei Lou},

booktitle = {Proceedings of the 8th IFIP/IEEE International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks (PEMWN'2019).

},

publisher = {IEEE},

abstract = {Edge computing technologies and integrated archi- tectures have been deployed to accommodate Internet traffic growth. These architectures include facilities (cloudlets, micro DCs) to cache and serve contents close to consumers. Resulting systems adapt to observed request/consumption patterns by allowing cloudlet coordination for content caching/dissemination. This paper presents a novel analytical model of transient dy- namics of the cloudlets set. The model is used to study system convergence, stability and delivered content locality. Results from this model are validated via simulations.},

keywords = {Modeling, Performance Evaluation},

pubstate = {forthcoming},

tppubtype = {inproceedings}

}