• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.533-536
• /
• 2000

In this paper, we proposed high performance packet forwarding engine for asynchronous transfer mode(ATM) based gigabit routers. The forwarding engine is based on ATM switch and accommodates four 622Mbps ports. The forwarding engine has been designed to be able to process the Intemet protocol(IP) packet at 2.5Gbps using the pipelined If header processing and lookup control mechanism. For high performance packet forwarding, we used content addressable memory(CAM) based routing coprocessor operating in hardware and implemented the pipelined lookup control function into a field programmable gate array(FPGA). The pipelined packet header processing mechanism enhanced the forwarding performance of the If packets ingressed from four different 622Mbps ports. Moreover, the If lookup controller designed to have the performance up to 12.5Mpps. The proposed forwarding engine is also designed to support differentiated services(DS) and multiprotocol label switching(MPLS).

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.3
• /
• pp.44-49
• /
• 2001

In general. requirements for QoS are different according to the type of services in wireline and wireless ATM, and real-time video service is more sensitive to cell transmission delay than to cell loss. Existing handoff schemes emphasizing prevention of cell loss had limitations in cell transmission delay to satisfy QoS. In this paper, a novel scheme to transmit ATM cells with low CLP (when CLP = 0) prior to others and discarding cells with high CLP (when CLP = 1) in ATM cell header among cells to be forwarded during handoffs in real-time VBR service is proposed. The proposed scheme is proven to be suitable for the satisfaction of QoS and appropriate for fast handoffs by giving high CLP value to less meaningful MPEG frames through simulations.

• The KIPS Transactions:PartC
• /
• v.12C no.1 s.97
• /
• pp.83-96
• /
• 2005

The multichannel switch is an architecture widely used for ATM (Asynchronous Transfer Mode). It is known that the fault tolerant characteristic can be incorporated into the multichannel crossbar switching fabric. For example, if a link belonging to a multichannel group fails, the remaining links can assume responsibility for some of the traffic on the failed link. On the other hand, if a fault occurs in a switching element, it can lead to erroneous routing and sequencing in the multichannel switch. We investigate several fault localization algorithm in multichannel crossbar ATM switches with a view to early fault recovery. The optimal algorithm gives the best performance in terms of time to localization but it is computationally complex which makes it difficult to implement. We develop an on-line algorithm which is computationally more efficient than the optimal one. We evaluate its performance through simulation. The simulation results show that the Performance of the on-line algorithm is only slightly sub-optimal for both random and bursty traffic. There are cases where the proposed on-line algorithm cannot pinpoint down to a single fault. We enumerate those cases and investigate the causes. Finally, a fault recovery algorithm is described which utilizes the information provided by the fault localization algorithm The fault recovery algorithm providesadditionalrowsandcolumnstoallowcellstodetourthefaultyelement.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.305-310
• /
• 2003

The performance of various GFR implementations has been recently studied due to the interest to provide bandwidth guarantees with a simpler implementation than ABR in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. An efficient buffer management algorithm is necessary to guarantee MCR for untagged cell in ATM switch. In this paper, we propose and evaluate a buffer management scheme to provide the GFR service guarantees. The proposed scheme can control the cell discarding for fairness in each VC, and compared with Double-EPD and DFBA. Our results show that the proposed buffer management with per-VC queuing achieves significant enhancement on goodputs and fairness index than those of existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.782-792
• /
• 1997

Asynchronous transfer mode (ATM) provides the means to support with variety of multimedia serivices in broadband network. For the support of multimedia services, various data traffic with priortes should be controlled errectively and congestion function is required in the network to carry out the control operation. To accomplish this in a flexible and effective manner, priorty classes for the different services are commonly used. In this paper, we suggested a buffer managment algorithm in ATM network to improve overall network performance with separated buffer which consists of existing buffer with threshold andauxiliary buffer whose input consists of superposition of voice and data traffic. To evaluate the proposed buffer managment algorithms, simulations are excuted with two proiorities and the results are provied that network throughput is improved better than the existing parital buffer method.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.181-187
• /
• 2002

Connection admission control(CAC), which decides whether or not to accept a new call request, is one of the most Important preventive congestion control techniques in asynchronous transfer mode(ATM) networks. To develop a practical CAC scheme, first we propose a "Modified Cell Loss Probability MP${\nu}"$, which is based on "Virtual Cell Loss Probability P${\nu}"$, taking into account mean burst duration of input traffic source and buffer size in ATM networks. MP${\nu}"$ computes more accurate cell loss probability than P${\nu}"$ without increasing computational complexity, since P${\nu}"$ is formulated simply form the maximum and the average cell rate of input traffic. P${\nu}"$ is overestimated as compared to the real cell loss probability when the mean burst duration is relatively small to the buffer capacity. Then, we Propose a CAC scheme, based on "Modified Virtual Bandwidth(MVB)" method, which may individualize the cell loss probabilities in heterogeneous traffic environments. For the proposed approach, we define the interference intensity to identify interferences between heterogeneous traffic sources and use it as well as MP${\nu}"$ to compute MVB. Our approach is well suitable for ATM networks since it provides high bandwidth utilization and guarantees simple and real time CAC computation for heterogeneous traffic environments.heterogeneous traffic environments.

• Journal of IKEEE
• /
• v.4 no.2 s.7
• /
• pp.274-280
• /
• 2000

The fact that error probability is higher in wireless communication environment than the one in a fixed network makes it inappropriate to apply the same DLC (Data Link Control) protocol used in a wireline network to a wireless network. And since the existing DLC protocol for wireless network was optimized for low-rate data service, it is not suitable for a wireless network environment which should support high-speed and multimedia traffic. Therefore it is desperate to have a new DLC protocol for todays wireless mobile communication environment. In this paper, we propose an error control scheme in WATM (Wireless Asynchronous Transfer Mode) environment. which supportsmultiple traffic attributes, high-speed, multimedia data service. In this paper we modified the existing ASR ARQ (Adaptive Selective Repeat Automatic Repeat Request) protocol where cells exceeding maximum allowable delay range are discarded. And adding FEC (Forward Error Correction) for delay-sensitive traffic resulted in smaller increase of transmission delay.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.595-602
• /
• 2003

In this paper, we proposed new buffer management and cell scheduling scheme of GFR service for improving fairness of TCP/IP traffic in ATM networks. The proposed algorithm used untagged cell, which came to ATM switch, to decide the policy for discard of frame and what kind of VC cell it would serve. Performance analysis through the simulation present that proposed scheme can meet fairness 2 (MCR Plus equal share), which are not met by conventional scheduling mechanism such as WRR. Also, proposed scheme is superior to WRR about 30% in throughput and more efficiency in fairness criteria.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.842-848
• /
• 2003

The Guaranteed Frame Rate(GFR) service has been designed to accomodate non-real-time applications, such as TCP/IP based traffic in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. In this paper, we propose a buffer management scheme which can improve the fairness and the throughput through the traffic control in GFR service. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.