• Title/Summary/Keyword: centralized network

Search Result 496, Processing Time 0.023 seconds

Research on Science DMZ scalability for the high performance research data networking (연구데이터의 고성능 네트워킹을 위한 Science DMZ 확장성 연구)

  • Lee, Chankyun;Jang, Minseok;Noh, Minki;Seok, Woojin
    • KNOM Review
    • /
    • v.22 no.2
    • /
    • pp.22-28
    • /
    • 2019
  • A Science DeMilitarized Zone (DMZ) is an optimized network technology tailored to research data nature. The Science DMZ guarantees end-to-end network performance by forming a closed research network without redundant networking and security devices for the authorized researchers. Data Transfer Node (DTN) is an essential component for the high performance and security of the Science DMZ, since only transfer functions of research data are allowed to the DTN without any security- and performance-threatening functions such as commercial internet service. Current Science DMZ requires per-user DTN server installation which turns out a scalability limitation of the networks in terms of management overhead, entry barrier of the user, and networks-wise CAPEX. In order to relax the aforementioned scalability issues, this paper suggests a centralized DTN design where end users in a group can share the centralized DTN. We evaluate the effectiveness of the suggested sharable DTN design by comparing CAPEX against to that of current design with respect to the diverse network load and the state-of-the-art computing machine.

Design of a High-Speed Data Packet Allocation Circuit for Network-on-Chip (NoC 용 고속 데이터 패킷 할당 회로 설계)

  • Kim, Jeonghyun;Lee, Jaesung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.459-461
    • /
    • 2022
  • One of the big differences between Network-on-Chip (NoC) and the existing parallel processing system based on an off-chip network is that data packet routing is performed using a centralized control scheme. In such an environment, the best-effort packet routing problem becomes a real-time assignment problem in which data packet arriving time and processing time is the cost. In this paper, the Hungarian algorithm, a representative computational complexity reduction algorithm for the linear algebraic equation of the allocation problem, is implemented in the form of a hardware accelerator. As a result of logic synthesis using the TSMC 0.18um standard cell library, the area of the circuit designed through case analysis for the cost distribution is reduced by about 16% and the propagation delay of it is reduced by about 52%, compared to the circuit implementing the original operation sequence of the Hungarian algorithm.

  • PDF

Analytical Models and Performance Evaluations of SNMP and Mobile Agent (SNMP와 이동에이전트의 해석적 모델 및 성능 평가)

  • 이정우;윤완오;신광식;최상방
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8B
    • /
    • pp.716-729
    • /
    • 2003
  • As the public Internet and private internet have grown from small networks into large infrastructures, the need to more systematically manage the large number of network components within these networks has grown more important as well. The rapid growth of network size has brought into question the salability of the existing centralized model, such as SNMP(Simple Network Management Protocol) and CMIP(Common Management Information Protocol). Thus, for efficient network management, researches about mobile agent have also been performed recently. This paper presents analytical models of centralized approach based on SNMP protocol, distributed approach based on mobile agent, and mixed mode to make up for shortcomings of SNMP and mobile agent. We compare the performance of these analytical models based on network management response time. Experiment results show that performance of mobile agent and the nixed mode is less sensitive to the delay in WAN network environment. However, SNMP is more efficient for the simple network environment like LAN. We also propose an adaptive network management algorithm in consideration of network t environment. delay, task, and the number of nodes based on the results of analytical models. The results show that the adaptive network management algorithm can reduce the network management response time by 10% compared with either mobile agent or mixed mode network management algorithm.

OFDM Star Network Based on Carrier Distribution (캐리어 분배에 의한 OFDM 스타망에 관한 고찰)

  • 채창준
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.1
    • /
    • pp.281-290
    • /
    • 1996
  • In this paper we suggest an OFDM star network based on carrier distribution and homodyne detection in which all optical carriers generated and stabilized in a specific node are distributed to each node. We studied ASK and PSK modulation schemes and calculated rspective SNRs and BERs for this network. We also discussed on the optical power requirement on the light sources for 200 Mb/s transmission speed. As a result, we found tht ASK and PSK respectively require 13 dBm and 10 dBm for 32 nodes and the nmber of nodes can be expanded to 73 with only 0 dBm of power and minimum insertion losses of components. The proposed network is more reliable than the conventional ones due to the centralized carrier maintenance andthe network is suitable for the adverse environment of the nodes.

  • PDF

Authentication Scheme in Wireless Mobile Multi-hop Networks (무선 모바일 멀티 홉 네트워크에서의 인증 기법 고찰 및 개선)

  • Lee, Yong;Lee, Goo Yeon
    • Journal of Industrial Technology
    • /
    • v.27 no.B
    • /
    • pp.43-51
    • /
    • 2007
  • In mobile multi-hop wireless networks, the authentication between a base station and a mobile multi-hop node, between multi-hop nodes, and between user a station and a multi-hop node is needed for the reliable and secure network operation. In this paper, we survey various authentication schemes which can be considered to be adopted in mobile multi-hop wireless networks and propose a concept of novel mutual authentication scheme applicable to mobile multi-hop network architecture. The scheme should resolve the initial trust gain problem of a multi-hop node at its entry to the network, the problem of rogue mobile multi-hop node and the problem of hop-by-hop authentication between multi-hop nodes. Effectively, the scheme is a hybrid scheme of the distributed authentication method and the centralized authentication method which are considered to be deployed in the wireless ad-hoc network and the wireless network connected to wired authentication servers, respectively.

  • PDF

