• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.9-17
• /
• 2010

Internet network routing system is used to prevent spread and distribution of malicious data traffic. The penetration of malicious code and the function of security blocking are performed on the same course of traffic pathway. The security architecture is the concept to distinguish the architecture from the group handling with the traffic on the structure of network which is performed with the function of penetration and security. The security architecture could be different from the criterion of its realm and function, which requires the development and the application of security mechanism for every architecture. For the establishment of security architecture it is needed to show what criterion of net work should be set up. This study is based on analysis of diagnostic weakness structure in the network security architecture and research the criterion for topology factor, security architecture structure map selection, and blocking location and disinfection net. It is shown to increase the effective rate blocking the virus with the proposed method in this paper rather than the traditional network architecture.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3390-3398
• /
• 1999

To achieve high-speed communication and to improve QoS characteristics, ATM is now being used as underlying transfer mechanism of Internet protocols, or TCP/IP. When TCP uses the ABR service in ATM networks, the ABR service control is important to improve the performance of TCP/IP traffic as long as there is no interaction between ABR rate control and TCP flow control. In such environment, the interoperability of EFCI and ER switches becomes unavoidable in order to more effectively control ABR traffic in ATM network. In this paper, we use the model of mixed EFCI-ER environment and discuss the performance issues, e.g., the fairness of bandwidth allocation, drop rate, throughput by using various ER switch algorithms. Among various ERSwitch algorithms, we present one algorithm that have a less network topology and allocate the fair share of VC bandwidth by simulation results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.7
• /
• pp.2257-2285
• /
• 2022

Cyber-physical systems (CPS) have been growing exponentially due to improved cloud-datacenter infrastructure-as-a-service (CDIaaS). Incremental expandability (scalability), Quality of Service (QoS) performance, and reliability are currently the automation focus on healthy Tier 4 CDIaaS. However, stable QoS is yet to be fully addressed in Cyber-physical data centers (CP-DCS). Also, balanced agility and flexibility for the application workloads need urgent attention. There is a need for a resilient and fault-tolerance scheme in terms of CPS routing service including Pod cluster reliability analytics that meets QoS requirements. Motivated by these concerns, our contributions are fourfold. First, a Distributed Non-Recursive Cloud Model (DNRCM) is proposed to support cyber-physical workloads for remote lab activities. Second, an efficient QoS stability model with Routh-Hurwitz criteria is established. Third, an evaluation of the CDIaaS DCN topology is validated for handling large-scale, traffic workloads. Network Function Virtualization (NFV) with Floodlight SDN controllers was adopted for the implementation of DNRCM with embedded rule-base in Open vSwitch engines. Fourth, QoS evaluation is carried out experimentally. Considering the non-recursive queuing delays with SDN isolation (logical), a lower queuing delay (19.65%) is observed. Without logical isolation, the average queuing delay is 80.34%. Without logical resource isolation, the fault tolerance yields 33.55%, while with logical isolation, it yields 66.44%. In terms of throughput, DNRCM, recursive BCube, and DCell offered 38.30%, 36.37%, and 25.53% respectively. Similarly, the DNRCM had an improved incremental scalability profile of 40.00%, while BCube and Recursive DCell had 33.33%, and 26.67% respectively. In terms of service availability, the DNRCM offered 52.10% compared with recursive BCube and DCell which yielded 34.72% and 13.18% respectively. The average delays obtained for DNRCM, recursive BCube, and DCell are 32.81%, 33.44%, and 33.75% respectively. Finally, workload utilization for DNRCM, recursive BCube, and DCell yielded 50.28%, 27.93%, and 21.79% respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2030-2052
• /
• 2023

Analysis of a bipartite (two-mode) network is a significant research area to understand the formation of social communities, economic systems, drug side effect topology, etc. in complex information systems. Most of the previous works talk about a projection-based model or latent feature model, which predicts the link based on singular similarity. The projection-based models suffer from the loss of structural information in the projected network and the latent feature is hardly present. This work proposes a novel method for link prediction in the bipartite network based on an ensemble of composite similarities, overcoming the issues of model-based and latent feature models. The proposed method analyzes the structure, neighborhood nodes as well as latent attributes between the nodes to predict the link in the network. To illustrate the proposed method, experiments are performed with five real-world data sets and compared with various state-of-art link prediction methods and it is inferred that this method outperforms with ~3% to ~9% higher using area under the precision-recall curve (AUC-PR) measure. This work holds great significance in the study of biological networks, e-commerce networks, complex web-based systems, networks of drug binding, enzyme protein, and other related networks in understanding the formation of such complex networks. Further, this study helps in link prediction and its usability for different purposes ranging from building intelligent systems to providing services in big data and web-based systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1624-1647
• /
• 2020

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.4
• /
• pp.1337-1358
• /
• 2015

