| 1. |
- Chiesa, Marco, 1987-, et al.
(författare)
-
The quest for resilient (static) forwarding tables
- 2016
-
Ingår i: INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, IEEE. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467399531
-
Konferensbidrag (refereegranskat)abstract
- Fast Reroute (FRR) and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. We embark upon a systematic algorithmic study of the resiliency of immediate failover in a variety of models (with/without packet marking/duplication, etc.). We leverage our findings to devise new schemes for immediate failover and show, both theoretically and experimentally, that these outperform existing approaches.
|
|
| 2. |
|
|
| 3. |
- Pikulev, V. B., et al.
(författare)
-
Singlet oxygen inhibits nonradiative defects in porous silicon
- 2009
-
Ingår i: PHYSICA STATUS SOLIDI A-APPLICATIONS AND MATERIALS SCIENCE. - : Wiley. - 1862-6300. ; 206:6, s. 1268-1272
-
Tidskriftsartikel (refereegranskat)abstract
- Experimental evidences are presented for the first time that singlet oxygen generated ex situ acts as an inhibitor of nonradiative recombination in porous silicon (PSi). This effect is observed on a pristine PSi as well as on degraded porous layers quenched by ozone adsorption. A photoluminescence (PL) enhancement produced by singlet oxygen is accompanied with only slight oxidation of a PSi. We assume that the observed effect on PL efficiency is due to gentle selective oxidation of single defects on silicon nanocrystal surface.
|
|
| 4. |
- Chiesa, Marco, 1987-, et al.
(författare)
-
On the resiliency of randomized routing against multiple edge failures
- 2016
-
Ingår i: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. - : Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. - 9783959770132
-
Konferensbidrag (refereegranskat)abstract
- We study the Static-Routing-Resiliency problem, motivated by routing on the Internet: Given a graph G = (V, E), a unique destination vertex d, and an integer constant c > 0, does there exist a static and destination-based routing scheme such that the correct delivery of packets from any source s to the destination d is guaranteed so long as (1) no more than c edges fail and (2) there exists a physical path from s to d? We embark upon a study of this problem by relating the edge-connectivity of a graph, i.e., the minimum number of edges whose deletion partitions G, to its resiliency. Following the success of randomized routing algorithms in dealing with a variety of problems (e.g., Valiant load balancing in the network design problem), we embark upon a study of randomized routing algorithms for the Static-Routing-Resiliency problem. For any k-connected graph, we show a surprisingly simple randomized algorithm that has expected number of hops O(|V|k) if at most k-1 edges fail, which reduces to O(|V|) if only a fraction t of the links fail (where t < 1 is a constant). Furthermore, our algorithm is deterministic if the routing does not encounter any failed link.
|
|
| 5. |
- Chiesa, Marco, 1987-, et al.
(författare)
-
On the Resiliency of Static Forwarding Tables
- 2017
-
Ingår i: IEEE/ACM Transactions on Networking. - : Institute of Electrical and Electronics Engineers (IEEE). - 1063-6692 .- 1558-2566. ; 25:2, s. 1133-1146
-
Tidskriftsartikel (refereegranskat)abstract
- Fast reroute and other forms of immediate failover have long been used to recover from certain classes of failures without invoking the network control plane. While the set of such techniques is growing, the level of resiliency to failures that this approach can provide is not adequately understood. In this paper, we embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packet-headerrewriting, with packet-duplication). Our results show that the resiliency of a routing scheme depends on the "connectivity" k of a network, i.e., the minimum number of link deletions that partition a network. We complement our theoretical result with extensive simulations. We show that resiliency to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplication or randomization. Furthermore, our routing schemes provide resiliency against k - 1 failures, with limited path stretch, by storing log(k) bits in the packet header, with limited packet duplication, or with randomized forwarding technique.
|
|
| 6. |
|
|
| 7. |
- Islam, Hasan M. A., et al.
(författare)
-
CIDOR: Content Distribution and Retrieval in Disaster Networks for Public Protection
- 2017
-
Ingår i: 2017 IEEE 13TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB). - : IEEE. - 9781538638392 ; , s. 324-333
-
Konferensbidrag (refereegranskat)abstract
- Information-Centric Networking (ICN) introduces a paradigm shift from a host centric communication model for Future Internet architectures. It supports the retrieval of a particular content regardless of the physical location of the content. Emergency network in a disaster scenario or disruptive network presents a significant challenge to the ICN deployment. In this paper, we present a Content dIstribution and retrieval framework in disaster netwOrks for public pRotection (CIDOR) which exploits the design principle of the native CCN architecture in the native Delay Tolerant Networking (DTN) architecture. We prove the feasibility and investigate the performance of our proposed solution using extensive simulation with different classes of the DTN routing strategies in different mobility scenarios. The simulation result shows that CIDOR can reduce the content retrieval time up to 50% while the response ratio is close to 100%.
|
|
| 8. |
- Khan, Suleman, et al.
(författare)
-
Post Quantum Secure Handover Mechanism for Next Generation Aviation Communication Networks
- 2024
-
Ingår i: IEEE Transactions on Green Communications and Networking. - : Institute of Electrical and Electronics Engineers (IEEE). - 2473-2400. ; , s. 1-17
-
Tidskriftsartikel (refereegranskat)abstract
- The L-band Digital Aeronautical Communications System (LDACS) is a key advancement for next-generation aviation networks, enhancing Communication, Navigation, and Surveillance (CNS) capabilities. It operates with VHF Datalink mode 2 (VDLm2) and features a seamless handover mechanism to maintain uninterrupted communication between aircraft and ground stations (GSs), improving safety and efficiency in air traffic management (ATM). However, LDACS’ handover process encounters significant security risks due to inadequate authentication and key agreement between aircraft and ground station controllers (GSCs) during handovers. This vulnerability threatens communications’ confidentiality, integrity, and authenticity, posing risks to flight safety and sensitive data. Therefore, developing and implementing a robust security framework to protect aviation communications is essential. In response, we have proposed a security solution specifically designed to protect LDACS handovers. Our solution uses a mutual authentication and key agreement mechanism tailored for LDACS handovers, ensuring robust security for all types of handovers, including Intra GSC -Intra Aeronautical Telecommunication Network (ATN), Inter GSC -Intra ATN, and Inter GSC -Inter ATN. Our approach utilizes post-quantum cryptography to protect aviation communication systems against potential post-quantum threats, such as unauthorized access to flight data, interception of communication, and spoofing of aircraft identity. Furthermore, our proposed solution has undergone a thorough informal security analysis to ensure its effectiveness in addressing handover challenges and offering robust protection against various threats. It seamlessly integrates with the LDACS framework, delivering low Bit Error Rate (BER) and latency levels, making it a highly reliable approach in practice.
|
|
| 9. |
- Mas-Machuca, Carmen, et al.
(författare)
-
Reliable Control and Data Planes for Softwarized Networks
- 2020
-
Ingår i: Guide to Disaster-Resilient Communication Networks. - : Springer. - 9783030446840 - 9783030446857 - 9783030446871 ; , s. 243-270
-
Bokkapitel (refereegranskat)abstract
- Driven by the requirement of increasing performance and flexibility, networks are being softwarized by paradigms such as software-defined networking (SDN) and network function virtualization (NFV). These solutions reduce the complexity and the specialization of hardware devices, by extracting the inherently distributed control plane of forwarding network elements such as switches and routers, to a logically centralized control plane (referred as controller in SDN). The control plane acts as a broker between the network applications (e.g. monitoring, traffic engineering) and the data plane (i.e. physical network infrastructure). For scalability and robustness, the logically centralized control plane is implemented by physically distributing different controllers throughout the network. This chapter presents different solutions to increase the reliability of both planes: data and control planes. The reliability of the data plane can be increased by considering survivable virtual network embedding solutions. This chapter proposes a survivable embedding against single and double failures at either links or nodes. Furthermore, in order to provide a programmable and resilient data plane, BPFabric has been proposed for SDN which supports high performance functions suitable for detecting attacks. On the other hand, the reliability of the control plane applied to SDN can be addressed by considering enhanced controller placement solutions providing redundancy against uncorrelated as well as targeted failures while coping with latency and capacity requirements. Furthermore, a solution to increase the security and robustness of the control channel is also addressed in this chapter.
|
|
