• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.444-446
• /
• 1998

실시간 멀티미디어 응용의 등장으로 멀티캐스트와 QoS(Quality of Service)필수적인 망 서비스가 부각되고 있다 이에 ATM 기반의 인터넷에서 IP멀티캐스트의 효율적인 처리를 위하여 MARS(Multicast Address Resolution Server)가 제안되었고, 기존의 최선 서비스 기반의 인터넷에서 QoS(Quality of Service)를 지우너하기위하여 RSVP(Resource Reservation Protocol)가 제안되었다. 본 논문에서는 ATM망에서 QoS 가 지원되는 IP 멀티캐스트 서비스를 제공하기위하여 MARS 구조에서 RSVP를 지원하는 방안을 두 가지 제안하고, 시뮬레이션을 통하여 그 성능을 분석하고자 한다. 제안하는 두 가지 방법은 각각 RSVP 전 홉 논드 방식과 MARS서버 방식이라 명명하였다. RSVP전 홉 노드 방식은 송신원으로부터 ATM 망으로 진입하는 노드와 수신원을 향하여 ATM망을 진출하는 노드 간에 각각 일대일 양방향 VC를 설정하여 멀티캐스트 그룹에 속하는 수신원들이 보내는 자원 예약 메시지를 ATM 망에서 전송하는 방안이다. MARS 서버 방식은 MARS서버가 RSVP자원 예약 메시지를 처리하도록 그 기능을 확장함으로써 ATM 망의 제어 VC를 절약할 수 있는 방안이다. 시뮬레이션을 통하여, RSVP흐름의 휴지기간이 짧으면 RSVP전 홉 노드방식이 VC해제율이 낮아져 병목 현상으로 인한 큐잉 지연에 크게 영향을 받고 있는 MARS방식보다 유리함을 볼 수 있었고 RSVP 흐름의 휴지기간이 길 때는 병목 현상이 완화된 MARS방식이 VC설정 지연 단점이 부각된 RSVP 전 홉 노드 방식보다 유리함을 볼 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.33-43
• /
• 2013

This paper proposes a distributed MAC protocol called Carrier Sensing Multiple Access with Collision Resolution (CSMA/CR) considering fully-connected single hop network environments for next-generation wireless LAN with high density of stations. The proposed CSMA/CR is compatible with the conventional MAC protocols by observing the operation of CSMA/CA and is able to detect a collision promptly without RTS/CTS exchange by applying the technique of CSMA/CD to wireless environments. Moreover, once a collision is detected, the dedicated resource is allocated to the next transmission and so the collision that may occur again is resolved. We investigate some implementation issues for the practicality of CSMA/CR and compare it with the typical distributed MAC protocols. The simulation results show that the proposed CSMA/CR has a low overhead as detecting a collision without the RTS/CTS exploitation and achieves always the best throughput regardless of the number of access stations, by using the reservation-based collision resolution technique.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.950-956
• /
• 2015

In this paper, a WiMedia Distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service in Indoor and Ship Area Networks. Furthermore, to provide the OSMU (One Source Multi Use) N-screen service through P2P streaming in the seamless D-MAC protocol, a ATMT (Asynchronous Traffic Multi-hop Transmission) technology is proposed and analyzed. In this system, a WiMedia ATMT D-MAC bridge transmits control and managing information to various sensors and instruments, from a central integrated ship area network station. For this technology, a time slot allocation scheme for WiMedia asynchronous traffic and a multi-hop resource reservation scheme are combined to evaluate the performance of each scheme. From simulation results, the proposed ATMT scheme enhances performances in viewpoints of N-screen asynchronous data latency and throughput, compared to the conventional WiMedia D-MAC system.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.518-531
• /
• 2004

This paper discusses a testbed architecture for implementing scalable service differentiation in the Internet. The differentiated services (DiffServ) testbed architecture is based on a model in which a bandwidth broker (BB) can control network resources, and the ALTQ can reserve resources in a router to guarantee a Quality of Service (QoS) for incoming traffic to the testbed. The reservation and releasemessage for the ALTQ is contingent upon a decision message in the BE. The BB has all the information in advance, which is required for a decision message, in the form of PIB. A signaling protocol between the BB and the routers is the COPS protocol proposed at the IETF. In terms of service differentiation, a user should make an SLA in advance, and reserve required bandwidth through an RAR procedure. The SLA and RAR message between a user and the BB has implemented with the COPS extension which was used between a router and the BB. We evaluates the service differentiation for the video streaming in that the EF class traffic shows superb performance than the BE class traffic where is a network congestion. We also present the differentiated service showing a better packet receiving rate, low packet loss, and low delay for the EF class video service.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.781-792
• /
• 2005

This study proposes an Architecture for user level End-to-end Quality of Service(QoS) using overlay In Next Generation Network(NGN). Inexisting NGNs, the IMS of a control plane provides user QoS through direct traffic control and resource-reservation over the IP packet transport network of a user plane. Further, a set of torrent studies are ongoing not only to maximize the QoS for users, but also to minimize the quality deterioration for supporting the user End-to-end QoS. Along with that, an extended QoS in user level must be considered, for Instance, differentiating service quality to support users' expectation, providing optimized contents by users' equipments, and so forth. Accordingly, the Overlay Service Network Architecture proposed by this study provides protocol adaptation for maximum throughput on transport layer by using the most efficient transport layer protocol to various network circumstances. Also, the Overlay Service Network Architecture on application layer distributes processing delay from the data transformation process of the user equipment to the network, and it is capable of intermediate processing depending on user service level. application service feature, and equipment circumstance as well. Thus, this study mainly proposes the Overlay Service Network Architecture for user level end-to-end QoS in NGN with the quality control features both on the transport layer and the application layer, an internal component feature, and a service scenario providing the QoS linking with 3GPP.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.4
• /
• pp.430-440
• /
• 2000

To support Integrated Services in the Internet, the Internet Engineering Task Force(IETF) has developed new mechanisms. These new mechanisms include Resource Reservation Protocol(RSVP) and Integrated Services model. RSVP and Integrated Services are independent of the underlying link layer technologies and it is necessary to define the mapping of RSVP and Integrated Services specifications onto specific link layer technologies. IETF proposed a Subnet Bandwidth Manager(SBM) providing a method for mapping RSVP onto IEEE802 style networks. However, the SBM has several constraints and problems. For solving these constraints and problems, we design and implement a new Ethernet Bandwidth Manager(EBM). This paper discusses (1) new bandwidth management mechanism independent of RSVP, (2) simulation of Ethernet bandwidth to analyze the characteristics of Ethernet and accomplish Ethernet bandwidth management, (3) design and implemetation of EBM that allows Controlled-Load Service, and (4) results of our experiments on EBM.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.510-513
• /
• 2006

Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing we consider, in this paper, how to efficiently support applications such as variable Geocasting basd on Ad-hoc networks. The goal of a geocasting protocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast service in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the mobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance than previous research.