• Title/Summary/Keyword: 주기적 트래픽

Search Result 166, Processing Time 0.025 seconds

Periodic and Pseudo-static Channel Time Allocation Scheme for IEEE 802.15.3 High-Rate Wireless PANs (IEEE 802.15.3 고속율 무선 팬을 위한 주기적인 유사 정적 채널 시간 할당 방법)

  • Kim, Sun-Myeong
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.4
    • /
    • pp.89-97
    • /
    • 2008
  • In wireless personal area networks (WPANs), the successful design of channel time allocation algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a channel time allocation algorithm for achieving a high quality transmission and high channel error tolerance of MPEG stream in the IEEE 802.15.3 high-rate wireless PANs. Our algorithm exploits the characteristics of MPEG stream. When a new MPEG stream arrives, a DEV models it by the traffic envelope and delivers the traffic envelope to the piconet coordinator (PNC) along with the channel time request. The PNC performs channel time allocation according to the envelope. Performance of the proposed scheme is investigated by simulation and analysis. Our results show that compared to conventional scheme, the proposed scheme is very effective and provides a good performance under typical channel error conditions.

  • PDF

Modification to Traffic Indication Method for IEEE 802.16 Sleep Mode Operation (IEEE 802.16 시스템의 슬립모드 동작을 위한 트래픽 인디케이션 방식의 개선)

  • Kim, Beom-Joon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.6
    • /
    • pp.823-829
    • /
    • 2013
  • IEEE 802.16 standard specifies the broadband wireless access (BWA) system including sleep mode to minimize the power consumption by a mobile station (MS). This paper outlines the overall operation of sleep mode and proposes a method to improve the power saving efficiency of the IEEE 802.16 sleep mode. The proposed method not only decreases the number of bytes that a MS in sleep mode needs to receive during listening interval but allows to indicate a control-specific operation such as periodic ranging.

A Study on Function Improvement of a Network Monitoring Protocol (네트워크 감시 프로토콜 기능 향상에 관한 연구)

  • Youn, Chun-Kyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1291-1294
    • /
    • 2004
  • 단순 네트워크 관리 프로토콜(SNMP)에서는 메니저가 송신한 polling 에 대해 에이전트가 이에 응답을 하는 방식으로 네트워크 관리 정보를 송수신하기 때문에 비교적 많은 네트워크 트래픽이 발생한다. 특히, 심화분석을 위해 특정 관리항목에 대하여 장시간 일정 주기로 반복적인 정보 수집이 요구되는 경향분석을 실시할 때 발생되는 관리용 트래픽은 네트워크 부하를 가중시킨다. 본 논문에서는 기존 SNMP의 정보 수집 및 통신 방식을 개선하여 경향분석 용 정보 수집 시 메니저와 에이전트간 불필요한 네트워크 관리용 트래픽 발생을 최소화할 수 있는 효율적인 방안을 제시하고 구현하였다. 시험 분석 결과 기존 방식과 호환성을 유지하면서 네트워크 관리용 트래픽이 크게 감소하였다.

  • PDF

Network Traffic Control for War-game Simulation in Distributed Computing Environment (분산 컴퓨팅 환경에서의 워게임 시뮬레이션을 위한 네트워크 트래픽 제어)

  • Jang, Sung-Ho;Kim, Tae-Young;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.1-8
    • /
    • 2009
  • The distributed war-game simulation system has been used to represent the virtual battlefield environment. In order to produce a simulation result, simulators connected from a network transfer messages with location information of simulated objects to a central simulation server. This network traffic is an immediate cause of system performance degradation. Therefore, the paper proposes a system to manage and control network traffic generated from distributed war-game simulation. The proposed system determines the moving distance of simulated objects and filters location messages by a distance threshold which is controlled according to system conditions like network traffic and location error. And, the system predicts the next location of simulated objects to minimize location error caused by message filtering. Experimental results demonstrate that the proposed system is effective to control the network traffic of distributed war-game simulation systems and reduce the location error of simulated objects.

Laxity Decomposition Method for Scheduling Real-time Periodic Messages (실시간 주기적 메세지 스케쥴링을 위한 여유시간 분할방법)

  • 유해영;심재홍;최경희;정기현;박승규;최덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10B
    • /
    • pp.1867-1875
    • /
    • 1999
  • This paper presents a very unique and analytic method for scheduling messages routed through a non-blocking switch. The laxities of schedulable messages are decomposed and the laxity table is rearranged so that the packets to be scheduled in the next time instance are placed in the diagonal of the traffic matrix. And the modified MLF-SDR algorithm is performed on the table. We present some examples and simulation results which show that the success rate is very high, even when the size of which is large.

  • PDF

A Study of ABR Traffic Control in ATM Networks by Integrating EFCI and ER Modes (ATM 네트워크상에서 EFCI와 ER을 결합한 ABR 트래픽 제어에 관한 연구)

  • 김종은;우현구;김봉기
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.2
    • /
    • pp.98-104
    • /
    • 2000
  • One of the main features of ABR service is the employment of a rate-based flow control mechanism, and congestion control plays an important role in the effective and stable operation of ATM networks Feedback from the network switches to the end system gives users the information necessary to adjust transmission rates appropriately according to the current networks load. Congestion controls by feedback mechanism are classified as EFCI and ER mode. We analyze the performance of EFCI and ER and propose a new ABR traffic control strategy by integrating EFCI and ER modes to improve the traditional traffic control. Through the distributed simulation. the performance improved by the proposed control strategy is analyzed.

  • PDF

