• 제목/요약/키워드: link availability

검색결과 111건 처리시간 0.031초

Security Threats and Attacks in Internet of Things (IOTs)

  • Almtrafi, Sara Mutlaq;Alkhudadi, Bdour Abduallatif;Sami, Gofran;Alhakami, Wajdi
    • International Journal of Computer Science & Network Security
    • /
    • 제21권1호
    • /
    • pp.107-118
    • /
    • 2021
  • The term Internet of Things (IoTs) refers to the future where things are known daily through the Internet, whether in one way or another, as it is done by the method of collecting various information from various sensors to form a huge network through which people, things and machines are helped to make a link between them at all time and anywhere. The IoTs is everywhere around us such as connected appliances, smart homes security systems and wearable health monitors. However, the question is what if there is a malfunction or outside interference that affects the work of these IoTs based devises? This is the reason of the spread of security causes great concern with the widespread availability of the Internet and Internet devices that are subject to many attacks. Since there aren't many studies that combines requirements, mechanisms, and the attacks of the IoTs, this paper which explores recent published studies between 2017 and 2020 considering different security approaches of protection related to the authentication, integrity, availability and confidentiality Additionally, the paper addresses the different types of attacks in IoTs. We have also addressed the different approaches aim to prevention mechanisms according to several researchers' conclusions and recommendations.

Performance Evaluation of Service-Aware Optical Transport System

  • Youn, Ji-Wook;Yu, Jea-Hoon;Yoo, Tae-Whan
    • ETRI Journal
    • /
    • 제32권2호
    • /
    • pp.241-247
    • /
    • 2010
  • We propose and experimentally demonstrate a service-aware optical transport system. The proposed service-aware optical transport system makes a flow based on service type and priority of traffic. The generated flow is mapped to a corresponding sub-${\lambda}$ for transport over an optical network. Using sub-${\lambda}$ provided by the centralized control plane, we could effectively provide quality-of-service guaranteed Ethernet service and best-effort service simultaneously in a single link. The committed information rate (CIR) traffic and best-effort traffic are assigned to different sub-${\lambda}s$. The bandwidth of the CIR traffic is guaranteed without being affected by violation traffic because the bandwidth is managed per each sub-${\lambda}$. The failure detection time and restoration time from a link failure is measured to be about 60 ${\mu}s$ and 22 ms, respectively, in the ring network. The measured restoration time is much smaller than the 50 ms industry requirement for real-time services. The fast restoration time allows the proposed service-aware optical transport system to offer high availability and reliability which is a requirement for transport networks.

Resilient Packet Transmission (RPT) for the Buffer Based Routing (BBR) Protocol

  • Rathee, Geetanjali;Rakesh, Nitin
    • Journal of Information Processing Systems
    • /
    • 제12권1호
    • /
    • pp.57-72
    • /
    • 2016
  • To provide effective communication in the wireless mesh network (WMN), several algorithms have been proposed. Since the possibilities of numerous failures always exist during communication, resiliency has been proven to be an important aspect for WMN to recover from these failures. In general, resiliency is the diligence of the reliability and availability in network. Several types of resiliency based routing algorithms have been proposed (i.e., Resilient Multicast, ROMER, etc.). Resilient Multicast establishes a two-node disjoint path and ROMER uses a credit-based approach to provide resiliency in the network. However, these proposed approaches have some disadvantages in terms of network throughput and network congestion. Previously, the buffer based routing (BBR) approach has been proposed to overcome these disadvantages. We proved earlier that BBR is more efficient in regards to w.r.t throughput, network performance, and reliability. In this paper, we consider the node/link failure issues and analogous performance of BBR. For these items we have proposed a resilient packet transmission (RPT) algorithm as a remedy for BBR during these types of failures. We also share the comparative performance analysis of previous approaches as compared to our proposed approach. Network throughput, network congestion, and resiliency against node/link failure are particular performance metrics that are examined over different sized WMNs.

