• Title/Summary/Keyword: policy based networks

Search Result 453, Processing Time 0.025 seconds

Drop Policy Considering Performance of TCP in Optical Burst Switching Networks (Optical Burst Switching Network에서 TCP 성능을 고려한 Drop Policy)

  • 송주석;김래영;김현숙;김효진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.203-209
    • /
    • 2004
  • In OBS networks, the burst dropping due to contention significantly affects the performance of TCP, but existing drop policies have not considered this problem and researches related to TCP have been mainly studied on burst assembling. We propose the drop policy considering retransmission of TCP to improve the performance of TCP in OBS networks. The proposed drop policy is the Retransmission Count-based DP that regards retransmission count of bursts as priority when it selects dropping burst. This paper evaluates the performance of RC-based DP model and general DP model using ns-2. The metrics of performance evaluation are TCP throughput, maximum sequence number of received TCP packets and drop rate of packet as simulation time increases.

A Study on Application of Reinforcement Learning Algorithm Using Pixel Data (픽셀 데이터를 이용한 강화 학습 알고리즘 적용에 관한 연구)

  • Moon, Saemaro;Choi, Yonglak
    • Journal of Information Technology Services
    • /
    • v.15 no.4
    • /
    • pp.85-95
    • /
    • 2016
  • Recently, deep learning and machine learning have attracted considerable attention and many supporting frameworks appeared. In artificial intelligence field, a large body of research is underway to apply the relevant knowledge for complex problem-solving, necessitating the application of various learning algorithms and training methods to artificial intelligence systems. In addition, there is a dearth of performance evaluation of decision making agents. The decision making agent that can find optimal solutions by using reinforcement learning methods designed through this research can collect raw pixel data observed from dynamic environments and make decisions by itself based on the data. The decision making agent uses convolutional neural networks to classify situations it confronts, and the data observed from the environment undergoes preprocessing before being used. This research represents how the convolutional neural networks and the decision making agent are configured, analyzes learning performance through a value-based algorithm and a policy-based algorithm : a Deep Q-Networks and a Policy Gradient, sets forth their differences and demonstrates how the convolutional neural networks affect entire learning performance when using pixel data. This research is expected to contribute to the improvement of artificial intelligence systems which can efficiently find optimal solutions by using features extracted from raw pixel data.

IPSec based Network Design for the Mobile and Secure Military Communications (이동성과 보안성 만족 군용 통신을 위한 IPSec 기반 네트워크 설계)

  • Jung, Youn-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.9B
    • /
    • pp.1342-1349
    • /
    • 2010
  • Full-mesh IPSec tunnels, which constitute a black network, are required so that the dynamically changing PT (Plain Text) networks can be reachable across the black network in military environments. In the secure and mobile black networks, dynamically re-configuring IPSec tunnels and security policy database (SPD) is very difficult to manage. In this paper, for the purpose of solving mobility and security issues in military networks, we suggest the relating main technologies in association with DMIDP (Dynamic Multicast-based IPSec Discovery Protocol) based on existing IPSec ESP (Encapsulating Security Payload) tunnels and IPSec key managements. We investigate the main parameters of the proposed DMIDP techniques and their operational schemes which have effects on mobility and analyze operational effectivemess of the DMIDP with proposed parameters.

Application of Citation Analysis Results to National Scientific and Technical Information Policy: Based on a Case Study of Electrical and Electronics Engineering Field (국가 과학기술정보 정책에 대한 인용분석 연구결과의 적용 - 전기$\cdot$전자공학 분야의 연구를 바탕으로 -)

  • Rieh Hae-young
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.28
    • /
    • pp.109-133
    • /
    • 1995
  • This study assessed citation analysis results in light of their usefulness for national scientific and technical information (STI) policy formulation and review in Korea. using electrical and electronics engineering field as a case. After brief summary of citation analysis results was presented. current Korean STI policy was reviewed. which aims at establishing national STI sharing system by constructing many STI databases and information networks. Citation analysis results were discussed in light of their significance for Korean databases and information network construction and for use of informal networks such as E-Mail and invisible colleges. The problem of access to current information was also reviewed. Some recommendations were made to policy makers. which include creation of a centralized national STI center: development of guidelines for effective utilization of STI networks and STI; and. standardization of information processing technology and support for the automation of information centers and libraries. Based on the literature review. the best possible way of presenting recommendations to policy makers was examined. It was concluded that citation analysis could be a useful methodology for STI policy formulation and review when reliability and validity of the study is assured and the samples well represent the population of scientists and engineers. Finally recommendations for further research were offered.

  • PDF

A New Joint Packet Scheduling/Admission Control Framework for Multi-Service Wireless Networks

  • Long Fei;Feng Gang;Tang Junhua
    • Journal of Communications and Networks
    • /
    • v.7 no.4
    • /
    • pp.408-416
    • /
    • 2005
  • Quality of service (QoS) provision is an important and indispensable function for multi-service wireless networks. In this paper, we present a new scheduling/admission control frame­work, including an efficient rate-guaranteed opportunistic scheduling (ROS) scheme and a coordinated admission control (ROS­CAC) policy to support statistic QoS guarantee in multi-service wireless networks. Based on our proposed mathematical model, we derive the probability distribution function (PDF) of queue length under ROS and deduce the packet loss rate (PLR) for individual flows. The new admission control policy makes admission decision for a new incoming flow to ensure that the PLR requirements of all flows (including the new flow) are satisfied. The numerical results based on ns-2 simulations demonstrate the effectiveness of the new joint packet scheduling/admission control framework.