A Simple CAC Scheme Based on Cell Loss Rate (셀 손실률을 고려한 호 설정 제어 알고리즘)

  • 박재현;조태경;최명렬;최병욱
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.120-122
    • /
    • 2000
  • 초고속 광대역 통신망에서는 ATM에 기초한 서비스를 주로 다루고 있다. 호 설정 제어는 기존의 연결에 새로운 연결의 요청되었을 때 사용자가 요구한 QoS (Quality-of-Service)를 보장하면서 새로운 연결을 받아들일지를 결정하는 것이다. 본 논문에서는 Elwalidetal에 의해서 제안된 통계적 호 설정 제어 알고리즘을 고려하였다. 트래픽 델은 주기적인 ON-OFF모델을 사용하였으며, 트래픽 변수로는 셀 손실률(CLR)을 사용하였다. 기존 연결과 새로운 연결의 셀 손실률의 합이 임계값 $\varepsilon$보다 작으면, 연결을 받아들이는 방법에 기초하였다. 기존 알고리즘에서는 고정적인 임계값 $\varepsilon$을 사용하였으나, 본 논문에서는 자원 이용률을 고려하여 임계값 $\varepsilon$을 동적으로 변화시켰다.

  • PDF

A Window-Based Permit Distribution Scheme to Support Multi-Class Traffic in ATM Passive Optical Networks (ATM 기반 광 가입자망에서 멀티클래스 트래픽의 효율적인 전송을 위한 윈도우 기반 허락 분배 기법)

  • Lee, Ho-Suk;Eun, Ji-Suk;No, Seon-Sik;Kim, Yeong-Cheon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.1
    • /
    • pp.12-22
    • /
    • 2000
  • This paper presents the window-based permit distribution scheme for efficient medium access control to support multiclass traffic in APON(ATM over passive optical network). The proposed MAC protocol considers the characteristics of QoS(Quality of Service) for various traffic classes. A periodic RAU(request access unit) in upstream direction, includes dedicative request fields for each traffic category within the request slot. The transmission of upstream cell is permitted by the proposed window-based spacing scheme which distributes the requested traffic into several segments in the unit of one spacing window. The delay sensitive traffic source such as CBR or VBR with the stringent requirements on CDV and delay, is allocated prior to any other class. In order to reduce the CDV, so that the permit arrival rate close to the cell arrival rate, Running-Window algorithm is applied to permit distribution processing for these classes. The ABR traffic, which has not-strict CDV or delay criteria, is allocated flexibly to the residual bandwidth in FIFO manner. UBR traffic is allocated with the lowest priority for the remaining capacity. The performance of proposed protocol is evaluated in terms of transfer delay and 1-point CDV according to various offered load. The simulation results show that our protocol has the prominent improvement on CDV and delay performance with compared to the previous protocol.

  • PDF

Traffic Adaptive Dynamic S-MAC Protocol in Sensor Networks (센서 네트워크에서 트래픽 적응형 동적 S-MAC 프로토콜)

  • Yu, Dae-Seok;Park, Su-Seong;Choe, Seung-Sik
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06d
    • /
    • pp.202-207
    • /
    • 2008
  • 무선 센서 네트워크에서는 기본적으로 교환이나 충전이 어려운 베터리로 동작하는 센서 노드들로 구성된다. 따라서 센서 노드들의 에너지 소모를 줄이는 것이 무선 센서 네트워크에서는 중요한 과제이다. 이러한 에너지 효율적인 MAC 프로토콜을 구현하기 위해 기존의 IEEE 802.11 Protocol을 기반으로 휴면 기간의 에너지를 효율적으로 관리하는 Sensor MAC(이하 S-MAC) Protocol이 제안되었다. 본 논문에서는 에너지 효율적 스케줄링 기반의 기존 S-MAC을 기반으로 네트워크 트래픽에 동적으로 동작하기 위한 동적 S-MAC을 제안하였다. 동적 S-MAC 프로토콜은 네트워크 트래픽 상황에 따라 프레임 주기를 변경함으로써 S-MAC의 에너지 효율을 개선하였다. NS2 시뮬레이션을 통해 동적 S-MAC과 기존 S-MAC의 성능을 평가하였다.

  • PDF

Performance Analysis of Multiplexed VBR MPEG Video Traffic With Arbitrary Starting Times in ATM Networks (ATM망에서의 임의의 시작 시간 배열을 갖는 다중화된 가변 비트율 MPEG 비디오 트래픽의 성능 해석)

  • 노병희;김재균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.6
    • /
    • pp.1514-1525
    • /
    • 1998
  • Two main characteristics of VBR MPEG video traffic are different statistics according to different picture types and the periodic traffic pattern due to GOP structure. Especially, the I-pictures at the beginning of each GOP generate $$\mu$h more traffic than other pictures. When several VBR Mpeg video sources are superposed, the I-picture starting times of these sources may significantly affect the cell loss characteristics of ATM $$\mu$tiplexers. In this paper, we propse a performance model for ATM $$\mu$tiplexers with VBR MPEG video sources whose starting times are arbitrary given. For analysis, both single and superposed source traffic are modeled as NDPPs (non-deterministic periodic processes), and the ATM $$\mu$tiplexer is modeled as a U-state NDPPD/D/1/B queueing system. It is hown that the numerical results are very close to the si$$\mu$ation results. From the relationships between the starting tiem distributions and the corresponding $$\mu$tiplexer performances, some considerations for designing a scheduling policy in order to obtain the maxi$$\mu$ $$\mu$tiplexing gain are presented.

  • PDF