• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.3
• /
• pp.179-196
• /
• 1986

In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.7B
• /
• pp.673-685
• /
• 2002

In this paper, we analyze the pros and cons of the fast power control to the forward link in the environments where mixed traffics of voice and data produce the transmitted/received power difference. We propose the Zone-based power control scheme that can improve the performance of the fast power control scheme in the viewpoint of the resource allocation. The proposed scheme is a mechanism that controls both the power and rate of non-realtime data traffics according to location distribution of the mobile stations. The scheme is based on the conventional fast power control scheme in the CDMA systems, and it adaptively controls the transmission rate of each data traffic. Zone-based rate control of data call brings about somewhat power margin to the call. As a result, the proposed scheme saves the power consumption of portables and reduces the amount of interference. With the proposed scheme, not only be extended the service coverage of high-rate traffic to the entire cell service coverage, but also the QoS of low-rate traffic can keep going through the service time, especially, in the situation that the amount of incoming interference is much larger. The experimental results show that the proposed scheme yields a improved performance compared with the conventional scheme in terms of the power consumption and traffic throughput of portables, especially, with the increasing number of high-rate data traffics.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.12 s.354
• /
• pp.53-60
• /
• 2006

Handover of WiBro is based on 802.16e hard handover scheme. When PSS is handover, it is handover that confirm neighbor's cell condition and RAS ID in neighbor advertisement message. Serving RAS transmits HO-notification message to neighbor RAS. Transmiting HO-notification message to neighbor RAS, it occurs many signaling traffics. Also, When WiBro is handover, It occurs many packet loss. Therefore, user suffer service degradation. LPM handover is supporting seamless handover because it buffers data packets during handover. So It is proposed scheme that predicts is LPM handover and reserves target RAS with pre-authentication. These schemes occur many signaling traffics. In this paper, we propose PSS Movement Prediction to solve signaling traffic. Target RAS is decided by old data in history cache. When serving RAS receives HO-notification-RSP message to target RAS, target RAS inform to crossover node. And crossover node bicast data packet. If handover is over, target RAS forward data packet. Therefore, It reduces signaling traffics but increase handover success rate. When history cache success, It decrease about 48% total traffic. But When history cache fails, It increase about 6% total traffic

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.115-122
• /
• 2002

This paper presents a new web cluster scheme based on dispatcher which does not depend on operating system for server and can examine server's status interactively. Two principal functions are proposed for new web cluster technique. The one is self-controlled load distribution and the other is transaction fail-safe. Self-controlled load distribution function checks response time and status of servers periodically, then it decides where the traffic goes to guarantee rapid response for every query. Transaction fail-safe function can recover lost queries including broken transaction immediately from server errors. Proposed new web cluster scheme is implemented by C language on Unix operating system and compared with legacy web cluster products. On the comparison with broadcast based web cluster, proposed new web cluster results higher performance as more traffic comes. And on the comparison with a round-robin DNS based web cluster, it results similar performance at the case of traffic processing. But when the situation of one server crashed, proposed web cluster processed traffics more reliably without lost queries. So, new web cluster scheme Proposed on this dissertation can give alternative plan about highly increasing traffics and server load due to heavy traffics to build more reliable and utilized services.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5A
• /
• pp.809-816
• /
• 2001

본 논문에서는 사용자 수의 증가에 민감하지 않은 안정적인 인터넷 서비스를 위한 매체접근제어 프로토콜을 제안하고자 한다. 제안하는 프로토콜에서는 짧은 시간동안 적은 양의 데이터가 발생하는 상향채널 인터넷 트래픽의 특성 및 음성과 데이터 연결이 동시에 설정되는 다중 세션 모드를 활용하여 음성 트래픽 채널을 통해 상향채널 인터넷 트래픽을 전송할 수 있는 방안을 제시한다. 수학적 분석 시뮬레이션 결과는 다중세션 하에서 제안하는 매체접근제어 프로토콜을 적용할 경우 높은 시스템 부하에서도 안정된 인터넷 서비스 제공이 가능함을 보인다.

• Proceedings of the Optical Society of Korea Conference
• /
• 2009.02a
• /
• pp.307-308
• /
• 2009

To reduce delay for high priority packets in the ring-based EPON, the EPON packet classifier groups services as their priorities and frames for services are dynamically framed as their priorities. Since dynamic framing for a packet priority dynamically changes assignment spaces in the maximum framing packet size as network traffics, it makes services with high priority to improve quality of services with relative low threshold time for transmitting.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.95-98
• /
• 1998

In this paper, we propose a cell scheduling algorithm for ABR traffic in ATM multiplexer. Proposed Algorithm can support ABR service more efficiently than existing WRR and DWRR algorithm. We evaluate the performances of proposed algorithm through computer simulation. Also, we model the VBR and the ABR traffics as ON/OFF source, and the CBR traffic as a Poisson source. And the simulation shows that proposed algorithm better performance over other cell scheduling algorithm in tem of mean cell delay time.

• Computational Structural Engineering
• /
• v.5 no.3
• /
• pp.139-146
• /
• 1992

Vibrational behaviors of highway girder bridges due to heavy traffics are discussed, and empirical formulae for impact factors are suggested in this paper. Appropriate vehicle model for vibration analysis is found and impact factors are calculated with different surface roughnesses, vehicle speeds and span lengths. It is shown that the present codes tend to underestimate impact factors.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.183-185
• /
• 2000

본 논문에서는 SNMP를 이용한 Nerwork Management System(NMS)이 Network을 사용하는 Application에 영향을 주지 않도록 하는 Polling 전략과 Model을 설계하였다. 제안된 System은 Network의 각 Client 정보를 처리하는 Agent와 Data 수집 및 제어를 담당하는 Server로 구성된다. Agent는 SNMP Agent 부분과 Network 상태를 Monitoring 하는 SubManager로 구성되어, Server는 SNMP Agent와의 Polling 및 Polling 정책을 결정하는 부분으로 구성된다. 제안 Model은 SNMP를 이용한 NMS를 도입할 경우, 기존 Network Service에 영향을 주지 않도록 하는 것이 목적이다. 제안된 System에 대한 성능평가를 위해 실존하는 Network을 대상으로 SNMP의 Polling 및 Service의 부하량을 측정하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.12B
• /
• pp.1996-2002
• /
• 2000

This paper investigates a priority scheme for IEEE 802.11 Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) protocol in order to provide short access times for priority frames (e.g. time-deadline traffic) even when the overall traffic on the wireless channel is heavy. Under the compatibility constraint for the IEEE 802.11 wireless LANs, two priority systems are simulated: no priority (current IEEE 802.11 standard) for time-deadline traffics and dynamic time-deadline priority. We evaluate algorithms to improve the time-deadline traffic performance using discrete event simulation (DES)