• Journal of Industrial Technology
• /
• v.11
• /
• pp.99-106
• /
• 1991

In this paper the functional requirements of a B-ISDN access network based on MAN are investigated. Firstly, criteria of designing access network for the B-ISDN is studied. Secondly, the types of subscribers and their service requirements are defined. Thirdly, various architectures of CPNs(Customer Premises Networks) are considered and their characteristics are studied, Finally, the interworking functions of a DQDB MAN as an access network are investigated.

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

In this paper, we propose the adaptive separated-queueing ATM switching model for the effective processing of the various types of multimedia traffic by virtue of ATM switching network with multiple outlets which is the essential part of B-ISDN. This proposed model employs the dynamically separated buffering mechanism in the processing of two classes of cell, realtime service traffic and non-realtime service traffic, at the output buffer to enhance the overall QoS(Quality of Service). The adopted ATM switch architecture has Batcher-banyan based network, but it uses different topologies and control techniques 6to resolve the cell contention. For the performance evaluation of our proposed method, we have done both analytical modeling and simulation. The both results show that our proposed queueing strategy is quite appropriate to the ATM switch with multiple outlets and can quarantee the QoS requirements of the incoming multimedia traffic.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.12
• /
• pp.1493-1503
• /
• 1999

ATM Clustering System과 같이 SAN(System Area Network) 환경에서 동작하는 시스템은 낮은 지연시간과 넓은 대역폭의 네트워크가 필수적이나 기존의 에러 복구 프로토콜들은 이러한 요구를 충족시키기에는 큰 오버헤드를 가지고 있다. 제안된 새로운 에러 복구 프로토콜은 ATM Clustering System 환경에서 최적의 성능을 나타내는 light-weight 프로토콜로 에러가 없는 상황과 에러 복구가 진행중인 상황에 따라 acknowledgement 주기를 적응적으로 변화시키는 adaptive acknowledgement scheme를 제안하여 적용하였다. 제안된 프로토콜은 상용 툴인 SDT를 이용한 논리 검증 받았고, DEVSim++ 환경에서의 성능 분석을 통해 프로토콜이 최상의 성능을 보이기 위한 파라메터 값을 찾았고, 이 값을 적용하였을 때의 성능을 기존의 프로토콜과 비교하여 제안된 프로토콜이 더 우수함을 확인하였다.Abstract While a system working with SAN, such as ATM Clustering System, requires a network with low latency and wide bandwidth, the previous error recovery protocols have a serious network overhead to satisfy this requirement. The suggested error recovery protocol is a light-weight protocol which can shows its best performance at ATM Clustering System and uses a newly suggested adaptive acknowledgement scheme. In the adaptive acknowledgement scheme, the period of acknowledgement is dynamically changed depending on the state of the network. We proved the logical correctness of our protocol with SDT and did performance analysis with DEVSim++. From the analysis, we found the optimal parameter values for best performance and showed that our protocol works better than the previous error recovery protocols.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1426-1437
• /
• 1999

The introduction of fast packet switching networks such as the ATM leads to the possibility of video services with constant quality. However, the fixed traffic descriptor(TD), which is defined by ATM Forum and ITU-T, can not simultaneously satisfy network efficiency and video quality. This paper presents fast resource reallocation protocol (FRRP) which can provide an effective compromise between network efficiency and video quality. This protocol reallocates the network resources and then adapts the traffic to the reallocated resources. In the proposed method, a video session is divided into several time-intervals according to its generated traffic and TD is calculated which well characterizes the traffic during the specific subdivided interval. In addition, a system model, where MPEG coding algorithm and network control are unified, is proposal and the performance of the FRRP in terms of cell loss rate(CLR) is evaluated though the simulation using real video traffic(Star Wars). Simulation results show that the FRRP has only 5 ~35% CLR of the fixed TD.

• ETRI Journal
• /
• v.24 no.1
• /
• pp.43-55
• /
• 2002

