• Title/Summary/Keyword: AF 서비스

Search Result 41, Processing Time 0.021 seconds

A Study of Two Rate Three Color Maker for Differentiated Service Network (차별화된 서비스 네트워크를 위한 two rate Three Color Maker에 관한 연구)

  • Nyamdagva, Nyamdagva;Ho, Kwang-Chun;Park, Chun-Kwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.5
    • /
    • pp.23-30
    • /
    • 2009
  • This paper addresses the design of trTCM (Two Rate Three Color Marker) described in RFC2698. It has proposed for trTCM to be used in Differentiated Service network that provides AF PHB (Assured Forwarding Per Hop Behavior). trTCM is the marker with the metering function, and consists of the token updating function and the marking function. The token updating function uses the dual token bucket. The marking function compares the token values with the length of input packet and then marks the result into IP QoS field (ToS field). In this paper, we design trTCM function and then addresses the scheme to implement it using FPGA technology.

  • PDF

The Development of New dynamic WRR Algorithm for Wireless Sensor Networks (무선 센서망을 위한 새로운 동적 가중치 할당 알고리즘 개발)

  • Cho, Hae-Seong;Cho, Ju-Phil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.5
    • /
    • pp.293-298
    • /
    • 2010
  • The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

Cycling Packet Dropping Mechanism for Assured Forwarding Packets in Internet (인터넷에서 Assured Forwarding 패킷을 위한 사이클링 패킷 폐기 메커니즘)

  • Kim, Su-Yeon;Gang, Hyeon-Guk
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.221-226
    • /
    • 2002
  • Cycling Packet Dropping mechanism we proposed in this paper adaptively drops packets, as predicting traffic pattern between each cycle. Therfore the proposed mechanism makes up for the drawback of RIO mechanism and minimizes errors being capable of predicting in Dynamic and Strict Packet Dropping mechanism. And we executed a simulation and analyzed the throughput and packet drop rate based on the Sending Drop Precedence changing dynamically depending on the network traffic. The results show that the proposed mechanism provides better performance on drop precedence levels and stricter drop precedence policy for AF class.

Update Method based on Dynamic Access-Frequency Tree in Grid Database System (그리드 데이터베이스 환경에서 동적 접근 빈도를 이용한 갱신 기법)

  • Shin, Soong-Sun;Back, Sung-Ha;Lee, Yeon;Lee, Dong-Wook;Kim, Gyoung-Bae;Chung, Worn-Il;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.9
    • /
    • pp.1191-1200
    • /
    • 2009
  • The replicas in the Grid database is utilized for a lot of application services. And for deferent services or for deferent information depends on location, the access frequency of each replica is dissimilar. When one replica is stored in many nodes, each replicas applies the week-consistency in the grid computing environment. Especially, when a node work load or operation capacity is varied from others, the replica management would cost expansive. Therefore, this paper proposed the Update Method based on Dynamic Access-Frequency Tree. The dynamic access-frequency tree is pre-constructed by grouping nodes based on each nodes access frequency to manage the replica efficiently and avoid unbalance replica tree. The performance evaluation shows the proposed methods support more quick update than current methods.

  • PDF

Actual Feeling Service Model for Video-Media Contents (영상미디어콘텐츠에 대한 실감 서비스 모델)

  • Lee, Ji-Hye;Yoon, Yong-Ik
    • Journal of Digital Contents Society
    • /
    • v.10 no.3
    • /
    • pp.453-459
    • /
    • 2009
  • In recently, as the interest of media contents increase among internet users, a variety of media contents are circulated in the web. Especially, video-media content in media contents attracts internet user's interest. In conjunction with web 2.0, internet users open and share their making contents by themselves. Their attitude about accepting media contents is not passive but aggressive. Additionally, they create new form of distribution of the flow. Video media content for distribution on the Web is created by experts to a professional content, but Web 2.0 era, the UCC (User Create Contents) in the form of self-produced content is the most. The generated media by the general internet users, but self-produced content, provides video information only and has limitations. To satisfy internet users as consumers in the web 2.0 eras, it has needed to provide actual feeling contents that add various effects not just simple media. Therefore, this paper represents the existing media content with simple information based on the concept of ontology and the meaning to the subject for the media content. We will provide an actual feeling how to offer the configuration of a service model (AF-VS : Actual Feeling Video Service).

  • PDF

