• Title/Summary/Keyword: network policy

Search Result 2,567, Processing Time 0.054 seconds

Concept of the Cloud Type Virtual Policy Based Network Management Scheme for the Whole Internet

  • Kazuya, Odagiri;Shogo, Shimizu;Naohiro, Ishii
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.1
    • /
    • pp.71-77
    • /
    • 2023
  • In the current Internet system, there are many problems using anonymity of the network communication such as personal information leaks and crimes using the Internet system. This is why TCP/IP protocol used in Internet system does not have the user identification information on the communication data, and it is difficult to supervise the user performing the above acts immediately. As a study for solving the above problem, there is the study of Policy Based Network Management (PBNM). This is the scheme for managing a whole Local Area Network (LAN) through communication control for every user. In this PBNM, two types of schemes exist. As one scheme, we have studied theoretically about the Destination Addressing Control System (DACS) Scheme with affinity with existing internet. By applying this DACS Scheme to Internet system management, we will realize the policy-based Internet system management. In this paper, to realize it, concept of the Internet PBNM Scheme is proposed as the final step.

A Policy-based Network Control Methodology for Large-scale IP Network (대규모 IP 네트워크에서 정책기반의 네트워크 제어방법 연구)

  • Oh, Jun-Suk;Son, Choon-Ho;Kim, Ki-Eung;Lee, Jae-Jin
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.364-367
    • /
    • 2008
  • Many different types of network equipments are deployed in a large-scale IP network. In this operating environment, network service providers suffer from difficulty in controlling various equipments simultaneously in case network faults happen in their overall or regional network due to physical link failure or abnormal traffic. This paper presents a policy-based methodology to control many different types of network equipments at the same time in abnormal cases. The key idea is that NMS(Network Management System) keeps vendor-neutral control policies in normal times and that when an abnormal case occurs in network, NMS transforms the selected policy into vendor-specific control commands and enforces them to various equipments simultaneously.

  • PDF

Proposal of Network Security Management architecture using Programmable Network Technology (프로그래머블 네트워크 기술을 이용한 네트워크 보안 관리 구조 제안)

  • 김명은;오승희;김광식;남택용;손승원
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.10C
    • /
    • pp.1033-1044
    • /
    • 2003
  • In this paper, we propose security management architecture that manages efficiently security systems that are produced by different companies and programmable middleware that can reduce the load of management traffic. The proposed architecture applies programmable networks technology to policy based network management (PBNM). The proposed architecture manages and cooperates various security systems using security policy. Also, the programmable middleware provides convenience of management and reduces the overhead of a policy server by translating security policy into execution command. In addition, using programmable middleware, an administrator can manage various security systems that are produced by different companies. We showed that the programmable middleware could reduce the load of management traffic by comparing processing time for enforcing and transferring of policies/messages between the proposed architecture and PBNM architecture.

A LFU based on Real-time Producer Popularity in Concent Centric Networks (CCN에서 실시간 생성자 인기도 기반의 LFU 정책)

  • Choi, Jong-Hyun;Kwon, Tea-Wook
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.6
    • /
    • pp.1113-1120
    • /
    • 2021
  • Content Central Network (CCN) appeared to improve network efficiency by transforming IP-based network into content name-based network structures. Each router performs caching mechanism to improve network efficiency in the CCN. And the cache replacement policy applied to the CCN router is an important factor that determines the overall performance of the CCN. Therefore various studies has been done relating to cache replacement policy of the CCN. In this paper, we proposed a cache replacement policy that improves the limitations of the LFU policy. The proposal algorithm applies real-time producer popularity-based variables. And through experiments, we proved that the proposed policy shows a better cache hit ratio than existing policies.

Collaborative Research Network and Scientific Productivity: The Case of Korean Statisticians and Computer Scientists

  • Kwon, Ki-Seok;Kim, Jin-Guk
    • Asian Journal of Innovation and Policy
    • /
    • v.6 no.1
    • /
    • pp.85-93
    • /
    • 2017
  • This paper focuses on the relationship between the characteristics of network and the productivity of scientists, which is rarely examined in previous studies. Utilizing a unique dataset from the Korean Citation Index (KCI), we examine the overall characteristics of the research network (e.g. distribution of nodes, density and mean distance), and analyze whether the network centrality is related to the scientific productivity. According to the results, firstly we have found that the collaborative research network of the Korean academics in the field of statistics and computer science is a scale-free network. Secondly, these research networks show a disciplinary difference. The network of statisticians is denser than that of computer scientists. In addition, computer scientists are located in a fragmented network compared to statisticians. Thirdly, with regard to the relationship between the researchers' network position and scientific productivity, a significant relation and their disciplinary difference have been observed. In particular, the degree centrality is the strongest predictor for the scientists' productivity. Based on these findings, some policy implications are put forward.

