• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.123-126
• /
• 2000

In this paper, we are proposed to pushing window input buffer A.T.M Switch that is not use memory read and write of general window police. Pushing window switch is superior to general window switch in performance but is large to general window switch in cross point number. Max throughput and Cell occupying probability results are verified by analysis an simulation. The evaluation of performance is max throughput and cell loss probability and mean queue length.

• Journal of Applied Reliability
• /
• v.11 no.1
• /
• pp.1-15
• /
• 2011

Automobile markets are so fierce in the world market that every major manufacturer assure the buyer of the car by give a provocative warranty plan for their cars. For instance Hyundai motor company offer 10 years and 100,000 miles of warranty whichever comes first. But in order for this effort to be successful every critical component such as window switch has to be proven to be reliable in an adverse environment. Therefore, in this article reliability assessment criteria for window switch are established in terms of basic performance test, environment test and life test.

• Management Science and Financial Engineering
• /
• v.4 no.2
• /
• pp.43-58
• /
• 1998

Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.

• Elastomers and Composites
• /
• v.54 no.4
• /
• pp.351-358
• /
• 2019

To evaluate the aging of a rubber pad in power window switch which is the part of a vehicle, the accelerated thermal aging test of rubber pad material is performed. Finite element analysis was performed using the nonlinear material constants of the rubber pad to calculate the operating force, and the Arrhenius relationship was derived from the aging temperature and time. The aging test was performed at 150, 180, 210, or 240 ℃ for 1 to 60 days. When the operating force of the rubber pad is changed by 10% from the initial value, the service life is expected to be 113 years, which is much longer than the life of the vehicle. This indicates that the aging life of the rubber pad is sufficiently safe and the operating force of the rubber pad during the life of the vehicle (20 years) was decreased by approximately 8.4%. By examining the correlation between the shear elastic modulus and operating force calculated from finite element analysis under each aging test condition, the changes in the operating force of the rubber pad and the shear elastic modulus showed good linear relationship. The aging life could be predicted by the change in shear elastic modulus and a process for predicting the aging life of automotive power window switch rubber pad parts is described herein.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.117-124
• /
• 1998

As window sized increases, the throughput input-buffered packet switch with a window scheme improves on random traffic condition. However, the improvement diminishes quickly under bursty traffic. In this paper, we propose Burst Head Addressable FIFO mechanism and memory structure having search capability in unit of burst header to compensate the sensitiveness of the windowed scheme to bursty traffic. The performance of a input-buffered switch using the proposed Burst Header Addressable FIFO input buffer was analyzed using computer simulations. The maximum throughput of the conventional FIFO scheme approaches an asymptotic value 0.5 as mean burst length increases. The maximum throughput of the proposed scheme is greater than that of the conventional scheme for any mean burst length and window size.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.330-341
• /
• 2007

This work analyzes the performance of the parallel packet switch (PPS) with a sliding window (SW) method. The PPS involves numerous packet switches that operate independently and in parallel. The conventional PPS dispatch algorithm adopts a round robin (RR) method. The class of PPS is characterized by deployment of parallel low-speed switches whose all memory buffers run more slowly than the external line rate. In this work, a novel SW packet switching method for PPS, called SW-PPS, is proposed. The SW-PPS employs memory space more effectively than the existing PPS using RR algorithm. Under identical Bernoulli and bursty data traffic, the SW-PPS provided significantly improved performance when compared to PPS with RR method. Moreover, this investigation presents a novel mathematical analytical model to evaluate the performance of the PPS using RR and SW method. Under various operating conditions, our proposed model and analysis successfully exhibit these performance characteristics including throughput, cell delay, and cell drop rate.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06e
• /
• pp.223-226
• /
• 1998

In the Input Buffer Switch using the intial stage FIFO memory structure, It has pointed the Throughput limitation to the percent of 58.6 due to HOL(Head of Line) blocking in the DBP(Dedicated Buffer with Pointer) method, During that time, To overcome these problems, The prior papers have proposed the complicated Arbitration algorithms and Non-FIFO memory structures. and These showed the improved Throughput. But, Now, To design high speed ATM Switch which need to the tens of Giga bit/s or the tens of Tera bit/s. It has more difficulty in proceeding the priority of majority and the complicated Cell Scheduling, because of the problem in operating the control speed of the ratio of N to scanning each port and scheduling the Cell. In this paper, To overcome these problems, We could show more the improved performance than the existing DBP Window policy to design high speed ATM Switch.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.11-20
• /
• 2008

IEEE 802.16e has adopted sleep mode to minimize energy consumption of mobile nodes with high speed mobility. If the Base Station (BS) has no data to be sent to a Mobile Subscriber Station (MSS) at the instant of ending sleep window of the MSS, the MSS increases its sleep window interval by double until the window interval reaches to the maximum sleep window interval. Thus, during the operation of sleep mode, MSS repeatedly performs switch on/off action until there exist frames to be received from BS. The switch on/off operation significantly consumes energy of MSS. To effectively deal with the energy of the MSS, this paper proposes an algorithm which decides the minimum sleep window interval that will be used in next sleep mode based on the current sleep window interval. We evaluate the performance of IEEE 802.16e sleep mode algorithm and our proposed algorithm in terms of energy consumption and blocking probability. Compared with the current sleep mode algorithm used in IEEE 802.16e, the proposed algorithm decreases the energy consumption by about 30% without increasing blocking probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.113-122
• /
• 2001

Several guidelines can be developed for a satellite-based ATM switch. One of the most important of these is that the switch must provide a requirement for CLRs on the order of 10-10 to meet the QoS of high- performance traffic and avoid costly retransmissions. In this paper, the proposed approach shows not only the better traffic performance but also requires the little switching elements and buffers compared with original Knockout switch and other scheduling algorithm. As a result, the complexity becomes reduced. Simulation results indicate that proposed approach shows excellent cell loss ratio compared with existing switch architecture. Also, iii performance can be approached to the cell loss ratio, which is requirement for the satellite system, as window size increases. An(1 it shows thats low complexity is induced. Therefore, the proposed approach is appropriate for satellite on-board ATM switch architecture.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.793-805
• /
• 2001

In the recent priority system, high-priority packet will be served first and low-priority packet will be served when there isn\`t any high-priority packet in the system. By the way, even high-priority packet can be blocked by HOL (Head of Line) contention in the input queueing System. Therefore, the whole switching performance can be improved by serving low-priority packet even though high-priority packet is blocked. In this paper, we study the performance of preemptive priority in an input queueing switch for high speed switch system. The analysis of this switching system is taken into account of the influence of priority scheduling and the window scheme for head-of-line contention. We derive queue length distribution, delay and maximum throughput for the switching system based on these control schemes. Because of the service dependencies between inputs, an exact analysis of this switching system is intractable. Consequently, we provide an approximate analysis based on some independence assumption and the flow conservation rule. We use an equivalent queueing system to estimate the service capability seen by each input. In case of the preemptive priority policy without considering a window scheme, we extend the approximation technique used by Chen and Guerin [1] to obtain more accurate results. Moreover, we also propose newly a window scheme that is appropriate for the preemptive priority switching system in view of implementation and operation. It can improve the total system throughput and delay performance of low priority packets. We also analyze this window scheme using an equivalent queueing system and compare the performance results with that without the window scheme. Numerical results are compared with simulations.