A Novel Spectrum Access Strategy with ${\alpha}$-Retry Policy in Cognitive Radio Networks: A Queueing-Based Analysis

  • Zhao, Yuan;Jin, Shunfu;Yue, Wuyi
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.193-201
    • /
    • 2014
  • In cognitive radio networks, the packet transmissions of the secondary users (SUs) can be interrupted randomly by the primary users (PUs). That is to say, the PU packets have preemptive priority over the SU packets. In order to enhance the quality of service (QoS) for the SUs, we propose a spectrum access strategy with an ${\alpha}$-Retry policy. A buffer is deployed for the SU packets. An interrupted SU packet will return to the buffer with probability ${\alpha}$ for later retrial, or leave the system with probability (1-${\alpha}$). For mathematical analysis, we build a preemptive priority queue and model the spectrum access strategy with an ${\alpha}$-Retry policy as a two-dimensional discrete-time Markov chain (DTMC).We give the transition probability matrix of the Markov chain and obtain the steady-state distribution. Accordingly, we derive the formulas for the blocked rate, the forced dropping rate, the throughput and the average delay of the SU packets. With numerical results, we show the influence of the retrial probability for the strategy proposed in this paper on different performance measures. Finally, based on the trade-off between different performance measures, we construct a cost function and optimize the retrial probabilities with respect to different system parameters by employing an iterative algorithm.

ADesign and Implementation of Policy-based Network Management System for Internet QoS Support Mobile IP Networks (인터넷 QoS 지원 이동 IP 망에서의 정책기반 망 관리 시스템 설계 및 구현)

  • 김태경;강승완;유상조
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.192-202
    • /
    • 2004
  • In this paper we have proposed policy-based network management system architecture for Internet QoS support Mobile IP networks that is divided into four layers(application layer, information management layer, policy control layer, device layer), then we propose an implementation strategy of policy-based network management system to enforce various control and network management operations and a model of policy server using SCOPS(Simple Common Open Policy Service) protocol that is developed in this research. For policy-based mobile IP network management system implementation, we have derived four policy classes(access control, mobile IP operation, QoS control, and network monitoring) and we showed operation procedures for each policy scenarios. Finally we have implemented Internet QoS support policy-based mobile IP network testbed and management system and verified out DiffServ policy enforcement behaviors for a target class service that is arranged a specific bandwidth on network congestion conditions.

TF-CPABE: An efficient and secure data communication with policy updating in wireless body area networks

  • Chandrasekaran, Balaji;Balakrishnan, Ramadoss;Nogami, Yasuyuki
    • ETRI Journal
    • /
    • v.41 no.4
    • /
    • pp.465-472
    • /
    • 2019
  • The major challenge in wireless body area networks (WBAN) is setting up a protected communication between data consumers and a body area network controller while meeting the security and privacy requirements. This paper proposes efficient and secure data communication in WBANs using a Twofish symmetric algorithm and ciphertext-policy attribute-based encryption with constant size ciphertext; in addition, the proposed scheme incorporates policy updating to update access policies. To the best of the author's knowledge, policy updating in WBAN has not been studied in earlier works. The proposed scheme is evaluated in terms of message size, energy consumption, and computation cost, and the results are compared with those of existing schemes. The result shows that the proposed method can achieve higher efficiency than conventional methods.

Policy-based Resource Management for QoS Support in Cellular Networks (셀룰라 시스템에서 서비스품질(QoS)을 보장하기 위한 정책기반 자원관리 기법 연구)

  • Choi Sung-Gu;Jun Kyung-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4B
    • /
    • pp.344-348
    • /
    • 2006
  • This paper proposes a QoS policy for cellular networks which support the policy based network management scheme. The policy exploits the existing underlying DiffServ mechanism and the priority-based packet scheduler in order to provide the packets with different handling priority depending on their belonging traffic classes. The simulation results reveals the effectiveness of the proposed policy under the network congestion; it shows that the goodput of the real-time traffic is not affected at all in spite of the surge of the non real-time traffic.

Optimal Resource Planning with Interference Coordination for Relay-Based Cellular Networks

  • Kim, Taejoon;An, Kwanghoon;Yu, Heejung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5264-5281
    • /
    • 2017
  • Multihop relay-based cellular networks are attracting much interest because of their throughput enhancement, coverage extension, and low infrastructure cost. In these networks, relay stations (RSs) between a base station (BS) and mobile stations (MSs) drastically increase the overall spectral efficiency, with improved channel quality for MSs located at the cell edge or in shadow areas, and enhanced throughput of MSs in hot spots. These relay-based networks require an advanced radio resource management scheme because the optimal amount of radio resource for a BS-to-RS link should be allocated according to the MS channel quality and distribution, considering the interference among RSs and neighbor BSs. In this paper, we propose optimal resource planning algorithms that maximize the overall utility of relay-based networks under a proportional fair scheduling policy. In the first phase, we determine an optimal scheduling policy for distributing BS-to-RS link resources to RSs. In the second phase, we determine the optimal amount of the BS-to-RS link resources using the results of the first phase. The proposed algorithms efficiently calculate the optimal amount of resource without exhaustive searches, and their accuracy is verified by comparison with simulation results, in which the algorithms show a perfect match with simulations.