• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2477-2487
• /
• 1997

In this paepr, we propose a dynamic multicast routin algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the effiiciency enen in the case wheree the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we frist generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection. We also demonstrate the more cost-saving can be expected in dense networks when applyingour proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.9
• /
• pp.809-818
• /
• 1991

We investigate the onsiderations of design issues for a bradband ATM network. Three kimds of network design requirement are considered ; user grade-of-service(GOS) requirements. Network manager requirements, and system designer requirements. In this work, e are focusing on the balancing problems among performance measures. We suggest that design parameters for a bradband ATM echange would be tuned within the acceptable sets by a layering concept on the peformance objectives.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1985-1991
• /
• 1999

In this paper, complete and general two-port lumped Spice-network model is developed for a lossy transmission line. This model is realized as a Spice subcircuit, by means of standard lumped network elements and mathematical functions. It is used as a component in the time-domain simulation of a high-speed data transmission line such as IMI(Inter Module Interface) data path in HANbit ACE 64 ATM switching system. The only required Spice network elements are resistance and frequency-dependent controlled-voltage sources. Such frequency-dependent sources are realized by utilizing the standard Hspice mathematical functions FREQ, DELAY, and POLY.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.4
• /
• pp.745-750
• /
• 2000

In ATM Network, many algorithms have been proposed for rate-based ABR flow control. The object of these Algorithms is to turn around from cell loss and to use the unused bandwidth by ABR Traffic. These Algorithms are applied to control ABR Traffic by EFCI and ER switches. In previous paper, we showed the using rate of bandwidth for the characteristic of each algorithm applied these algorithm network. In this paper, we will do that to apply these algorithms to a network and to make a graph of characteristic of each algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3634-3641
• /
• 1999

LAN Emulation and IPOA are the two most widei y accepted network protocols which allow to provide conventional LAN-based data services on ATM LAN environment. In this paper, the performance of IPOA and LAN Emulation on ATM LAN testbed is compared and the results are compared with performance of Ethernet as well. For performance comparison, metrics such as application throughput, latency, CPU usage are used. In addition, a network program that uses the socket based TCP/IP application programming interface to send large data files from client to server via ATM LAN switch is developed. IPOA provides lower latency and higher throughput than LAN Emulation while LAN Emulation consumes more CPU usage.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.224-236
• /
• 1997

In order to control the flow of traffic in ATM networks and optimize the usage of network resources, an appropriate control mechanism is necessary to cope with congestion or prevent degradation of network performance caused by congestion. While the conventional UPC algorithm provides only unstable preventive function unrelated with the state of networks and is unable to recover congestion, the proposed adaptive UPC algorithm supervises the situation of ATM networks using the information from OAM cell. Then the monitor of the proposed adaptive UPC algorithm controls leaky rate and buffer threshold value according to QOS. Therefore, the proposed algorithm can cope with congestion as well as prevent and react sensitively to buffer delay. In proportion to the diversity of traffic and the increase of transmission rate in networks, the adaptive UPC-BT algorithm proposed in this paper can be effectively used in ATM networks with wide applications. This paper shows that the proposed algorithm efficiently uses in ATM networks with application. This paper shows that the proposed algorithm efficiently use network resources and provides QOS to users for various kinds of traffics by comparing with conventional UPC algorithms.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.9
• /
• pp.1163-1174
• /
• 2001

A general goal of the ATM(Asynchronous Transfer Mode) network is to support connections across various networks. ABR service using EPRCA(Enhanced Proportional Rate Control Algorithm) switch controls traffics in ATM network. EPRCA switch, traffic control method uses variation of the ACR(Allowed Cell Rate) to enhance the utilization of the link bandwidth. However, in ABR(Available Bit Rate) service, different treatments are offered according to different RTTs(Round Trip Times) of connections. To improve the above unfairness, this paper presents ABR DELAY mechanism, in which three reference parameters for cell delay are defined, and reflect on the messages of RM(Resource Management) cells. To evaluate our mechanism, we compare the fairness among TCP connections between ABR DELAY mechanism and ABR RRM mechanism. And also we execute simulations on a simple ATM network model where six TCP connections and a background traffic with different RTTs share the bandwidth of a bottleneck link. The simulation results, based on TCP goodput and efficiency, clearly show that ABR DELAY mechanism improves the fairness among TCP connections.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.182-192
• /
• 1999

The advance of the MPEG(Moving Picture Expert Group) and DSP(Digital Signal Processing) technologies lead the energence of the information appliances which are gradually digitalized and embedded the high-speed networking function. This paper proposes a CHANCE(Cost-effective Home ATM Network for the Consumer Electronics) protocol supporting the ATM-based high-speed networking between the information appliances within the home, and designs its specific functions including the network management and signalling function. The CHANCE protocol is basically based on the tree topology, and supports the plug-and-play function by using only the header field of the ATM cells. Unlike the existing ATM Warren protocol which uses the source routed addressing scheme to control the in-home devices from the Warren controller, the CHANCE protocol can support the inter-device controls as well as the controls from the CHANCE controller by using the switch and device identifier.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.148-158
• /
• 1999

ABR traffic form ATM LAN is controlled through RM cell, and the interface function to public ATM network is necessary to provide ABR service efficiently. This paper presnets new interface architecture, which is based on "Projected Node" [6]. using AIPU(ABR Interface Proxy Unit) to support ABR traffic streams incoming from ATM LAN in the public ATM network. For the efficient interworking, the AIPU has designed for interworking functions with ERICA switch mechanism. Conventional ERICA switch mechanism specified in TM 4.0 is basically used for short distance comparative to public network, however AIPU adopts the novel control mechanism to cover logng roud trip time (RTT). To improve the problems and to provide a dynamic range of UCI(Update Count Interval), this paper proposes, a novel control scheme, DUCI ( Dynamic Update Count Interval. And the paper shows inefficiencies of ERICA mechanism with fixed UCI through the simulation results, and represents the performance enhancement of DUCI mechanism developed to adjust the update count interval dynamically.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.299-310
• /
• 2002

This paper describes an integrated network management framework for providing point-to-multipoint reservation service (PMRS) in an ATM network. There are two major issues confronting the network service provider in relation to this service: one is to rapidly confirm the acceptability of the subscriber's reservation at subscription time, and the other is to punctually activate the reserved point-to-multipoint service. To meet these requirements, we developed a service provision model (SPM) and a network resource model of a bandwidth allocation timetable (BATT). We propose a point-to-multipoint routing algorithm composed of ordering and backtracking procedures, which can find the best branch point under the complex network topology and can add more destinations to the existing point-to-multipoint route. We demonstrate the feasibility of the SPM, the BATT, and the point-to-multipoint routing algorithm by implementing our schemes and analyzing their performance under the operational ATM network of KT(Korea Telecom).