Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails

Shared protection, such as failure dependent protection (FDP), is well recognized for its outstanding capacity efficiency in all-optical mesh networks, at the expense of lengthy restoration time due to multi-hop signaling mechanisms for failure localization, notification, and device configuration. This paper investigates a novel monitoring trail (m-trail) scenario, called Global Neighborhood Failure Localization (G-NFL), that aims to enable any shared protection scheme, including FDP, for achieving all-optical and ultra-fast failure restoration. We firstly define neighborhood of a node, which is a set of links whose failure states should be known to the node in restoration of the corresponding working lightpaths (W-LPs). By assuming every node can obtain the on-off status of traversing m-trails and W-LPs via lambda monitoring, the proposed G-NFL problem routes a set of m-trails such that each node can localize any failure in its neighborhood. Bound analysis is performed on the minimum bandwidth required for m-trails under the proposed G-NFL problem. Then a simple yet efficient heuristic approach is presented. Extensive simulation is conducted to verify the proposed G-NFL scenario under a number of different definitions of nodal neighborhood which concern the extent of dependency between the monitoring plane and data plane. The effect of reusing the spare capacity by FDP for supporting m-trails is examined. We conclude that the proposed G-NFL scenario enables a general shared protection scheme, toward signaling-free and ultra-fast failure restoration like p-Cycle, while achieving optimal capacity efficiency as FDP

Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails

Shared protection, such as failure dependent protection (FDP), is well recognized for its outstanding capacity efficiency in all-optical mesh networks, at the expense of lengthy restoration time due to multi-hop signaling mechanisms for failure localization, notification, and device configuration. This paper investigates a novel monitoring trail (m-trail) scenario, called Global Neighborhood Failure Localization (G-NFL), that aims to enable any shared protection scheme, including FDP, for achieving all-optical and ultra-fast failure restoration. We firstly define neighborhood of a node, which is a set of links whose failure states should be known to the node in restoration of the corresponding working lightpaths (W-LPs). By assuming every node can obtain the on-off status of traversing m-trails and W-LPs via lambda monitoring, the proposed G-NFL problem routes a set of m-trails such that each node can localize any failure in its neighborhood. Bound analysis is performed on the minimum bandwidth required for m-trails under the proposed G-NFL problem. Then a simple yet efficient heuristic approach is presented. Extensive simulation is conducted to verify the proposed G-NFL scenario under a number of different definitions of nodal neighborhood which concern the extent of dependency between the monitoring plane and data plane. The effect of reusing the spare capacity by FDP for supporting m-trails is examined. We conclude that the proposed G-NFL scenario enables a general shared protection scheme, toward signaling-free and ultra-fast failure restoration like p-Cycle, while achieving optimal capacity efficiency as FDP

Securing the internet of things: A worst-case analysis of trade-off between query-anonymity and communication-cost

© 2017 IEEE. Cloud services are widely used to virtualize themanagement and actuation of the real-world the Internet ofThings (IoT). Due to the increasing privacy concerns regardingquerying untrusted cloud servers, query anonymity has becomea critical issue to all the stakeholders which are related toassessment of the dependability and security of the IoT system. The paper presents our study on the problem of query receiver-anonymityin the cloud-based IoT system, where the trade-offbetween the offered query-anonymity and the incurred communicationis considered. The paper will investigate whether theaccepted worst-case communication cost is sufficient to achieve aspecific query anonymity or not. By way of extensive theoreticalanalysis, it shows that the bounds of worst-case communicationcost is quadratically increased as the offered level of anonymityis increased, and they are quadratic in the network diameter forthe opposite range. Extensive simulation is conducted to verifythe analytical assertions

DeeProBot: a hybrid deep neural network model for social bot detection based on user profile data