Network Management System Based upon Mobile Agent using JNUI (JNDI를 이용한 Mobile Agent 기반 망관리 시스템)

  • 김정철;송왕철
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.11a
    • /
    • pp.406-410
    • /
    • 1999
  • This paper supposes the SNMP network management system based upon Mobile Agent using the Naming and Directory Service, which is JNDI(Java Naming Directory Interface) technology. The Mobile Agent network system is expected to provide a solution for the conventional centralized network system. So, We have designed and implemented the network management system based upon Mobile Agent using JNDI

  • PDF

Tree-based Multi-channel Communication with Interference Avoidance using Dynamic Channel Switching in Wireless Sensor Network

  • Mohd, Noor Islam;Choi, Sun-Woong;Jang, Yeong-Min
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1498-1505
    • /
    • 2009
  • In centralized control sensor network, tree-based multi-channel communication overcomes the recurrent channel switching and makes possible to transfer data simultaneously from different sources. In our paper, we propose a greedy algorithm named as NIT (Non-Intersecting Tree) that the trees can avoid inter-tree interference. We also propose channel switching technique by which trees can avoid link failure or area blocking due to external interference locally without rerunningthe algorithm and without interrupting the whole network. At first we applied our algorithm for a random topology and then we evaluate the performance of the network using NS-2 simulator. The results show that with the increasing of channel the throughputand delivery ratio are increased significantly. We got better performance than a using a recent proposed Tree-based Multi-Channel Protocol (TMCP).

Towards a Scalable SDN Hypervisors Framework

  • Aamir Hussain;Sajid Ali;Mubashir Ali;Sarfraz Hashim
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.2
    • /
    • pp.67-78
    • /
    • 2024
  • Software-Defined Networking (SDN) is a new emerging networking paradigm that has adopted a logically centralized architecture to increase overall network performance agility and programmability. Combining network virtualization with SDN will guarantees for combined advantages of improved flexibility and network performance. Combining SDN with hypervisors divides the network physical resources into several logical transparent and isolated virtual SDN network (vSDN), where each has its virtual controller. However, SDN hypervisors bring several advantages as well as several challenges to its network operators as for the virtual appliances, their efficient placement, assurance of network performance is mandatory, and their dynamic instantiation with their migration. In this article, we provide a brief and concise review of network virtualization along with its implementation in the SDN network. SDN hypervisors types are discussed, and taxonomy is provided to demonstrate the importance of hypervisors in SDN. A comparison of SDN hypervisors is performed to elaborate on the vital hypervisor software along with their features, and different challenges are discussed faced by the SDN network. A framework is proposed to add combined functionalities of hypervisors to create a more effective and efficient virtual system. The purpose of the framework is to increase network performance through proper configuration of resources, software, control plane isolation functions with defined rules and policies.

A Simulation Modeling for the Effect of Resource Consumption Attack over Mobile Ad Hoc Network

  • Raed Alsaqour;Maha Abdelhaq;Njoud Alghamdi;Maram Alneami;Tahani Alrsheedi;Salma Aldghbasi;Rahaf Almalki;Sarah Alqahtani
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.9
    • /
    • pp.111-119
    • /
    • 2023
  • Mobile Ad-hoc Network (MANET) is an infrastructure-less network that can configure itself without any centralized management. The topology of MANET changes dynamically which makes it open for new nodes to join it easily. The openness area of MANET makes it very vulnerable to different types of attacks. One of the most dangerous attacks is the Resource Consumption Attack (RCA). In this type of attack, the attacker consumes the normal node energy by flooding it with bogus packets. Routing in MANET is susceptible to RCA and this is a crucial issue that deserves to be studied and solved. Therefore, the main objective of this paper is to study the impact of RCA on two routing protocols namely, Ad hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); as a try to find the most resistant routing protocol to such attack. The contribution of this paper is a new RCA model (RCAM) which applies RCA on the two chosen routing protocols using the NS-2 simulator.

Design and Analysis of Role-based Security Management Model for Policy-based Security Management in SNMPv3 Network (SNMPv3 통신망의 정책기반 보안관리를 위한 역할기반 보안관리 모델의 설계 및 분석)

  • Ju, Gwang-Ro;Lee, Hyeong-Ho;No, Bong-Nam
    • The KIPS Transactions:PartC
    • /
    • v.8C no.5
    • /
    • pp.573-584
    • /
    • 2001
  • Policy-Based Network Management (PBNM) architecture is to meet various needs of network users and to provide effective management facilities in distributed and large scale networks to network managers. In PBNM, network managers perform network management operations by stipulating a set of rules rather than control each network component. On the other hand, providing security services such as authentication, privacy of messages as well as a new flexible and extensible administration framework, SNMPv3 enables network managers to monitor and control the operation of network components more secure way than ever before. Despite of its enhanced security services, SNMPv3 has difficulties in managing distributed, large-scaled network because it does not provide centralized security management facilities. In this paper, we propose a new security model called Role-based Security Management model (RSM) with security management policy to support scalable and centralized security management for SNMP-based networks. Also, the structure and the operation of the security system as well as the efficiency analysis of RSM in terms of security management are also described.

  • PDF