A study on the middleware integrated home networking with policy-based network on the Internet. (인터넷 상의 Policy-based network와 홈 네트워크 통합을 위한 미들웨어에 관한 연구)

  • 홍성준;이용수
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.2
    • /
    • pp.97-100
    • /
    • 2001
  • Home network can be recently communicated with many various devices. but It has complications of the communication of devices. So the methods that can manage the devic integrate them are being developed in home networking And. there are lacks of the consid to provide users with QoS in home networking. Therefore, this paper describes the middlew can integrate home network with policy-based network for the purpose of supporting QoS.

A system dynamics study on the Trust and Cooperation in the Policy Implementation Network (정책집행 네트워크에서의 신뢰와 협력생성에 관한 시스템다이내믹스 연구)

  • 박성진;맹보학
    • Korean System Dynamics Review
    • /
    • v.1 no.2
    • /
    • pp.61-89
    • /
    • 2000
  • The purpose of this study is first, to find out what factors affect the cooperation and trust within the functions in the policy implementation network and in what mechanism these factors interact, second to investigate the whys to manage trust and cooperation successfully in the dynamic situation such as the network setting. For these purpose, this study reviews the concept and characteristics of policy implementation organizations, second, extracts the various factors affecting trust and cooperation in the network situation, third applies and analyzes the relationship among factors to system dynamics model based on the game theory. The results of this study could be summarized as follows: It was found that the utility change within the participants by persuasion & mutual understanding and change of rule would be leading to success in policy implementation network. Also bureaucratic management such as power enforcement does not have any good impact in the managing network. In this study, system simulation method tried to analyze the hypothesis. Quantitative and case analyses were not accompanied and analysis was limited to two-person game theory. So there is some doubt this results could be generalized to actual situation which is N-person game.

  • PDF

Interconnection Pricing for Mobile Internet Network (무선인터넷 망 접속료 산정 방안)

  • Kim Tae-Sung;Kim Min-Jeong;Byun Jae-Ho
    • Journal of Korea Technology Innovation Society
    • /
    • v.8 no.3
    • /
    • pp.1139-1156
    • /
    • 2005
  • The explosive growth in wireless networks and Internet services has created considerable demand for mobile Internet services based on the mobile phone. Mobile Internet has become the new business model in telecommunication market, therefore the open network policy for mobile Internet has been formulated and implemented by the government in Korea. In spite of the open network policy for mobile Internet, there has been no systematic analysis of the various interconnection issues, including pricing, in mobile Internet network. This paper aims to suggest the interconnection pricing methods for mobile Internet network by reviewing the current pricing models for various communications services, and adapting them to mobile Internet communications circumstances. Results of this paper can be used as a guideline for government policy directions and management decision making after the introduction of the open network policy for mobile Internet.

  • PDF

An ICN In-Network Caching Policy for Butterfly Network in DCN

  • Jeon, Hongseok;Lee, Byungjoon;Song, Hoyoung;Kang, Moonsoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.7
    • /
    • pp.1610-1623
    • /
    • 2013
  • In-network caching is a key component of information-centric networking (ICN) for reducing content download time, network traffic, and server workload. Data center network (DCN) is an ideal candidate for applying the ICN design principles. In this paper, we have evaluated the effectiveness of caching placement and replacement in DCN with butterfly-topology. We also suggest a new cache placement policy based on the number of routing nodes (i.e., hop counts) through which travels the content. With a probability inversely proportional to the hop counts, the caching placement policy makes each routing node to cache content chunks. Simulation results lead us to conclude (i) cache placement policy is more effective for cache performance than cache replacement, (ii) the suggested cache placement policy has better caching performance for butterfly-type DCNs than the traditional caching placement policies such as ALWASYS and FIX(P), and (iii) high cache hit ratio does not always imply low average hop counts.