Use of online social networks (OSNs) undoubtedly brings the world closer. OSNs like Twitter provide a space for expressing one’s opinions in a public platform. This great potential is misused by the creation of bot accounts, which spread fake news and manipulate opinions. Hence, distinguishing genuine human accounts from bot accounts has become a pressing issue for researchers. In this paper, we propose a framework based on deep learning to classify Twitter accounts as either ‘human’ or ‘bot.’ We use the information from user profile metadata of the Twitter account like description, follower count and tweet count. We name the framework ‘DeeProBot,’ which stands for Deep Profile-based Bot detection framework. The raw text from the description field of the Twitter account is also considered a feature for training the model by embedding the raw text using pre-trained Global Vectors (GLoVe) for word representation. Using only the user profile-based features considerably reduces the feature engineering overhead compared with that of user timeline-based features like user tweets and retweets. DeeProBot handles mixed types of features including numerical, binary, and text data, making the model hybrid. The network is designed with long short-term memory (LSTM) units and dense layers to accept and process the mixed input types. The proposed model is evaluated on a collection of publicly available labeled datasets. We have designed the model to make it generalizable across different datasets. The model is evaluated using two ways: testing on a hold-out set of the same dataset; and training with one dataset and testing with a different dataset. With these experiments, the proposed model achieved AUC as high as 0.97 with a selected set of features

D2Gen: A Decentralized Device Genome Based Integrity Verification Mechanism for Collaborative Intrusion Detection Systems

Collaborative Intrusion Detection Systems are considered an effective defense mechanism for large, intricate, and multilayered Industrial Internet of Things against many cyberattacks. However, while a Collaborative Intrusion Detection System successfully detects and prevents various attacks, it is possible that an inside attacker performs a malicious act and compromises an Intrusion Detection System node. A compromised node can inflict considerable damage on the whole collaborative network. For instance, when a malicious node gives a false alert of an attack, the other nodes will unnecessarily increase their security and close all of their services, thus, degrading the system’s performance. On the contrary, if the spurious node approves malicious traffic into the system, the other nodes would also be compromised. Therefore, to detect a compromised node in the network, this article introduces a device integrity check mechanism based on “Digital Genome.” In medical science, a genome refers to a set that contains all of the information needed to build and maintain an organism. Based on the same concept, the digital genome is computed over a device’s vital hardware, software, and other components. Hence, if an attacker makes any change in a node’s hardware and software components, the digital genome will change, and the compromised node will be easily detected. It is envisaged that the proposed integrity attestation protocol can be used in diverse Internet of Things and other information technology applications to ensure the legitimate operation of end devices. This study also proffers a comprehensive security and performance analysis of the proposed framework

Computing Offloading for RIS-Aided Internet of Everything:A Cybertwin Version

Cybertwin technology introduces a novel paradigm employing digital twins to model complex physical systems within a cyber environment, thus enhancing communication, collaboration, and decision-making capabilities. By harnessing advanced technologies, such as reconfigurable intelligent surfaces (RISs) and multi-access edge computing (MEC), seamless interaction between physical and virtual entities is facilitated. In this paper, we propose a cybertwin-driven edge computing framework that leverages RIS technology, complemented by an efficient computing offloading strategy to support largescale Internet of Everything (IoE) applications. Specifically, the proposed strategy focuses on a multi-cell system where numerous randomly distributed end users have the option to offload delay-sensitive and computing-intensive tasks to edge computing nodes. The offloading channels are enhanced by RISs through passive beamforming, while cybertwin technology directs resource cooperation among multi-cells and allocates computing and communication resources. Our main objective is to optimize the system’s utility with respect to task completion latency and energy consumption reduction. To achieve this goal, we conduct the joint optimization of task offloading and resource allocation. Furthermore, we develop a joint task offloading and resource allocation (JTORA) algorithm to derive optimal solutions for passive beamforming design, computing offloading decisions, communication resource scheduling, and computing capacity allocation. The simulation results demonstrate the superiority of the proposed algorithm over benchmark schemes in terms of edge computing efficiency. Furthermore, the system utility can be further enhanced by increasing the number of embedded RIS elements