• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.1
• /
• pp.35-40
• /
• 2019

It is important to constantly provide service in real-time multimedia applications using multicast. Transmission path reconstruction occurs in hybrid multicast using Internet Protocol (IP) multicast and ALM in order to adapt the network status to things like congestion. So, there is a problem in which real-time QoS is reduced, caused by an increase in end-to-end delay. In this paper, we want to solve this problem through multi-layer transmission path construction. In the proposed method, we deploy the control server and application layer overlay host (ALOH) in each multicast domain (MD) for hybrid multicast construction. After the control server receives the control information from an ALOH that joins the MD, it makes a group based on the hop count and sends it to the ALOH in each MD. The ALOH in the MD performs the role of sending the packet to another ALOH and constructs the multi-layered transmission path in order of priority by using control information that is received from the control server and based on the delay between neighboring ALOHs. When congestion occurs in, or is absent from, the ALOH in the upper MD, the ALOH selects the path with the highest priority in order to reduce end-to-end delay. Simulation results show that the proposed method could reduce the end-to-end delay to less than 289 ms, on average, under congestion status.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.956-966
• /
• 2004

Nowadays, NGN(Next Generation Network) is evolving into network with packet based QoS.\ulcorner This paper presents the recovery method as a selecting way of more efficient path in MPLS network that reduces the service interruption time. In order to increase the efficiency of usage of recovering resource which is one of major functions of disorder recovering, it opens the state information of each Node both to fault detector and bandwidth broker so that it reduces message transmission time for recovery when functional disorder occurs. in addition, by effective management and adjustment of required bandwidth of entire network depending on the changes of traffic load, it improves the efficiency of bandwidth usage. and in MPLS network supporting priority selection function, it allocates domains depending on the traffic relating to priority order to the entire network so that\ulcorner it efficiently allocates proper resources to the restoring process between the entry and the end for the traffic of high priority and for low priority traffic, it restores path oかy inside disordered domain. by doing this, it reduces resetting time and unnecessary massage transmission.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.9-16
• /
• 2005

A new online routing algerian is proposed in this paper, which use the interference-prediction to solve the network congestion originated from extension of Internet scope and increasing amount of traffic. The end-to-end QoS has to be guaranteed in order to satisfy service level agreements (SLAs) in the integrated networks of next generation. For this purpose, bandwidth is allocated dynamically and effectively, moreover the path selection algorithm is required while considering the network performance. The proposed algorithm predicts the level of how much the amount of current demand interferes the future potential traffic, and then minimizes it. The proposed algorithm considers the bandwidth on demand, link state, and the information about ingress-egress pairs to maximize the network performance and to prevent the waste of the limited resources. In addition, the interference-prediction supports the bandwidth guarantee in dynamic network to accept more requests. In the result, the proposed algorithm performs the effective admission control and QoS routing. In this paper, we analyze the required conditions of routing algorithms, the aspect of recent research, and the representative algorithms to propose the optimized path selection algorithm adequate to Internet franc engineering. Based on these results, we analyze the problems of existing algorithms and propose our algorithm. The simulation shows improved performance by comparing with other algorithms and analyzing them.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.6
• /
• pp.203-210
• /
• 2013

Majority of the wireless ad hoc routing protocols are proposed to find feasible routes without considering the network load, end-to-end link quality and bandwidth requirements of the application. Therefore, protocol may not provide sufficient quality of service (QoS) to a high speed traffic such as multimedia. In this paper, we propose a path-quality and bandwidth-estimation based routing protocol (PBBR) for the high quality multimedia stream that can meet the application's bandwidth requirements and find the best reliable route. The novelty of this protocol is to select a reliable path to respond the application's requirements based on available bandwidth at each intermediate node and end-to-end path loss ratio. Obtained results from the simulation demonstrates that our protocol can achieve sufficient performance in terms of throughput and end-to-end delay.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.139-148
• /
• 2005

The desired level for multimedia services in the mobile web environment, the next generation web environment, is expected to be of PC level quality. And great efforts have been made in the development of hadware technology, communication technology, various kinds of services and standardization to support these services, In the mobile web environment, multimedia contents adaptation services should be available through supporting various kinds of devices, network abilities and users' preferences. It means that due to the variety of both desired devices' hardware specifications, called destinations, and desired QoSes, the QoSes in the destinations are not fixed or defined. If a new user wants to stream multimedia contents in a server through a new kind of terminal device, it should be considered whether the existing transcoders are able to adapt the multimedia contents. However, the existing libraries for multimedia adaptation have heavy transcoder figures which include all adaptive functions in one library, The challenge of universal access is too complex to be solved with these all in one solutions. Therefore, in this paper we propose an application independent multimedia adaptation framework which meets the QoS of new and varied mobile devices. This framework is composed of a group of unit transcoders having only one transcoding function respectively, Instead of heavy transcoders. Also, It includes the transcoder manager supporting the dynamic connections of the unit transcoders in order to satisfy end to end QoS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.620-629
• /
• 2012

This paper proposes packet aggregation scheme for considering energy consumption of mobile devices on guaranteeing quality of voice. To our purpose, we analyze VoIP service on wireless multi-hop channel in terms of delay, packet loss and energy consumption when packet aggregation scheme is applied to VoIP service. Moreover, we induce a cost function with considering of tradeoff relation between quality of voice and energy consumption.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3723-3731
• /
• 2000