This paper proposes a flow-based admission control algorithm through an Asynchronous Transfer Mode (ATM) based Multi-Protocol Label Switching (MPLS) network for multiple service class environments of Integrated Service (IntServ) and Differentiated Service (DiffServ). We propose the Integrated Packet Scheduler to accommodate IntServ and Best Effort traffic through the DiffServ-aware MPLS core network. The numerical results of the proposed algorithm achieve reliable delay-bounded Quality of Service (QoS) performance and reduce the blocking probability of high priority service in the DiffServ model. We show the performance behaviors of IntServ traffic negotiated by end users when their packets are delivered through the DiffServ-aware MPLS core network. We also show that ATM shortcut connections are well tuned with guaranteed QoS service. We validate the proposed method by numerical analysis of its performance in such areas as throughput, end-to-end delay and path utilization.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.105-111
• /
• 2002

Presented is a Genetic Algorithm(GA) for dynamic partitioning an ATM LANE(LAN Emulation) network. LANE proves to be one of the best solutions to provide guaranteed Quality of Service(QoS) for mid-size campus or enterprise networks with a little modification of legacy LAN facilities. However, there are few researches on the efficient LANE network operations to deal with scalability issues arising from broadcast traffic delivery. To cope with this scalability issue, proposed is a decision model named LANE Partitioning Problem(LPP) which aims at partitioning the entire LANE network into multiple Emulated LANs(ELANs), each of which works as an independent virtual LAN.

• ETRI Journal
• /
• v.20 no.2
• /
• pp.171-191
• /
• 1998

In this paper, we propose a new heuristic design algorithm for the virtual path (VP)-based ATM network with multiple traffic classes, in which QoS constraints associated with traffic class are taken into account. The minimum bandwidth of VP required to carry given amount of traffic is obtained by utilizing an equivalent bandwidth concept, and the route of each VP is placed so that the network cost is minimized while the QoS requirement is fulfilled To evaluate our design algorithm, we consider two kinds of traffic: voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in providing a cost-effective VP-based ATM network.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.214-222
• /
• 2008

Bode principle is applied to carry out traffic control for rate based ATM network, which guarantees the higher buffer utilization, buffer overflow-free, and well utilization of bandwidth. The principle confirms the relationship between the threshold of buffer queue and the network bandwidth, as well as the relationship between the threshold of buffer and source input rate. Theoretic warrant of the buffer threshold is proposed. The reference range of source input rate is provided in theory, which makes the source end respond to the change of network state rapidly and dynamically, and then the effect of time delay to the traffic control is avoided. Simulation results show that the better steady and dynamic performances of networks are obtained by Bode principle.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.580-592
• /
• 1997

Since an ATM network consists of a number of VPC/VCC requiring various QoS requirements, the end-to-end QoS for each VPC/VCC should be guaranteed. Although many research works on the traffic control are under study to guarantee the QoS, there have been research efforts to reflect the results of network management functions into the traffic control mechanism. To effectively make use of the performance management functions into the VPC/VCC management, threre is a need for the network manager to rapidly retrieve the relevant information. In this research, the mechanism to effectively retrieve the management information using SNMP is suggested. First of all, we construct the MIBs in the agent for the corresponding VPC/VCC. Also, we suggest the way to retrieve MIB with minimum cost. Mathematical analysis shows that the proposed technique has better performance than that using the existing SNMP.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.4
• /
• pp.574-581
• /
• 2002

Traditional queueing analyses are very useful for designing a network's capacity and predicting their performances, however most of the predicted results from the queueing analyses are quite different from the realistic measured performance. And recent empirical studies on LAN, WAN, and VBR traffic characteristic have indicated that the models used in the traditional Poisson assumption cannot properly predict the real traffic properties due to underestimation of the long-range dependence of network traffics and self-similar properties. In this paper, It is also shown that the self-similar traffic reflects real Ethernet traffic characteristics by comparing Pareto-like ON/OFF source model which is exactly self-similar model to the traditional Poisson model. It is also performed optimization design and performance analysis of ATM network using Internet traffic characteristics.