• 한국통신학회논문지
• /
• 제27권4C호
• /
• pp.282-294
• /
• 2002

The modern telecommunication networks are composed of various network-type and are managed by various management technologies, such as TMN, SNMP, TINA etc. Furthermore, the network user's needs of real-time multimedia services are rapidly increasing. In order to guarantee the user-requested quality-of-service(QoS) and keep the network utilization at maximum, it is required to manage the network performance continuously after the network is deployed. The performance management function should provide the useful information for the network expansion and the capacity reallocation in the future. In this paper, we propose a DPE-based performance management architecture for the integrated management of the heterogeneous network elements with TMN and SNMP. We propose an approach to provide the Intranet traffic monitoring and analysis function using layered network management concept and distributed processing technology. The proposed architecture has been designed and implemented based on multiprocess and multithread structure to support concurrent processing. To manage the traffic according to the Intranet service categories, we implemented an ITMA(Intelligent Traffic Monitoring Agent) with packet capture library. With the proposed architecture, we could measure and analyze the real Intranet traffic of Yeungnam University.

• Journal of Communications and Networks
• /
• 제18권3호
• /
• pp.523-530
• /
• 2016

We use both theoretical analysis and simulations to study the impact of crosspoint-queued (CQ) buffer size on CQ switch throughput and delay performance under different traffic models, input loads, and scheduling algorithms. In this paper, we present the following. 1) We prove the stability of CQ switch using any work-conserving scheduling algorithm. 2) We present an exact closed-form formula for the CQ switch throughput and a non-closed-form but convergent formula for its delay using static non-work-conserving random scheduling algorithms with any given buffer size under independent Bernoulli traffic. 3) We show that the above results can serve as a conservative guide on deciding the required buffer size in pure CQ switches using work-conserving algorithms such as the random scheduling, under independent Bernoulli traffic. 4) Furthermore, our simulation results under real-trace traffic show that simple round-robin and random work-conserving algorithms can achieve quite good throughput and delay performance with a feasible crosspoint buffer size. Our work reveals the impact of buffer size on the CQ switch performance and provides a theoretical guide on designing the buffer size in pure CQ switch, which is an important step toward building ultra-high-speed switch fabrics.

• Journal of applied mathematics & informatics
• /
• 제7권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 information and communication convergence engineering
• /
• 제5권2호
• /
• pp.88-92
• /
• 2007

In this paper, an SS-RRA protocol that is based on Code Division Multiple Access is proposed and analyzed under the integrated voice and data traffic load. The backward logical channels consist of slotted time division frames with multiple spreading codes per slot. The protocol uses a reservation mechanism for the voice traffic, and a random access scheme for the data traffic. A discrete-time, discrete-state Markov chain is used to evaluate the performance. The numerical results show that the performance can be significantly improved by a few distinct spreading codes.

• ETRI Journal
• /
• 제14권4호
• /
• pp.258-270
• /
• 1992

It is indispensable to control the service traffic for maximizing the advantages of ATM. This paper introduces the scheme of the an ATM traffic control and investigates the UPC(Usage Parameter Control) algorithms of the ATM-traffic. We have extracted the considerations on UPC algorithms and described the definition of the performance. We also have searched the way to choose the most appropriate UPC method considering the UPC's environments. As a result, we proposed the reliable UPC method that is applicable to B-ISDN, based on the comparison of the performance and the implementation of each.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1342-1345
• /
• 2004

An analytical of throughput and delay on reverse link in a cellular slotted CDMA system with integrated voice and World Wide Web (WWW) traffic is presented in this paper. Our results show that the Gaussian approximation it was found that the voice traffic can have a significant impact on the WWW traffic. It was also found that the different mobiles velocity and number of resolvable paths is impact each other the system performance.

• 응용통계연구
• /
• 제20권2호
• /
• pp.219-227
• /
• 2007

시계열 모형은 통신망 트래픽의 예측과 분석에 유용하게 쓰여 왔다. 본 논문에서는 통신망 트래픽의 예측을 위하여 다양한 시계열 모형을 소개하고 성능평가를 하고자 한다. 이를 위하여 실제 통신망 트래픽 자료에 선형 및 비선형 시계열모형을 적합 시키고 비선형 시계열모형이 선형 시계열 모형보다 예측의 정확도가 우수함을 보이고자 한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2000년도 추계종합학술대회
• /
• pp.272-277
• /
• 2000

본 논문에서는 Self-similar 확률과 정의 및 트래픽외 특성, 그리고 최근 논문들에서 보고된 사례에 대한 동향과 실제의 데이터 트래픽 특성에 대한 분석연구를 통하여 Self-similar 패턴에 대한 연구 결과를 제시하고자 한다.

• ETRI Journal
• /
• 제24권5호
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• ETRI Journal
• /
• 제23권2호
• /
• pp.52-60
• /
• 2001

In this paper, a medium access control protocol is proposed for integrated voice and data services in wireless local networks. Uplink channels for the proposed protocol are composed of time slots with multiple spreading codes per slot based on slotted code division multiple access (CDMA) systems. The proposed protocol uses spreading code sensing and reservation schemes. This protocol gives higher access priority to delay-sensitive voice traffic than to data traffic. The voice terminal reserves an available spreading code to transmit multiple voice packets during a talkspurt. On the other hand, the data terminal transmits a packet without making a reservation over one of the available spreading codes that are not used by voice terminals. In this protocol, voice packets do not come into collision with data packets. The numerical results show that this protocol can increase the system capacity for voice service by applying the reservation scheme. The performance for data traffic will decrease in the case of high voice traffic load because of its low access priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.