• Title/Summary/Keyword: 승인제어

Search Result 80, Processing Time 0.028 seconds

Congestion Control Algorithms Evaluation of TCP Linux Variants in Dumbbell (덤벨 네트워크에서 TCP 리눅스 변종의 혼잡 제어 알고리즘 평가)

  • Mateen, Ahamed;Zaman, Muhanmmad
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.139-145
    • /
    • 2016
  • Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).

The Modified Aviation TDMA Protocol for an Improvement in Aeronautical RF Spectrum Utilization (항공통신에서 효율적인 RF 주파수 활용을 위한 항공용 TDMA 변형 프로토콜)

  • Park, Hyo Dal
    • Journal of Advanced Navigation Technology
    • /
    • v.1 no.1
    • /
    • pp.47-58
    • /
    • 1997
  • In this paper, the modified aviation TDMA protocol that can improve the aeronautical communication spectrum utilization is studied to satisfy the increasing air traffic demands. Currently European states proposed the scheme reducing the channel spacing from current 25 kHz to 8.33 kHz and U. S. FAA proposed the system using TDMA technique that divides access into four parallel circuits. The modified aviation TDMA protocol can complement the defects of these current systems. In modified aviation TDMA protocol, message channel that is used between aircraft and ground station is divided into uplink channel and downlink channel. After receiving the acknowledgement of the reservation request, aircraft sends messages at the allocated slots. Numerical analysis and simulation results show that the modified aviation TDMA scheme has high channel efficiency in the aviation environment.

  • PDF

Implementation of TCP Retransmitted Packet Loss Recovery using ns-2 Simulator (ns-2 시뮬레이터를 이용한 TCP 재전송 손실 복구 알고리듬의 구현)

  • Kim, Beom-Joon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.4
    • /
    • pp.741-746
    • /
    • 2012
  • Transmission control protocol(TCP) widely used as a transport protocol in the Internet includes a loss recovery function that detects and recovers packet losses by retransmissions. The loss recovery function consists of the two algorithms; fast retransmit and fast recovery. There have been researches to avoid nonnecessary retransmission timeouts (RTOs), which leads to selective acknowledgement (SACK) option and limited transmit scheme that are standardized by IETF (Internet Engineering Task Force). Recently, a method that covers the case in which a retransmitted packet is lost again has been propsed. The method, however, is not proved in terms of the additive increase multiplicative decrease (AIMD) principle of TCP congestion control. In this paper, therefore, we analyzed the method in terms of the principle by ns-simulations.

A Buffer Management Scheme to Maximize the Utilization of System Resources for Variable Bit Rate Video-On-Demand Servers (가변 비트율 주문형 비디오 서버에서 자원 활용률을 높이기 위한 버퍼 관리 기법)

  • Kim Soon-Cheol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.9 no.3
    • /
    • pp.1-10
    • /
    • 2004
  • Video-On-Demand servers use compression techniques to reduce the storage and bandwidth requirements. The compression techniques make the bit rates of compressed video data significantly variable from frame to frame. Consequently, Video-On-Demand servers with a constant bit rate retrieval can not maximize the utilization of resources. It is possible that when variable bit rate video data is stored, accurate description of the bit rate changes could be computed a priori. In this paper, I propose a buffer management scheme called MAX for Video-On-Demand server using variable bit rate continuous media. By caching and prefetching the data, MAX buffer management scheme reduces the variation of the compressed data and increases the number of clients simultaneously served and maximizes the utilization of system resources. Results of trace-driven simulations show the effectiveness of the scheme.

  • PDF

Block Ack-based Dynamic A-MPDU Aggregation Scheme in IEEE 802.11n WLAN (IEEE 802.11n WLAN에서 블록 승인 기반의 동적 A-MPDU 집적 방법)

  • Shin, In Cheol;Kim, Dong-Hoi
    • Journal of Broadcast Engineering
    • /
    • v.19 no.4
    • /
    • pp.510-520
    • /
    • 2014
  • By adopting the MAC(Media Access Control) protocol which enables to pack multiple MPDUs(MAC-level Protocol Data Units) into a single PPDU(Physical Layer Protocol Data Unit), IEEE 802.11n WLAN supports high throughput. Up to now, there have been a lot of existing channel information-based A-MPDU schemes dynamically determining the number of MSDUs according to the wireless channel condition information which is sent from the receiver to sender. However, the channel information-based scheme has a serious drawback having a high system overhead due to the frequent channel feedback information. To reduce the system overhead, the proposed BA-base dynamic A-MPDU scheme simply chooses the number of MSDUs to be retransmitted by not the frequent channel feedback information but the BA signal representing whether MPSUs belonging to the A-MPDU are received or not. Through NS-2(Network Simulator-2), we found that the proposed scheme had higher throughput and lower packet error rate than the existing fixed A-MPDU scheme.