응급구조사 교육 분야에서 의료 시뮬레이션의 활용 방안 모색 (An Exploration on the Use of Medical Simulation in Emergency Medical Technician Education)

  • 김지희
    • 한국화재소방학회논문지
    • /
    • 제21권3호
    • /
    • pp.104-112
    • /
    • 2007
  • 교육, 훈련, 연구에 사용된 의료 시뮬레이션 교육으로서 마네킹 시뮬레이터(mannequin simulator)의 개발은 오랜 시간에 걸쳐 이루어지고 있으며, 심폐소생술, 심장 수술, 마취 임상 수기, 위기관리(crisis management)에 대한 효율성 평가로 이어졌다. 최근 한국의 여러 의과대학에서 시뮬레이션 교육을 도입하여 임상 수기 교육을 하고 있으며, 시뮬레이션 센터를 설립하고 있다. 선진국의 응급의학분야에서 응급구조사의 역할이 매우 중요하게 대두되고 있으며, 한국에서 응급구조사의 효율적인 교육과 역할 수행을 위해 마네킹 시뮬레이터를 이용한 교육이 매우 중요하다. 본 연구는 이러한 의학 분야 시뮬레이션이 의과대학 교육뿐 아니라 구조구급 분야에 종사하는 소방공무원, 간호사, 응급구조사 양성 교육 등 의료의 여러 영역에서 다양하게 이용되는 의료시뮬레이션 진화와 교육에 대해 소개하고자 한다.

A Novel Bio-inspired Trusted Routing Protocol for Mobile Wireless Sensor Networks

  • Zhang, Mingchuan;Xu, Changqiao;Guan, Jianfeng;Zheng, Ruijuan;Wu, Qingtao;Zhang, Hongke
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권1호
    • /
    • pp.74-90
    • /
    • 2014
  • Routing in mobile wireless sensor networks (MWSNs) is an extremely challenging issue due to the features of MWSNs. In this paper, we present a novel bio-inspired trusted routing protocol (B-iTRP) based on artificial immune system (AIS), ant colony optimization (ACO) and Physarum optimization (PO). For trust mechanism, B-iTRP monitors neighbors' behavior in real time and then assesses neighbors' trusts based on AIS. For routing strategy, each node proactively finds routes to the Sink based on ACO. When a backward ant is on the way to return source, it senses the energy residual and trust value of each node on the discovered route, and calculates the link trust and link energy of the route. Moreover, B-iTRP also assesses the availability of route based on PO to maintain the route table. Simulation results show how B-iTRP can achieve the effective performance compared to existing state-of-the-art algorithms.

IoT 응용을 위한 결함 포용 발행/구독 시스템의 설계 및 평가 (Design and Evaluation of a Fault-tolerant Publish/Subscribe System for IoT Applications)

  • 배인한
    • 한국멀티미디어학회논문지
    • /
    • 제24권8호
    • /
    • pp.1101-1113
    • /
    • 2021
  • The rapid growth of sense-and-respond applications and the emerging cloud computing model present a new challenge: providing publish/subscribe middleware as a scalable and elastic cloud service. The publish/subscribe interaction model is a promising solution for scalable data dissemination over wide-area networks. In addition, there have been some work on the publish/subscribe messaging paradigm that guarantees reliability and availability in the face of node and link failures. These publish/subscribe systems are commonly used in information-centric networks and edge-fog-cloud infrastructures for IoT. The IoT has an edge-fog cloud infrastructure to efficiently process massive amounts of sensing data collected from the surrounding environment. In this paper. we propose a quorum-based hierarchical fault-tolerant publish/subscribe systems (QHFPS) to enable reliable delivery of messages in the presence of link and node failures. The QHFPS efficiently distributes IoT messages to the publish/subscribe brokers in fog overlay layers on the basis of proposing extended stepped grid (xS-grid) quorum for providing tolerance when faced with node failures and network partitions. We evaluate the performance of QHFPS in three aspects: number of transmitted Pub/Sub messages, average subscription delay, and subscritpion delivery rate with an analytical model.

DPW-RRM: Random Routing Mutation Defense Method Based on Dynamic Path Weight

  • Hui Jin;Zhaoyang Li;Ruiqin Hu;Jinglei Tan;Hongqi Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권11호
    • /
    • pp.3163-3181
    • /
    • 2023
  • Eavesdropping attacks have seriously threatened network security. Attackers could eavesdrop on target nodes and link to steal confidential data. In the traditional network architecture, the static routing path and the important nodes determined by the nature of network topology provide a great convenience for eavesdropping attacks. To resist monitoring attacks, this paper proposes a random routing mutation defense method based on dynamic path weight (DPW-RRM). It utilizes network centrality indicators to determine important nodes in the network topology and reduces the probability of important nodes in path selection, thereby distributing traffic to multiple communication paths, achieving the purpose of increasing the difficulty and cost of eavesdropping attacks. In addition, it dynamically adjusts the weight of the routing path through network state constraints to avoid link congestion and improve the availability of routing mutation. Experimental data shows that DPW-RRM could not only guarantee the normal algorithmic overhead, communication delay, and CPU load of the network, but also effectively resist eavesdropping attacks.

