• 한국정보통신학회논문지
• /
• 제6권2호
• /
• pp.236-247
• /
• 2002

ATM망에서 큐 서비스 방식에서는 상위 프레임과 하위 프레임을 따로 정의하여 대역폭 할당과 전송 지연 보장을 분리할 수 있기 때문에 종단간 전송한계에서 QoS를 보장 할 수 있는 단순화한 큐 서비스 구현을 제안하였다. 제안한 큐 서비스 방식은 실시간 트래픽과 비실시간 트래픽을 나누어 저장하기 때문 에 연결별 트래픽 조절기 없이도 지연 지터 특성이 개선되었다. 제안된 큐 서비스 방식을 이용하여 연결 수락 제어는 트래픽 왜곡의 영향을 계산할 수 없는 트래픽 왜곡의 영향이 실재로 존재한다는 가정 하에 트래픽 왜곡에 대한 영향에 종단간 지연을 보장함으로 서 연결 수락 가능 범위를 다양한 프레임의 길이에 대해 나타내었으며, 프레임의 길이가 클수록 제안된 큐 서비스 방식의 연결 수 락 범위가 지연 EDD방식과 비교해서 많은 차이를 보이지만 프레임의 길이를 점차 줄여갈수록 연결 수락 가능 범위가 지연 EDD 방식에 근접함을 나타내었다.

• 인터넷정보학회논문지
• /
• 제22권5호
• /
• pp.9-16
• /
• 2021

Recently, the traffic volume of mobile communications increases rapidly and the small-cell is one of the solutions using two offload schemes, i.e., local IP access (LIPA) and selected IP traffic offload (SIPTO), to reduce the end-to-end delay and amount of mobile data traffic in the core network (CN). However, 3GPP describes the concept of LIPA and SIPTO and there is no decision algorithm to decide the path from source nodes (SNs) to destination nodes (DNs). Therefore, this paper proposes a dynamic mobile data traffic offload scheme using small-cells to decide the path based on the SN and DN, i.e., macro user equipment, small-cell user equipment (SUE), and multimedia server, and type of the mobile data traffic for the real-time and non-real-time. Through analytical models, it is shown that the proposed offload scheme outperforms the conventional small-cell network in terms of the delay of end-to-end mobile data communications and probability of the mobile data traffic in the CN for the heterogeneous networks.

• Journal of Communications and Networks
• /
• 제10권3호
• /
• pp.351-361
• /
• 2008

This paper presents a delay-margin based traffic engineering (TE) approach to provide end-to-end quality of service (QoS) in multi-protocol label switching (MPLS) networks using differentiated services (DiffServ) at the link level. The TE, including delay, class, and route assignments, is formulated as a nonlinear optimization problem reflecting the inter-class and inter-link dependency introduced by DiffServ and end-to-end QoS requirements. Three algorithms are used to provide a solution to the problem: The first two, centralized offline route configuration and link-class delay assignment, operate in the convex areas of the feasible region to consecutively reduce the objective function using a per-link per-class decomposition of the objective function gradient. The third one is a heuristic that promotes/demotes connections at different links in order to deal with concave areas that may be produced by a trunk route usage of more than one class on a given link. Approximations of the three algorithms suitable for on-line distributed TE operation are also derived. Simulation is used to show that proposed approach can increase the number of users while maintaining end-to-end QoS requirements.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2509-2528
• /
• 2012

Time division multiple access (TDMA) is a widely used media access control (MAC) technique that can provide collision-free and reliable communications, save energy and bound the delay of packets. In TDMA, energy saving is usually achieved by switching the nodes' radio off when such nodes are not engaged. However, the frequent switching of the radio's state not only wastes energy, but also increases end-to-end delay. To achieve high energy efficiency and low delay, as well as to further minimize the number of time slots, a multi-objective TDMA scheduling problem for industrial wireless mesh networks is presented. A hybrid algorithm that combines genetic algorithm (GA) and simulated annealing (SA) algorithm is then proposed to solve the TDMA scheduling problem effectively. A number of critical techniques are also adopted to reduce energy consumption and to shorten end-to-end delay further. Simulation results with different kinds of networks demonstrate that the proposed algorithm outperforms traditional scheduling algorithms in terms of addressing the problems of energy consumption and end-to-end delay, thus satisfying the demands of industrial wireless mesh networks.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.286-286
• /
• 2006

• 한국정보과학회논문지:정보통신
• /
• 제31권6호
• /
• pp.608-619
• /
• 2004

IP 멀티캐스트가 현재 보편적 네트웍 서비스로 제공되지 못하고 있는 현실적인 한계로 인하여, 다중 수신자를 지원하기 위한 대안으로 응용 계층 멀티캐스트 기법들이 주목을 받고 있다. 응용 계층 멀티캐스트는 데이타의 전송이 참가자인 종단 시스템에 의해 이루어진다. 그러나 종단 시스템은 범용 장비이기 때문에 데이타 전달에 최적화되어 있지 않고, 응용 계층 멀티캐스트 세션에 참여하는 종단 시스템들의 컴퓨팅 능력과 네트워크 대역폭이 다양하기 때문에, 종단 시스템의 성능에 따라 처리 지연 시간이 발생하게 되어 종단 간 지연 시간에 영향을 끼치게 된다. 본 논문은 응용 계층 멀티캐스트 세션에 참여하는 종단 시스템에서의 지연 시간을 모델링하고 기존의 응용 계층 멀티캐스트의 성능에 미치는 영향을 분석한다. 나아가, 종단 시스템에서의 지연과 이들의 다양성을 고려하여 메쉬 기반의 응용 계층 멀티캐스트 세션 성능 향상 기법을 제안하고 이에 대한 성능 평가에서 제안하는 기법이 기존의 기법에 비해 종단 간 지연 시간을 감소시키는 것을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• 대한전자공학회논문지TC
• /
• 제39권4호
• /
• pp.180-187
• /
• 2002

화상회의와 같은 실시간 멀티미디어 응용들은 종단간 엄격한 지연시간 준수를 요구하며 많은 네트워크 자원을 소비한다. 이러한 응용들의 효율적 관리를 위해 멀티캐스트 프로토콜은 주어진 종단간 지연시간을 만족하면서 멀티캐스트 트리의 비용을 최소화하는 라우팅 알고리즘을 필요로 한다. 하지만 그런 트리를 찾는 문제는 계산비용이 매우 높다고 알려져 있다. 그러므로 본 논문에서는 주어진 종단간 지연시간을 만족하는 멀티캐스트 트리를 찾는 계산비용을 감소하면서 트리의 평균 비용을 최소화하는 휴리스틱 분산형 멀티캐스트 라우팅 알고리즘을 제시한다. 또한 시뮬레이션을 통해 제시한 알고리즘이 기존 알고리즘에 비해 트리의 평균 비용 측면에서 우수함을 보인다.

• 한국정보통신학회논문지
• /
• 제25권9호
• /
• pp.1267-1270
• /
• 2021

In this paper, we propose a distributed routing algorithm for mobile ad hoc networks (MANET) where mobile devices can be utilized as relays for communication between remote source-destination nodes. The objective of the proposed algorithm is to minimize the end-to-end communication delay caused by transmission failure with deep channel fading. In each hop, the node needs to select the next relaying node by considering a tradeoff relationship between the link stability and forward link distance. Based on such feature, we formulate the problem with partially observable Markov decision process (MDP) and apply deep reinforcement learning to derive effective routing strategy for the formulated MDP. Simulation results show that the proposed algorithm outperforms other baseline schemes in terms of the average end-to-end delay.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.434-442
• /
• 2012

Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.