RBAC for multi-organizational Business Process Management (기업간 비즈니스 프로세스 관리에서의 접근 권한 통제)

  • Bae, Hye-Rim;Hur, Won-Chang
    • The Journal of Society for e-Business Studies
    • /
    • v.12 no.1
    • /
    • pp.151-166
    • /
    • 2007
  • As the number of users who are involved in a business process increases, it becomes imperative to effectively control their privileges of accessing sensitive data and information which are usually easily obtained by BPM system. Traditional RBAC (Role-based Access Control) model was first introduced to provide a logical framework to prevent unauthorized users from obtaining confidential, but in more dynamic environment such as B2B and SCM process, it usually lacks in capability of addressing such issues as configurability, customizability, or scalability of user privileges. In this study, we have proposed a privilege-template based RBAC model that can address such issues effectively. We also provided a design of the RBAC model along with illustrative examples and pseudo codes that can be used for implementing a prototype system.

  • PDF

Modeling TCP Loss Recovery for Random Packet Losses (임의 패킷 손실에 대한 TCP의 손실 복구 과정 모델링 및 분석)

  • Kim, Beom-Joon;Kim, Dong-Yeon;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4B
    • /
    • pp.288-297
    • /
    • 2003
  • The fast retransmit and fast recovery algorithm of TCP Reno, when multiple packets in the same window are lost, cannot recover them without RTO (Retransmission Timeout). TCP New-Reno can recover multiple lost packets by extending fast recovery using partial acknowledgement. If the retransmitted packet is lost again during fast recovery, however, RTO cannot be avoided. In this paper, we propose an algorithm called "Duplicate Acknowledgement Counting(DAC)" to alleviate this problem. DAC can detect the retransmitted packet loss by counting duplicate ACKs. Conditions that a lost packet can be recovered by loss recovery of TCP Reno, TCP New-Reno and TCP New-Reno using DAC are derived by modeling loss recovery behavior of each TCP. We calculate the loss recovery probability for random packet loss probability numerically, and show that DAC can improve loss recovery behavior of TCP New-Reno.

An Efficient RDF Query Validation for Access Authorization in Subsumption Inference (포함관계 추론에서 접근 권한에 대한 효율적 RDF 질의 유효성 검증)

  • Kim, Jae-Hoon;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.36 no.6
    • /
    • pp.422-433
    • /
    • 2009
  • As an effort to secure Semantic Web, in this paper, we introduce an RDF access authorization model based on an ontology hierarchy and an RDF triple pattern. In addition, we apply the authorization model to RDF query validation for approved access authorizations. A subscribed SPARQL or RQL query, which has RDF triple patterns, can be denied or granted according to the corresponding access authorizations which have an RDF triple pattern. In order to efficiently perform the query validation process, we first analyze some primary authorization conflict conditions under RDF subsumption inference, and then we introduce an efficient query validation algorithm using the conflict conditions and Dewey graph labeling technique. Through experiments, we also show that the proposed validation algorithm provides a reasonable validation time and when data and authorizations increase it has scalability.

A study on application plan of access control requirements in ERMS Standard (ERMS 표준에 나타난 접근통제 요건의 적용방안에 관한 연구)

  • Cheon, Kwon-Ju
    • The Korean Journal of Archival Studies
    • /
    • no.18
    • /
    • pp.179-220
    • /
    • 2008
  • Under the physical records management system, both the records and users could be controlled and secured by closing the door of Archives or using permitted records which is used only approved users. According to the electronic records management system and the concept of service on the basis of users, we have to give up the classical manner. As an alternative, we have to consider the electronic access control system. To accomplish this purpose, functional requirements of ERMS that is issued by UK, EU, U.S and Australia must be compared and analyzed. On the basis of U.K ERMS which is more detailed, 'common access control functional requirements' are arranged. As the access control functional requirements is applied in the records classification scheme, we could find out how the access control is executed in ERMS.

Safety Evaluation on Real Time Operating Systems for Safety-Critical Systems (안전필수(Safety-Critical) 시스템의 실시간 운영체제에 대한 안전성 평가)

  • Kang, Young-Doo;Chong, Kil-To
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.10
    • /
    • pp.3885-3892
    • /
    • 2010
  • Safety-Critical systems, such as Plant Protection Systems in nuclear power plant, plays a key role that the facilities can be operated without undue risk to the health and safety of public and environment, and those systems shall be designed, fabricated, installed, and tested to quality standards commensurate with the importance of the functions to be performed. Computer-based Instrumentation and Control Systems to perform the safety-critical function have Real Time Operating Systems to control and monitoring the sub-system and executing the application software. The safety-critical Real Time Operating Systems shall be designed, analyzed, tested and evaluated to have capability to maintain a high integrity and quality. However, local nuclear power plants have applied the real time operating systems on safety critical systems through Commercial Grade Item Dedication method, and this is the reason of lack of detailed methodology on assessing the safety of real time operating systems, expecially to the new developed one. This paper presents the methodology and experiences of safety evaluation on safety-critical Real Time Operating Systems based upon design requirements. This paper may useful to develop and evaluate the safety-critical Real Time Operating Systems in other industry to ensure the safety of public and environment.