5세대 무선 LAN 기술 연구

  • Kwon, Oh-Hun;Kim, Yeo-Gyeom;Lee, Myoung-Hun;Kim, Hak-Beom
    • Review of KIISC
    • /
    • v.22 no.5
    • /
    • pp.79-89
    • /
    • 2012
  • 최근 스마트폰 2000만 시대가 열리면서 무선 데이터 트래픽이 폭증하고 있다. 이동통신사들은 LTE 구축과 함께 네트워크 가상화 기술도입에 나섰고 기업들 역시 한 단계 진화된 무선 LAN 도입을 서두르고 있다. 이러한 무선 LAN을 이용한 스마트폰 수요 및 태블릿 PC 가 폭발적으로 증가함에 따라 무선 LAN에 기반한 새로운 기술들이 활발히 논의되고 있다. 현재 사용자들이 가장 많이 사용하고 있는 802.11n의 후속으로, 차세대 스마트폰을 위한 핵심 기술로서 고용량 데이터 및 동영상을 보낼 수 있는 Gbps급 전송을 지원하는 IEEE 802.11 ac, IEEE 802.11 ad가 연구 중이다. 또한 광역 서비스를 지원하는 IEEE 802.11 af 및 IEEE 802.11 ah, 인증서비스를 간소화하여 초기링크 셋업시간을 감소시켜주는 IEEE 802.11 ai에 대해 본 논문에서는 무선 LAN 그룹의 연구와 분석에 대해 기술하고자 한다.

An Efficient Resource Allocation Algorithm for Ubiquitous Sensor Networks (유비쿼터스 센서 네트워크를 위한 효율적인 자원할당 알고리즘)

  • Hwang, Jeewon;Cho, Juphil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2769-2774
    • /
    • 2013
  • The key of USN(Ubiquitous Sensor Network) technology is low power wireless communication technology and proper resource allocation technology for efficient routing. The distinguished resource allocation method is needed for efficient routing in sensor network. To solve this problems, we propose an algorithm that can be adopted in USN with making up for weak points of PQ and WRR in this paper. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class in sensor network. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

An Effective Technique of QoS, Policy-based QoS Management Using DiffServ (DiffServ를 활용한 정책기반 QoS 관리에서의 효율적인 QoS 적용 기법)

  • Kim Tae-Wook;Sung Kyung-Sang;Oh Hae-Seok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1219-1222
    • /
    • 2006
  • 3GPP에서는 단대단 QoS 보장을 위해 정책 기반 망 관리(PBNM:Policy-based Network Management) 방식을 적용할 것을 권고하고 있다. 본 논문에서는 3GPP에서 제시하는 핵심망 구조에 정책 기반 망 관리 기법 중 DiffServ를 적용해서 현재 DSCP(Differentiated Service Code Point)는 8bit 구성되어 있으나 그 중 6bit만 사용되고 있고, 사용하지 않는 이 2bit를 사용하여 DF(Default Forwarding), EF(Expedited Forwarding), AF(Assured Forwarding)의 DSCP에 Service Class Code Point를 부여해서 DiffServ를 서비스하는 망에서 동일한 Diffserv 정책을 설정해서 효율적인 QoS 기법을 제안하고자 한다.

  • PDF

A Method for Efficient Dynamic Channel Assignment in Mobile Communication Systems based FDMA (FDMA기반 이동통신 시스템에서 효율적인 동적채널할당 방법)

  • Kang, Ki-Joung;Hong, Choong-Seon;Lee, Dae-Young
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.203-212
    • /
    • 2004
  • There is a rapidly growing demand for wireless telecommunication. The restricted number of channels is a significant bottleneck for the capacity of mobile communication systems. Consequently, when assigning the channels to the different base stations, it is desirable to reuse the same channel af much as possible. It is then important to avoid any possible interference between different mobile users, while satisfying the given demand. The objective of this thesis is to develop a hybrid heuristic algorithm to find the channel assignment method for allocating the channels in an efficient way, which does not violate the compatibility constraints. We also show several benchmarking channel assignment problems using proposed channel assignment method for validation in this thesis.

Modeling the Spread of Internet Worms on High-speed Networks (고성능 네트워크에서 인터넷 웜 확산 모델링)

  • Shin Weon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.839-846
    • /
    • 2005
  • Recently broadband convergence network technology is emerging as an integrated network of telecommunication, broadcasting and Internet. But there are various threats as side effects against the growth of information technology, and malicious codes such af Internet worms may bring about confusions to upset a national backbone network. In this paper, we survey the traditional spreading models and propose a new worm spreading model on Internet environment. We also analyze the spreading effects due to tile spread period and the response period of Internet worms. The proposed model leads to a better prediction of the scale and speed of worm spreading. It can be applied to high-speed network such as broadband convergence network.