• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권7호
• /
• pp.1252-1273
• /
• 2011

In Web Service Composition (WSC) area, services selection aims at selecting an appropriate candidate from a set of functionally-equivalent services to execute the function of each task in an abstract WSC according to their different QoS values. In despite of many related works, few of previous studies consider transactional constraints in QoS-aware WSC, which guarantee reliable execution of Composite Web Service (CWS) that is composed by a number of unpredictable web services. In this paper, we propose a novel global selection-optimal approach in WSC by considering both transactional constraints and end-to-end QoS constraints. With this approach, we firstly identify building rules and the reduction method to build layer-based Directed Acyclic Graph (DAG) model which can model transactional relationships among candidate services. As such, the problem of solving global optimal QoS utility with transactional constraints in WSC can be regarded as a problem of solving single-source shortest path in DAG. After that, we present Graph-building algorithms and an optimal selection algorithm to explain the specific execution procedures. Finally, comprehensive experiments are conducted based on a real-world web service QoS dataset. The experimental results show that our approach has better performance over other competing selection approaches on success ratio and efficiency.

• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• 한국통신학회논문지
• /
• 제31권3B호
• /
• pp.207-215
• /
• 2006

모바일 환경에서 현재의 MIP 기반 핸드오버 기법은 여러 문제점을 가지고 있어 끊김 없는 서비스를 제공하는데 한계가 있는 것으로 알려져 있다. 최근 MIP기반 핸드오버 기법에서 좀 더 효과적인 QoS를 제공하기 위해 MRSVP, HMRSVP 등 여러 연구가 진행되었지만 MIP 기반 모바일 환경 자체가 가진 근본적인 여러 문제 때문에 QoS 관련 연구의 한계를 가질 수밖에 없다. 본 논문에서는 모바일 환경에서 이동 중 QoS를 제공하기 위해 이동성 SCTP 기반의 핸드오버 기법에서 종단 간 QoS 제공기법인 IntServ를 도입하는 메커니즘과 효율적인 경로관리를 고려한 QoS 제공 방안을 제안하고자 한다. 제안된 기법은 모바일 노드의 이동으로 빈번히 일어나는 핸드오버 시마다 종 단간 예약을 다시 해야 하는 예약비용을 줄이기 위해 중복되는 경로 지점을 찾아 새로운 부분만 다시 예약하는 기법에 대한 것이다. 또한 SCTP 기반의 RSVP와 MIP 기반의 RSVP에 대한 문제 분석과 해결방안을 제안하고 예약비용 분석을 통해 비용 절감효과의 타당성을 평가검증 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.618-633
• /
• 2014

Relay technology is becoming more important for mobile communications and wireless internet of things (IoT) networking because of the extended access network coverage range and reliable quality of service (QoS) it can provide at low power consumption levels. Existing mobile multihop relay (MMR) technology uses fixed-point stationary relay stations (RSs) and a divided time-frame (or frequency-band) to support the relay operation. This approach has limitations when a local fixed-point stationary RS does not exist. In addition, since the time-frame (or frequency-band) channel resources are pre-divided for the relay operation, there is no way to achieve high channel utilization using intelligent opportunistic techniques. In this paper, a different approach is considered, where the use of mobile/IoT devices as RSs is considered. In applications that use mobile/IoT devices as relay systems, due to the very limited battery energy of a mobile/IoT device and unequal channel conditions to and from the RS, both minimum energy consumption and QoS support must be considered simultaneously in the selection and configuration of RSs. Therefore, in this paper, a mobile RS is selected and configured with the objective of minimizing power consumption while satisfying end-to-end data rate and bit error rate (BER) requirements. For the RS, both downlink (DL) to the destination system (DS) (i.e., IoT device or user equipment (UE)) and uplink (UL) to the base station (BS) need to be adaptively configured (using adaptive modulation and power control) to minimize power consumption while satisfying the end-to-end QoS constraints. This paper proposes a minimum transmission power consuming RS selection and configuration (MPRSC) scheme, where the RS uses cognitive radio (CR) sub-channels when communicating with the DS, and therefore the scheme is named MPRSC-CR. The proposed MPRSC-CR scheme is activated when a DS moves out of the BS's QoS supportive coverage range. In this case, data transmissions between the RS and BS use the assigned primary channel that the DS had been using, and data transmissions between the RS and DS use CR sub-channels. The simulation results demonstrate that the proposed MPRSC-CR scheme extends the coverage range of the BS and minimizes the power consumption of the RS through optimal selection and configuration of a RS.

