• Title/Summary/Keyword: Dynamic access time

Search Result 282, Processing Time 0.023 seconds

A Channel Access Control algorithm and a Dynamic Slot Allocation algorithm for rt_VBR services and ABR services in Wireless ATM Networks (무선 ATM망에서 rt_VBR 및 ABR 서비스를 위한 채널 접속 제어 알고리즘과 동적 대역 할당 알고리즘)

  • Yang, Seong-Ryoung;Im, In-Taek;Heo, Jeong-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.191-199
    • /
    • 2003
  • In this paper, a channel access control algorithm and a dynamic slot allocation algorithm are proposed for rt_VBR services and ABR services in the wireless ATM networks. In the proposed algorithm, rt_VBR terminals that require real-time services transmit a reservation request packet by a RAS minislot. An rt_VBR terminal, which transmitted the reservation request packet, transmits the dynamic parameters by DPS minislot without contention. On the other hand, ABR terminals that have a non-real-time traffic burst transfer a reservation request packet with contention basis. Based on the received dynamic parameters, the base station scheduler allocates uplink data slots as well as DPS minislot into rt_VBR terminals.

Estimation of the OD Traffic Intensities in Dynamic Routing Network: Routing-Independent Tomography

  • Kim, Seung-Gu
    • Communications for Statistical Applications and Methods
    • /
    • v.10 no.3
    • /
    • pp.795-804
    • /
    • 2003
  • In this article, a tomography for the estimation of the origin-destination(OD) traffic intensities in dynamic routing network is considered. Vardi(1996)'s approach based on fixed route is not directly applicable to dynamic routing protocols, which arises from the fact that we cannot access the route at every observation time. While it uses link-wise traffics as the observations, the proposed method considers the triple of ingress/outgress/relayed traffics data at each node so that we can transform the problem into a routing-independent tomography. An EM algorithm for implementation and some simulated experiments are provided.

Study of Dynamic Polling in the IEEE 802.11 PCF

  • Kim, Che-Soong;Lyakhov, Andrey
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.34 no.2
    • /
    • pp.140-150
    • /
    • 2008
  • Point Coordination Function (PCF) of the IEEE 802.11 protocol providing a centrally-controlled polling-based multiple access to a wireless channel is very efficient in high load conditions. However, its performance degrades with increasing the number of terminals and decreasing the load, because of wastes related to unsuccessful polling attempts. To solve the problem, we propose and study analytically the generic dynamic polling policy using backoff concept. For this aim, we develop Markov models describing the network queues changes, what allows us to estimate such performance measures as the average MAC service time and the average MAC sojourn time, to show the dynamic polling efficiency and to tune optimally the backoff rule.

A cross-domain access control mechanism based on model migration and semantic reasoning

  • Ming Tan;Aodi Liu;Xiaohan Wang;Siyuan Shang;Na Wang;Xuehui Du
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.6
    • /
    • pp.1599-1618
    • /
    • 2024
  • Access control has always been one of the effective methods to protect data security. However, in new computing environments such as big data, data resources have the characteristics of distributed cross-domain sharing, massive and dynamic. Traditional access control mechanisms are difficult to meet the security needs. This paper proposes CACM-MMSR to solve distributed cross-domain access control problem for massive resources. The method uses blockchain and smart contracts as a link between different security domains. A permission decision model migration method based on access control logs is designed. It can realize the migration of historical policy to solve the problems of access control heterogeneity among different security domains and the updating of the old and new policies in the same security domain. Meanwhile, a semantic reasoning-based permission decision method for unstructured text data is designed. It can achieve a flexible permission decision by similarity thresholding. Experimental results show that the proposed method can reduce the decision time cost of distributed access control to less than 28.7% of a single node. The permission decision model migration method has a high decision accuracy of 97.4%. The semantic reasoning-based permission decision method is optimal to other reference methods in vectorization and index time cost.

Proxy based Access Privilige Management for Tracking of Moving Objects

  • Cha, Hyun-Jong;Yang, Ho-Kyung;Song, You-Jin
    • International Journal of Advanced Culture Technology
    • /
    • v.10 no.2
    • /
    • pp.225-232
    • /
    • 2022
  • When we drive a vehicle in an IoT environment, there is a problem in that information of car users is collected without permission. The security measures used in the existing wired network environment cannot solve the security problem of cars running in the Internet of Things environment. Information should only be shared with entities that have been given permission to use it. In this paper, we intend to propose a method to prevent the illegal use of vehicle information. The method we propose is to use attribute-based encryption and dynamic threshold encryption. Real-time processing technology and cooperative technology are required to implement our proposed method. That's why we use fog computing's proxy servers to build smart gateways in cars. Proxy servers can collect information in real time and then process large amounts of computation. The performance of our proposed algorithm and system was verified by simulating it using NS2.

