• Title/Summary/Keyword: centralized network

Search Result 496, Processing Time 0.03 seconds

A Study on Distributed Indexing Technique for Digital Library (디지털 도서관을 위한 분산색인 기법에 대한 연구)

  • Yu, Chun-Sik;Lee, Jong-Deuk;Kim, Yong-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.315-325
    • /
    • 1999
  • Indexing techniques for distributed resources have much effect on an information service system based on distributed environment like digital library. There is a centralized indexing technique, a distributed technique, and a mixed technique for distributed indexing techniques. In this paper, we propose new distributed indexing technique using EIF(extended Inverted File) structure that mix the centralized technique and t도 distributed technique. And we propose management techniques using EIF structure and retrieval technique using EIF structure. This distributed indexing technique proposed is able to fast process retrieval request and reduce network overload and select servers relevant to query terms. This paper investigated performance of a proposed distributed indexing technique.

  • PDF

A Novel Approach of Using Data Flipping for Efficient Energy on the Internet of Things

  • Ziyad Almudayni;Ben Soh;Alice Li
    • Journal of information and communication convergence engineering
    • /
    • v.21 no.3
    • /
    • pp.185-191
    • /
    • 2023
  • The Internet of Things (IoT) can be defined as the connection of devices, sensors, and actors via the Internet to a single network to provide services to end-users. Owing to the flexibility and simplicity of IoT devices, which impart convenience to end-users, the demand for these devices has increased significantly in the last decade. To make these systems more scalable, achieve a larger number of connected devices, and achieve greater economic success, it is vital to develop them by considering parameters such as security, cost, bandwidth, data rate, and power consumption. This study aims to improve energy efficiency and prolong the lifetime of IoT networks by proposing a new approach called the constrained application protocol CoAP45. This approach reduces the number of updates to the CoAP server using a centralized resource. The simulation results show that the proposed approach outperforms all existing protocols.

Technology Standard Trends in Distributed and Edge Cloud Computing (분산 및 에지 클라우드 기술 표준 동향)

  • M.K. In;K.C. Lee;S.Y. Lee
    • Electronics and Telecommunications Trends
    • /
    • v.39 no.3
    • /
    • pp.69-78
    • /
    • 2024
  • Cloud computing technology based on centralized high-performance computing has brought about major changes across the information technology industry and led to new paradigms. However, with the rapid development of the industry and increasing need for mass generation and real-time processing of data across various fields, centralized cloud computing is lagging behind the demand. This is particularly critical in emerging technologies such as autonomous driving, the metaverse, and augmented/virtual reality that require the provision of services with ultralow latency for real-time performance. To address existing limitations, distributed and edge cloud computing technologies have recently gained attention. These technologies allow for data to be processed and analyzed closer to their point of generation, substantially reducing the response times and optimizing the network bandwidth usage. We describe distributed and edge cloud computing technologies and explore the latest trends in their standardization.

A Study on QoS Routing Performance Enhancement by using LSQR Scheduling in WiMAX Mesh Networks (와이맥스 메쉬 네트워크에서 LSQR 스케줄링을 이용한 QoS 라우팅 성능 향상에 관한 연구)

  • Tak, Wooyoung;Lee, Gowoon;Joh, Hangki;Ryoo, Intae
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.429-437
    • /
    • 2013
  • Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

Design and Evaluation of a Weighted Intrusion Detection Method for VANETs (VANETs을 위한 가중치 기반 침입탐지 방법의 설계 및 평가)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.3
    • /
    • pp.181-188
    • /
    • 2011
  • With the rapid proliferation of wireless networks and mobile computing applications, the landscape of the network security has greatly changed recently. Especially, Vehicular Ad Hoc Networks maintaining network topology with vehicle nodes of high mobility are self-organizing Peer-to-Peer networks that typically have short-lasting and unstable communication links. VANETs are formed with neither fixed infrastructure, centralized administration, nor dedicated routing equipment, and vehicle nodes are moving, joining and leaving the network with very high speed over time. So, VANET-security is very vulnerable for the intrusion of malicious and misbehaving nodes in the network, since VANETs are mostly open networks, allowing everyone connection without centralized control. In this paper, we propose a weighted intrusion detection method using rough set that can identify malicious behavior of vehicle node's activity and detect intrusions efficiently in VANETs. The performance of the proposed scheme is evaluated by a simulation study in terms of intrusion detection rate and false alarm rate for the threshold of deviation number ${\epsilon}$.