Recently, the growth of applications and services over high-speed Internet increase, ATM networks as wide area back-bone has been a major solution. The conventional TCP suite is still the standard protocol used to support upper application on current Internet and uses a window based protocol for flow control in the transport layer. When TCP data uses the UBR service in ATM layer, the control method is also buffer management. If a cell is discarded in ATM layer. one whole packet of TCP will be lost. Which is responsible for most TCP performance degradation and do not offer sufficiently QoS. To solve this problem, Several dropping strategies, such as Tail Drop, EPD, PPO, SPD, FBA, have been proposed to improve the TCP performance over ATM. In this paper, to improve the TCP fairness of end to end, we propose a packet dropping scheme algorithm using two fixed threshold. Under similar condition, we compared our proposed scheme with other dropping strategies. Although the number of VC is increased, simulation results showed that the proposed scheme can allocate more fairly each VC than other schemes.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.1
• /
• pp.85-94
• /
• 2002

EMRCA(Explicit Max_min Rate Control Algorithm) switch, which has been proposed in the ATM(Asychronous Transfer Mode) standard, controls the ABR(Available Bit Rate) service traffic in the ATM networks. The ABR service class of ATM networks uses a feedback control mechanism to adapt to varying link capacities. The VS/VD(Virtual Source/Virtual Destination) technique offers the possibility to segment the otherwise end-to-end ABR control loop into separate loops. The improved feedback delay and the control of ABR traffic inside closed segments provide a better performance and QoS(Quality of Service) for ABR connections with respect to throughput, delay, and jitter. This paper is study of an ABR VS/VD flow control method. Linear control theory offers the means to derive correct choices of parameters and to assess performance issues, like stability of the system, during the design phase. The performance goals are a high link utilization, fair bandwidth distribution and robust operation in various environments, which are verified by discrete event simulations. The major contribution of this work is the use of linear control theory to model and design an ABR flow control method tailored for the special layout of a VS/VD switch, the simulation shows that this techniques better than conventional method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.53-63
• /
• 1999

ATM 네트워크에서 다양한 트래픽을 특성과 QoS 요구사항을 갖는 멀티미디어 서비스의 종단간 품질을 만족시키면서 망 자원을 효율적으로 이용하기 위해서는 가상경로(virtual path : VP) 의 적절한 배치 및 대역 할당을 통한 논리적 망의 구성, 호 접속 시의 종적 경로 설정, 그리고 그와 연계된 효율적인 동적 대역 관리가 필수적으로 요구된다. 본 논문에서는 새로운 호가 시도될 때 논리적 망의 설계에서 설정된 가상경로의 대역으로 호의 품질 요구사항을 만족 시킬수 없거나 또는 미리 설정해 놓은 가상경로연결(VP Connection) 이 존재하지 않을 경우에 물리적 링크의 잔여용량을 기반으로 적절한 가상경로를 선택하여 용량을 재조정하기 위한 최적 관리 모델로서 MHR (Minimum Hop Route), MCR(Maximum Capacity Route), 그리고 MRCR (MaxMin Residual Capacity Route)방식을 제안하고 이에 대한 최적화 정식을 제안하였다. 제안된 각 최적화 모델에 대한 해를 노드의 수가 m인 네트워크에서 O(m2)의 복잡도로 구할 수 있는 알고리즘을 제시하고 시뮬레이션을 통해 제안된 최적화 모델이 망의 성능에 미치는 영향을 평균 호 차단률 평균 이용 링크의 수 , 그리고 노드 쌍간의 호 차단률의 분산등에 의해 망 운용의 효율성과 공평성등을 비교분석하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1285-1287
• /
• 2009

VoIP 통신에서 단말간의 세션을 수립하고 종료하는 역할을 하는 SIP는 기본적으로 서버-클라이언트 방식으로 이루어져있다. 하지만 이는 확장성과 설치비용, 단일실패 지점 측면에서 큰 단점을 갖는다. 최근에 DHT를 이용한 구조적인 P2P를 SIP와 결합하여 위의 단점들을 극복하기 위한 연구들이 활발히 진행되고 있다. 하지만 DHT를 이용한 방식은 기존 서버-클라이언트 방식에 비해 검색지연이 늘어난다는 큰 단점을 가지고 있다. 검색지연은 SIP에서 QoS의 중요한 지표중 하나인 호 설정 지연에 60~80% 정도의 큰 영향을 미치게 되므로 해결해야할 중요한 문제이다. P2PSIP에서는 종단 노드가 검색한 사용자의 주소를 캐싱하여 같은 사용자를 재 검색시에 사용하고 있다. 이는 네트워크 전체 오버헤드 감소에 큰 영향을 주지 못할뿐만 아니라 발생된 검색비용을 자신만이 사용할 수 있으므로 비효율적이다. 이에 본 논문에서는 도메인으로 구분된 계층적 P2PSIP네트워크에서 프록시 서버의 역할을 하는 슈퍼노드를 이용한 효과적인 캐싱 방법을 이용하여 호 설정 지연을 단축할 수 있는 방안을 제안하다.