• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1073-1076
• /
• 2003

인터넷 트래픽은 폭발적으로 증가하고 있으며, 이에 따라 QoS를 보장하기 위한 여러 연구들이 진행되고 있다. 인터넷 트래픽에 대한 연구가 진행됨에 따라 자기 유사성을 가지며, 기존의 poisson을 이용한 모델링은 실제 트래픽과 차이가 있음이 밝혀졌다. 또한, 인터넷 트래픽은 burstiness 성질을 상당히 가지고 있으며, 이는 관측 시간간격에 크게 영향을 받지 않는 것으로 나타난다. 본 논문에서는 이러한 트래픽의 burstiness 성질을 이용한 트래픽 측정 방법을 제시하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.205-223
• /
• 2010

In this paper, we analyze the impact of different frame types on self-similarity and burstiness characteristics of the aggregated frame traffic from a real 802.11 wireless local area network. We find that characteristics of aggregated frame traffic are affected by both mean frame size and the proportion of specified frame types. Based on this new knowledge, an adaptative frame size optimization (AFSO) mechanism is proposed to improve the transmission efficiency by adaptively adjusting data frame size according to the proportions of different frame types. Simulation results show that our proposed mechanism can effectively regulate the burstiness of aggregated frame traffic and improve the successful delivery rate of data frames when a fixed throughput target is set for 802.11 wireless networks.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.69-79
• /
• 2014

The scheduling scheme in packet switching networks is one of the most critical features that can affect the performance of the network. Hence, many scheduling algorithms have been suggested and some indices, such as fairness and latency, have been proposed for the comparison of their performances. While the nature of Internet traffic is bursty, traditional scheduling algorithms try to smooth the traffic and serve the users based on this smoothed traffic. As a result, the fairness index mainly considers this smoothed traffic and the service rate as the main parameter to differentiate among different sessions or flows. This work uses burstiness as a differentiating factor to evaluate scheduling algorithms proposed in the literature. To achieve this goal, a new index that evaluates the performance of a scheduler with bursty traffic is introduced. Additionally, this paper introduces a new scheduler that not only uses arrival rates but also considers burstiness parameters in its scheduling algorithms.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.147-162
• /
• 2002

Multi-processor system with fast I/O devices improves processing performance and reduces the bottleneck by I/O concentration. In the system, the Performance influenced by shared memory used for exchanging data between processors varies with configuration and utilization. This paper suggests a prediction model for buffer and shared memory optimization under interrupt recognition method using mailbox. Ethernet (IEEE 802.3) packets are used as the input of system and the amount of utilized memory is measured for different network bandwidth and burstiness. Some empirical studies show that the amount of buffer and shared memory varies with packet concentration rate as well as I/O bandwidth. And the studies also show the correlation between two memories.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1296-1304
• /
• 1999

In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. For the performance evaluation, we simulate the proposed algorithm with discrete time input traffic model, the results show that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.

• Journal of Digital Contents Society
• /
• v.5 no.1
• /
• pp.7-11
• /
• 2004

There are many problems that must solve to construct next generation high-speed communication network. Among these, item that must consider basically is characteristics analysis of traffic that nows to network Traffic characteristics of many Internet services that is offered present have shown that network traffic exhibits at a wide range of scals-self-similarity. Self-similarity is expressed by long term dependency, this is contradictory concept with Poisson model that have relativity short term dependency. Therefore, first of all, for design and dimensioning of next generation communication network, traffic model that are reflected burstiness and self-similarity is required. Here self-similarity can be characterized by Hurst parameter. In this paper, the calculation equation is derived considering queueing delay and self-similarity of data traffic art compared with simulation results.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.617-627
• /
• 2000

ATM networks support diverse traffic types with different service requirement such as data, voice, video and image. This paper analyzes a dynamic priority queue to satisfy Quality of Service (QoS) requirements of traffic. to consider the burstiness of traffic, we assume the arrival to be a Markovian arrival process(MAP) . Performance measures such as loss and delay are derived, Finally, some numerical results show the performance of the system.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.285-295
• /
• 2001

We consider a queueing system under overload control to support bursty traffic. The queueing system under overload control is modelled by MMBP/D1/K queue with two thresholds on buffer. Arrival of customer is assumed to be a Markov-modulated Bernoulli process (MMBP) by considering burstiness of traffic. Analysis is done in discrete-time case. Using the generating function method, we obtain the stationary queue length distribution. Finally, the loss probability and the waiting time distribution of a customer are given.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.514-516
• /
• 2002

현재 많은 패킷 스위칭을 이용하는 네트워크로부터 발생되는 트래픽에서 burstiness 성질이 넓은 범위의 시간 축 상에 걸쳐 나타난다. 이런 트래픽 특성이 self-similar 현상을 보이고 있다는 것이 알려지고 있다. 본 논문에서는 다중연결 스위치의 self-similarity 특성을 분석하고 특히 각 스위치의 이용도와 self-similarity 와의 관계를 분석한다. 그리고 본 논문의 연구 결과는 ATM 등과 같은 초고속 스위치의 설계시 사용될 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.136-138
• /
• 2003

빠른 속도와 넓은 대역폭을 이용한 멀티미디어 데이터 전송이 가능하게 됨으로써 패킷 스위칭 네트워크로부터 발생되는 트래픽은 burstiness 성질을 보여준다. 이러한 트래픽은 전통적인 해석적 방법에서 네트워크의 성능평가를 위해 사용되고 있는 트래픽 모델과는 상당히 다른 self­similar 트래픽 성질을 갖고 있다는 것이 실제 트래픽을 측정한 결과 나타나고 있다. 일반적으로 ATM 스위치는 패킷을 효율적으로 전송하기 위해 다양한 공유 버퍼관리 방법을 적용한다. 따라서 본 논문에서는 공유 버퍼를 사용하여 다중 스위치로 상호 연결된 ATM 스위치에서 self­similar 트래픽이 이웃 스위치들 간에 미치는 영향을 통하여 초고속 네트워크의 성능을 분석한다.