Performance Evaluation of Distributed Cooperative MAC Protocol Algorithm for Enhancing Multimedia QoS of WiMedia Communication Network (와이미디어 통신네트워크의 멀티미디어 QoS 개선을 위한 분산협력방식 MAC 프로토콜 성능분석)

  • Kim, Jin-Woo;Lee, Yeon-Woo;Lee, Seong-Ro
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.516-525
    • /
    • 2012
  • In this paper, an efficient technique for enhancing the QoS of multimedia service for an WiMedia network applying distributed cooperative medium access (D-MAC) protocol is proposed. D-MAC protocol has been proposed to support high-rate Wireless Personal Area Networks (HR-WPANs) by the WiMedia Alliance. Unlike the centralized IEEE 802.15.3 MAC, the D-MAC UWB specified by WiMedia supports all devices to be self-organized and removes the SOP (Simultaneous Operating Piconet) problem, i.e., packet collisions between overlapped piconets in the centralized IEEE 802.15.3 MAC. However the WiMedia D-MAC can't prevent reduce the throughput degradation occurred by mobile nodes with low data rate. Therefore, a distributed cooperative MAC protocol for multi-hop UWB network is proposed in this paper. The proposed technique can intelligently select the transmission path with higher data rate to provide real-time multimedia services with minimum delay, thus enhances QoS of multimedia service.

Detecting Members of P2P Botnets Using Probabilistic Dye-Pumping Algorithm (Probabilistic Dye-Pumping 알고리즘을 이용한 P2P 봇넷 멤버 탐지)

  • Choi, Seung-hwan;Park, Hyo-seong;Kim, Ki-chang
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.744-748
    • /
    • 2012
  • Botnet is a network that consists of bot hosts infected by malware. The C&C server of centralized botnet, which is being used widely, is relatively easy to detect, while detecting P2P botnet is not a trivial problem because of the existence of many avoiding techniques. In this paper, we separate the network into inner and outer sub-network at the location of the router, and analyze the method of detecting botnet using path of packet and infection probability. We have extended Dye-Pumping algorithm in order to detect P2P botnet members more accurately, and we expect that the analysis of the results can be used as a basis of techniques that detect and block P2P botnet in the networks.

  • PDF

Topology-aware Chord system for efficient lookup (효율적인 탐색을 위한 위상 인지 Chord 시스템)

  • Kim, Jun-Hong;Jo, In-June;Kim, Seung-Hae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.89-92
    • /
    • 2005
  • Centralized P2P system, Napster and Unstructured P2P system, Gnutella accomplish main current. Centralized system and unstructured system have a restriction in a scalability. To solve the this problem, structured system is appeared. CAN, Chord, Pastry and Tapestry are delegation of this system. Although structured system don't aware physical proximity of node because it uses Distribute Hash Table. In proposing system, a node can communicate with physical proximity of node using concept of LAN. Internet traffic is also decreased because communication in the Chord network divide in two(original network and sub network).

  • PDF

Kalman Filtering-based Traffic Prediction for Software Defined Intra-data Center Networks

  • Mbous, Jacques;Jiang, Tao;Tang, Ming;Fu, Songnian;Liu, Deming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.2964-2985
    • /
    • 2019
  • Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

Fixing Security Flaws of URSA Ad hoc Signature Scheme (URSA 애드혹 서명 알고리즘의 오류 수정)

  • Yi, Jeong-Hyun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.4
    • /
    • pp.131-136
    • /
    • 2007
  • Ad hoc networks enable efficient resource aggregation in decentralized manner, and are inherently scalable and fault-tolerant since they do not depend on any centralized authority. However, lack of a centralized authority prompts many security-related challenges. Moreover, the dynamic topology change in which network nodes frequently join and leave adds a further complication in designing effective and efficient security mechanism. Security services for ad hoc networks need to be provided in a scalable and fault-tolerant manner while allowing for membership change of network nodes. In this paper, we investigate distributed certification mechanisms using a threshold cryptography in a way that the functions of a CA(Certification Authority) are distributed into the network nodes themselves and certain number of nodes jointly issue public key certificates to future joining nodes. In the process, we summarize one interesting report [5] in which the recently proposed RSA-based ad hoc signature scheme, called URSA, contains unfortunate yet serious security flaws. We then propose new scheme by fixing their security flaws.