A Study on Dynamic Role-based Service Allocation for Service Oriented Architecture System (서비스 지향 아키텍처 시스템을 위한 동적 역할 기반 서비스 할당에 관한 연구)

  • Park, Yong B.;Kwon, Ye Jin
    • Journal of the Semiconductor & Display Technology
    • /
    • v.17 no.1
    • /
    • pp.12-20
    • /
    • 2018
  • Recently, web-based service software has been used as to combine various information or to share information according to the needs of users and the convergence of specialized fields and individual dependent systems. According to the necessity of the user, the proper service environment and the selective service environment according to the purpose and the needs of the user have been studied in a variety of specialized and combined professional research fields and industries. Software based on cloud systems and web services is being used as a tool for appropriate group and user groups and roles. A service system combined dynamically needs a module to manage a user through internal logic and grant a service access authentication. Therefore, it has been considered various approaches that a user who accesses the system is given a service access authority for a certain period of time. Also, when the deadline is over, the authority that you are given to access system will go through the process of expire the right. In this paper, we define the roles of users who access web services, manage user rights according to each role, and provide appropriate service resources to users according to their rights and session information. We analyzed the procedure of constructing the algorithm for the service according to the procedure of each user accessing the web service, granting the service resource and constructing a new role.

Effective Algorithm for the Low-Power Set-Associative Cache Memory (저전력 집합연관 캐시를 위한 효과적인 알고리즘)

  • Jung, Bo-Sung;Lee, Jung-Hoon
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.1
    • /
    • pp.25-32
    • /
    • 2014
  • In this paper, we proposed a partial-way set associative cache memory with an effective memory access time and low energy consumption. In the proposed set-associative cache memory, it is allowed to access only a 2-ways among 4-way at a time. Choosing ways to be accessed is made dynamically via the least significant two bits of the tag. The chosen 2 ways are sequentially accessed by the way selection bits that indicate the most recently referred way. Therefore, each entry in the way has an additional bit, that is, the way selection bit. In addition, instead of the 4-way LRU or FIFO algorithm, we can utilize a simple 2-way replacement policy. Simulation results show that the energy*delay product can be reduced by about 78%, 14%, 39%, and 15% compared with a 4-way set associative cache, a sequential-way cache, a way-tracking cache, and a way cache respectively.

Dynamic Sub-carrier Multiplexed channel allocation and efficient frame distribution scheme in optical access networks (광가입자망 SCM 채널 동적할당 및 효율적 프레임 분배 방안)

  • 김남욱;윤현호;김태연;유정주;김병휘;강민호
    • Proceedings of the IEEK Conference
    • /
    • 2003.11c
    • /
    • pp.113-116
    • /
    • 2003
  • In this paper, we propose a dynamic parallel channel allocation mechanism that dynamically controls total number of allocation channels of each subscriber to effectively service user bandwidth demands while high utilization and fairness are guaranteed in WDM based optical access networks. The logical performance gain of statistical multiplexing by dynamic channel allocation is validated with analytic method as well as simulations. We also introduce the adaptive padding scheme in order to efficiently distribute forwarded frames to aggregated multi-link channels which are formed by parallel channel allocation mechanism. The proposed scheme shows the performance enhancement by minimizing unnecessary padding size and the processing time.

  • PDF

Media Access Control Protocol based on Dynamic Time Slot Assignment in Underwater Mobile Ad-hoc Network (동적 타임 슬롯 할당에 기반한 수중 모바일 Ad-hoc 네트워크에서의 매체접근제어 프로토콜)

  • Shin, Seung-Won;Kim, Yung-Pyo;Yun, Nam-Yeol;Park, Soo-Hyun
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.81-89
    • /
    • 2011
  • Underwater wireless network can be useful in various fields such as underwater environment observation, catastrophe prevention, ocean resources exploration, ocean organism research, and vessel sinking exploration. We need to develop an efficient design for Medium Access Control (MAC) protocol to improve multiple data communication in underwater environment. Aloha protocol is one of the basic and simple protocols, but it has disadvantage such as collision occurs oftenly in communication. If there is collision occured in RF communication, problem can be solved by re-sending the data, but using low frequency in underwater, the re-transmission has difficulties due to slow bit-rate. So, Time Division Multiple Access (TDMA) based MAC protocol is going to be used to avoid collisions, but if there is no data to send in existing TDMA, time slot should not be used. Therefore, this paper proposes dynamic TDMA protocol mechanism with reducing the time slots by sending short "I Have No Data" (IHND) message, if there is no data to transmit. Also, this paper presents mathematic analysis model in relation to data throughput, channel efficiency and verifies performance superiority by comparing the existing TDMA protocols.

Pricing Strategy for Access Charge of IPTV Network : A Dynamic Analysis (IPTV 망 임대의 가격책정 전략 : 동태적 분석)

  • Kim, Dong-Hee;Cha, Jeong-Hyun;Oh, Jung-Suk;Kim, Soo-Wook
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.35 no.3
    • /
    • pp.45-58
    • /
    • 2010
  • Due to rapid developments of IT technologies, convergence services like IPTV (Internet protocol television) are shown up. Even though expert and customer had great expectations for this innovative service, commercialization was delayed for years by the legal dispute between industry players. One of the biggest problems was that whether internet backbone providers have to share their internet network backbone with IPTV service providers (which don't have network backbone) or not. As other countries, Korean government set the rules that ISP have to offer indiscriminate access to other IPTV service provider. At the same time, internet backbone providers can charge access charge based on cost by way of compensation. Thus access charge is very critical to the IPTV industry players. The objective of this paper is to provide model that can calculate the reasonable access charge by system dynamics, based upon real data in Korean telecommunication industry.