MPLS 망에서 차별화 된 서비스를 제공하기 위한 빠른 Multipoint-to-Point LSP 결정 방식 (A Fast Multipoint-to-Point LSP Traffic Engineering for Differentiated Service in MPLS Networks)

  • 김성관;조영종
    • 대한전자공학회논문지TC
    • /
    • 제39권5호
    • /
    • pp.232-242
    • /
    • 2002
  • MPLS(Multiprotocol Label Switching) 망에서 LSP(Lable Switched Path)의 수와 레이블 수를 줄이는 것은 망의 자원 관리 측면에서 매우 중요하며, MTP(Multipoint-to-Point) LSP는 이러한 문제점을 해결할 수 있다. 트래픽 엔지니어링을 고려할 때, MTP LSP는 트래픽 부하의 균형을 통한 망의 가용성과 링크 사용율을 높이는 경로를 선택하여야 한다. 또한 링크 단절시의 재 경로 설정이 요구되므로 빠른 경로 결정 방법이 요구된다. 본 논문은 Diffserv를 지원하는 MPLS 망에서, Diffserv의 PHB(Per Hop Behavior)와 다중경로 MTP LSP간의 매핑을 통한 트래픽 엔지니어링을 제안한다. 제안하는 트래픽 엔지니어링은 서비스 특성에 따라 계층적인 MTP LSP의 다중 경로를 결정한다. Monte-Carlo 방법을 사용한 빠른 트래픽 부하 균형 해를 구함으로써, 망 형태 정보가 빈번히 변하는 대규모 망에서 신속한 재 경로 결정을 할 수 있다. 제안하는 MTP LSP의 경로 결정 방법은 알고리즘의 수행 정도에 따라 최적의 경로 결정에 접근한다. 경로 결정의 시간 복잡도는 O(Cn²logn)으로 기존의 다중 경로 결정 방법과 동일한 시간 복잡도를 가지며, 선형 프로그래밍 접근보다 빠른 수행 시간을 갖는다. 시뮬레이션 결과 제안하는 알고리즘은 망의 형태정보와 요구하는 트래픽 부하 균형에 따라 효과적으로 제어될 수 있음을 보이며, 또한 제안하는 트래픽 엔지니어링의 호 차단율과 대역폭 차단율을 비교함으로써 망의 가용성이 기존의 다중경로 설정보다 높음을 보인다.

Gateway Discovery Algorithm Based on Multiple QoS Path Parameters Between Mobile Node and Gateway Node

  • Bouk, Safdar Hussain;Sasase, Iwao;Ahmed, Syed Hassan;Javaid, Nadeem
    • Journal of Communications and Networks
    • /
    • 제14권4호
    • /
    • pp.434-442
    • /
    • 2012
  • Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

위성 PEP시스템에서 ACM 지원을 위한 적응형 TCP 혼잡제어기법 (Adaptive Congestion Control Scheme of TCP for Supporting ACM in Satellite PEP System)

  • 박만규;강동배;오덕길
    • 한국위성정보통신학회논문지
    • /
    • 제8권1호
    • /
    • pp.1-7
    • /
    • 2013
  • 최근 위성 통신 시스템은 링크 가용도와 대역폭 효율을 증대시키기 위해 ACM(Adaptive Coding and Modulation) 기술을 사용하고 있지만, PEP(Performance Enhancing Proxy)에서 동작하는 TCP는 ACM 동작에 따라 변경된 물리계층 전송능력을 감지하지 못하고 작아진 BDP (Bandwidth Delay Product) 네트워크에 혼잡을 발생 시킨다. 본 논문에서는 ACM과 PEP를 사용할 때 발생되는 문제점을 극복하여 PEP의 성능을 향상시키는 기법을 제안한다. 이를 위해 ACM기능을 지원하는 물리/MAC(링크)계층 모듈과 전송계층 모듈인 TCP 간에 정보 전달 메시지를 적용하여 물리/MAC(링크)계층의 정보가 TCP에 전달되도록 하여 MODCOD (Modulation and Coding)에 따라 변경되는 물리계층 대역폭을 고려한 적응적인 TCP 혼잡제어를 수행하도록 하였다. 제안한 기법에 대해서 ns-2를 이용한 모의시험 결과 물리계층과 전송계층간의 전송 속도를 적응적으로 정합시킴으로써 네트워크의 혼잡을 미리 방지하고 최적화된 혼잡제어를 수행함으로써 PEP 성능을 향상 시킬 수 있음을 보였다.