In this paper, we present an analytical and simulated study on the performance of adaptive vehicular ad hoc networks (VANET) priority based on Transmission Distance Reliability Range (TDRR) and data type. VANET topology changes rapidly due to its inherent nature of high mobility nodes and unpredictable environments. Therefore, nodes in VANET must be able to adapt to the ever changing environment and optimize parameters to enhance performance. However, there is a lack of adaptability in the current VANET scheme. Existing VANET IEEE802.11p's Enhanced Distributed Channel Access; EDCA assigns priority solely based on data type. In this paper, we propose a new priority scheme which utilizes Markov model to perform TDRR prediction and assign priorities based on the proposed Markov TDRR Prediction with Enhanced Priority VANET Scheme (MarPVS). Subsequently, we performed an analytical study on MarPVS performance modeling. In particular, considering five different priority levels defined in MarPVS, we derived the probability of successful transmission, the number of low priority messages in back off process and concurrent low priority transmission. Finally, the results are used to derive the average transmission delay for data types defined in MarPVS. Numerical results are provided along with simulation results which confirm the accuracy of the proposed analysis. Simulation results demonstrate that the proposed MarPVS results in lower transmission latency and higher packet success rate in comparison with the default IEEE802.11p scheme and greedy scheduler scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3465-3479
• /
• 2017

Information-Centric Vehicular Ad Hoc Network (IC-VANET) is a promising network architecture for the future intelligent transport system. Video streaming applications over IC-VANET not only enrich infotainment services, but also provide the drivers and pedestrians real-time visual information to make proper decisions. However, due to the characteristics of wireless link and frequent change of the network topology, the packet loss seriously affects the quality of video streaming applications. In this paper, we propose a REceiver-Driven loss reCOvery Mechanism (REDCOM) to enhance video dissemination over IC-VANET. A Markov chain based estimation model is introduced to capture the real-time network condition. Based on the estimation result, the proposed REDCOM recovers the lost packets by requesting additional forward error correction packets. The REDCOM follows the receiver-driven model of IC-VANET and does not require the infrastructure support to efficiently overcome packet losses. Experimental results demonstrate that the proposed REDCOM improves video quality under various network conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1260-1283
• /
• 2019

Low earth orbit (LEO) satellite broadband network is a crucial part of the space information network. LEO satellite constellation design is a top-level design, which plays a decisive role in the overall performance of the LEO satellite network. However, the existing works on constellation design mainly focus on the coverage criterion and rarely take network performance into the design process. In this article, we develop a unified framework for constellation optimization design in LEO satellite broadband networks. Several design criteria including network performance and coverage capability are combined into the design process. Firstly, the quality of service (QoS) metrics is presented to evaluate the performance of the LEO satellite broadband network. Also, we propose a network stability model for the rapid change of the satellite network topology. Besides, a mathematical model of constellation optimization design is formulated by considering the network cost-efficiency and stability. Then, an optimization algorithm based on non-dominated sorting genetic algorithm-II (NSGA-II) is provided for the problem of constellation design. Finally, the proposed method is further evaluated through numerical simulations. Simulation results validate the proposed method and show that it is an efficient and effective approach for solving the problem of constellation design in LEO satellite broadband networks.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.137-142
• /
• 2021

The Internet of Things (IoT) paradigm is at the forefront of present and future research activities. The huge amount of sensing data from IoT devices needing to be processed is increasing dramatically in volume, variety, and velocity. In response, cloud computing was involved in handling the challenges of collecting, storing, and processing jobs. The fog computing technology is a model that is used to support cloud computing by implementing pre-processing jobs close to the end-user for realizing low latency, less power consumption in the cloud side, and high scalability. However, it may be that some resources in fog computing networks are not suitable for some kind of jobs, or the number of requests increases outside capacity. So, it is more efficient to decrease sending jobs to the cloud. Hence some other fog resources are idle, and it is better to be federated rather than forwarding them to the cloud server. Obviously, this issue affects the performance of the fog environment when dealing with big data applications or applications that are sensitive to time processing. This research aims to build a fog topology job scheduling (FTJS) to schedule the incoming jobs which are generated from the IoT devices and discover all available fog nodes with their capabilities. Also, the fog topology job placement algorithm is introduced to deploy jobs into appropriate resources in the network effectively. Finally, by comparing our result with the state-of-art first come first serve (FCFS) scheduling technique, the overall execution time is reduced significantly by approximately 20%, the energy consumption in the cloud side is reduced by 18%.