• 정보처리학회논문지D
• /
• 제19D권4호
• /
• pp.299-306
• /
• 2012

웹 서비스 합성은 기존 단일 서비스들을 합성해서 제공하는 방식으로, 사용자의 다양한 요구를 만족시키기 위해서 새로운 웹 서비스를 만들기보다는 재사용과 효율성 측면에서 고려되고 있다. 그러나 유사 기능을 제공하지만 다른 서비스 품질을 제공하는 서비스의 수가 증가함에 따라, 서비스 합성 문제는 사용자의 전역 제약 조건과 합성서비스의 QoS를 만족시키기 위해서 어떤 구성 서비스들을 선택해야 하는지에 대한 선택 문제가 되었다. 합성 서비스의 수행은 구성 서비스의 수행에 의해 결정되므로, 합성 서비스에 포함될 구성 서비스 선택을 위해서는 가격, 지속성, 응답시간과 같은 QoS에 대한 고려는 필수적이다. 본 논문에서는 합성 서비스 선택 시 QoS를 고려한 기법으로 합성 유전자 알고리즘을 적용하였다. 유전자 알고리즘에 지역 탐색 방법을 결합하여 빠른 시간 안에 합성 서비스의 전반적인 QoS뿐만 아니라 구성 서비스의 품질을 향상 시킬 수 있는 서비스 선택 기법을 제시한다. 본 연구는 실제 웹상에 존재하는 실제 데이터를 이용하여 서비스 증가에 따른 시간 측정 및 최적화 정도를 비교 분석을 통해 선택 알고리즘의 유효성을 검증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5174-5190
• /
• 2016

Recent years have witnessed an explosive growth of mobile devices, mobile cloud computing services offered by these devices and the remote clouds behind them. In this paper, we noticed ultra-low latency service, as a type of mobile cloud computing service, requires extremely short delay constraints. Hence, such delay-sensitive applications should be satisfied with strong QoS guarantee. Existing solutions regarding this problem have poor performance in terms of throughput. In this paper, we propose an end-to-end bandwidth resource reservation via software defined scheduling inspired by the famous SDN framework. The main contribution of this paper is the end-to-end resource reservation and flow scheduling algorithm, which always gives priority to delay sensitive flows. Simulation results confirm the advantage of the proposed solution, which improves the average throughput of ultra-low latency flows.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권6호
• /
• pp.2680-2696
• /
• 2018

The collaborative content caching system is an effective solution developed in recent years to reduce transmission delay and network traffic. In order to decrease the service end-to-end transmission delay for future 5G ultra-dense networks (UDN), this paper proposes a novel service migration method that can guarantee the continuity of service and simultaneously reduce the traffic flow in the network. In this paper, we propose a service migration optimization model that minimizes the cumulative transmission delay within the constraints of quality of service (QoS) guarantee and network condition. Subsequently, we propose an improved firefly algorithm to solve this optimization problem. Simulation results show that compared to traditional collaborative content caching schemes, the proposed algorithm can significantly decrease transmission delay and network traffic flow.

• 정보처리학회논문지C
• /
• 제17C권3호
• /
• pp.299-306
• /
• 2010

IPTV 및 VoIP 서비스는 높은 이동성과 전송 속도를 보장하는 Mobile WiMAX 네트워크 상에서 제공할 수 있는 유용한 응용 서비스들이다. IPTV의 오디오 전송이나 VoIP의 통화 품질에 영향을 미치는 요소 중 전송 경로의 잦은 변경이나 경로간 전송 시간의 차이에 따라 발생하는 지터에 의한 패킷 손실은 지터 버퍼를 이용하여 완화할 수 있다. 본 논문에서는 Mobile WiMAX 네트워크 상에서 이동 단말의 전력 소모 절감을 위해 사용되는 PSC-II 모드를 사용할 때의 오디오 및 음성 서비스의 품질(Quality of Service)과 지터 버퍼 크기의 상관관계에 대해 연구, 분석한다. 이를 위해 절전 모드 사용으로 인해 추가로 발생하는 지연 시간을 포함한 서비스의 종단간 지연시간 모델과 종단간 지연시간을 기준으로 한 서비스 품질 기준을 제시하였다. 또한, 제시한 모델의 다양한 파라미터에 따른 시뮬레이션 분석 결과를 통해 절전 모드를 사용할 경우에는 지터 버퍼의 크기 증가에 따른 지연으로 인한 패킷 손실이 오히려 오디오 및 VoIP 서비스 품질 측면에서 좋지 않은 영향을 미칠 수 있음을 보였다.