• Title/Summary/Keyword: Service Quality of Network

Search Result 1,741, Processing Time 0.028 seconds

Design of QoS Manager related in Radio Resource Allocation within All-IP Network (All-IP 망에서 무선 자원 할당과 연계된 QoS 관리자의 설계)

  • Go, Hui-Chang;Wang, Chang-Jong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8S
    • /
    • pp.2722-2728
    • /
    • 2000
  • 현재의 인터넷 망을 이용하여 음성, 화상 정보를 실시간으로 이용하고자 하는 다양한 응용이 시도되고 있다. 차세대 통신으로 주목 받고 있는 IMT-2000에서도 기존의 회선 교환망 대신 인터넷 망을 이용함으로써 경제성, 관리의 편의성, 새로운 서비스의 창출이 가능한 등의 이점이 있다. 인터넷 망이 최선의 노력(best effort)만을 제공하기 때문에 발생되는 신뢰성과 지연의 문제는 이미 많은 연구가 있어왔고 현재 어느 정도의 서비스 품질을 획득하여 VoIP(Voice Over Internet Protocol)와 같은 서비스가 실제로 이용되고 있다. 그러나 무선 통신의 경우는 이에 더하여 무선 구간에서의 자원 할당의 문제가 남아 있다. 본 연구에서는 코어 망으로 인터넷 프로토콜을 사용하는 차세대 All-IP 망에서, 무선 이동단말 간의 멀티미디어 서비스가 가능하도록 효율적인 주파수 할당을 지원하는 QoS 관리자를 설계하였다. 제안한 QoS(Quality Of Service)관리자는 요구 대역폭이 다른 멀티미디어 호 요청에 대해 융통성 있는 주파수 할당이 가능하도록 대국의 QoS 관리자와의 협상을 통해 제한된 범위 내에서 서비스 품질을 조절하여 보다 많은 호 연결 요청이 성공할 수 있도록 한다.

  • PDF

Power Control in RF Energy Harvesting Networks (무선 에너지 하비스팅 네트워크에서의 전력 제어 기법)

  • Hwang, Yu Min;Shin, Dong Soo;Kim, Jin Young
    • Journal of Satellite, Information and Communications
    • /
    • v.12 no.2
    • /
    • pp.51-55
    • /
    • 2017
  • This paper aims to maximize the energy harvesting rate and channel capacity in RF-energy harvesting networks (RF-EHNs) under the constraints of maximum transmit power and minimum quality of service (QoS) in terms of rate capacity for each user. We study a multi-user RF-EHN with frequency division multiple access (FDMA) in a Rayleigh channel. An access point (AP) simultaneously transmitting wireless information and power in the RF-EHN serves a subset of active users which have a power-splitting antenna. To gauge the network performance, we define energy efficiency (EE) and propose an optimization solution for maximizing EE with Lagrangian dual decomposition theory. In simulation results, we confirm that the EE is effectively maximized by the proposed solution with satisfying the given constraints.

Performance Analysis of Mobile Internet System in Inter-cell Interference Environment (인접 셀 간섭 환경에서 모바일 인터넷 시스템의 성능 분석)

  • Roh, Jae-Sung;Kim, Young-Chul
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.1
    • /
    • pp.96-102
    • /
    • 2012
  • The goal of mobile internet system is to provide a high-data-rate, low-latency and optimized packet radio access technology supporting flexible bandwidth deployments. Therefore, network architecture is designed with the goal to support packet-switched traffic with seamless mobility, quality of service and minimal latency. An important requirement for the mobile internet system is improved cell-edge BER performance and data throughput. This is to provide some level of service consistency in terms of geographical coverage as well as in terms of available data throughput within the communication coverage area. In a cellular system, however, the signal to interference plus noise power ratio gap between cell-center and cell-edge users can be of the order of 20 [dB]. The disparity can be even higher in a communication coverage limited cellular system. This leads to vastly lower data throughputs for the cell-edge users relative to cell-center users creating a large QoS gap. This paper proposes a analytical approach that tries to reduce inter-cell interference, and shows the SIR and BER performance according to the OFDM system parameters in mobile Internet environment.

An Agent-based Approach for Distributed Collaborative Filtering (분산 협력 필터링에 대한 에이전트 기반 접근 방법)

  • Kim, Byeong-Man;Li, Qing;Howe Adele E.;Yeo, Dong-Gyu
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.11
    • /
    • pp.953-964
    • /
    • 2006
  • Due to the usefulness of the collaborative filtering, it has been widely used in both the research and commercial field. However, there are still some challenges for it to be more efficient, especially the scalability problem, the sparsity problem and the cold start problem. In this paper. we address these problems and provide a novel distributed approach based on agents collaboration for the problems. We have tried to solve the scalability problem by making each agent save its users ratings and broadcast them to the users friends so that only friends ratings and his own ratings are kept in an agents local database. To reduce quality degradation of recommendation caused by the lack of rating data, we introduce a method using friends opinions instead of real rating data when they are not available. We also suggest a collaborative filtering algorithm based on user profile to provide new users with recommendation service. Experiments show that our suggested approach is helpful to the new user problem as well as is more scalable than traditional centralized CF filtering systems and alleviate the sparsity problem.

A Study to Enhance Competitive Advantage on Sea & Air Intermodal Transport System of Incheon (인천지역 해공복합운송시스템(Sea & Air)의 경쟁우위 확보방안)

  • Chung, Tae-Won
    • Journal of Navigation and Port Research
    • /
    • v.31 no.8
    • /
    • pp.733-739
    • /
    • 2007
  • Demand for Sea & Air intermodal transport has increased between north-China costal cities and Incheon since China's international airline network was not established completely. It will be big opportunity for Incheon to be logistics hub of Sea & Air intermodal transport in the north-east Asia, musing large sea-air cargoes to be transferred at the port of Incheon. Therefore, this study aims to propose competitive strategy on Sea & Air intermodal transport system of Incheon. In this analysis results, this paper shows that sea & air cargoes rather from china to U.S. than from China to Europe is very significant, considering geographically for Incheon and is also devote to not only providing high quality services but also activating RFS(Road Feeder Service) system, enlarging toward Shanghai, Weihai, and Yantai.

Resource Allocation and Control System for VoIP QoS Provision in Cognitive Radio Networks (인지 무선네트워크에서 VoIP QoS 보장을 위한 자원 할당 및 제어 시스템)

  • Kim, Bosung;Lee, Gyu-Min;Roh, Byeong-Hee;Choi, Geunkyung;Oh, Ilhyuk
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.12
    • /
    • pp.688-693
    • /
    • 2014
  • With the advent of ubiquitous environments, the smart phone has come into wide use and the demand for various content increases. Thus, in order to efficiently utilize limited resources cognitive radio technology is regarded as a possible solution. Besides spectrum sensing or access schemes, the provision of VoIP traffic service for secondary users with limited spectrum resources is a very important issue. In this paper, a resource allocation and control system for VoIP QoS provision in cognitive radio networks is proposed. Firstly, as the system model, the time structure of the network is addressed and, according to the structure, a bandwidth broker is proposed. In addition, based on available bandwidth estimated by the bandwidth broker, a connection admission control for secondary users is developed. It is demonstrated that the provision of VoIP QoS is greatly affected by channel utilization, the number of channels, and the length of timeslot.

A Resource Reservation Method with Available Resource Migration between RSVP-Capable Routers to Improve the Resource Utilization (RSVP-라우터간 가용자원 이동을 통해자원 이용 효율을 높이는 자원예약 방식)

  • Kim, Tae-Joon
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.253-262
    • /
    • 2008
  • Providing Quality-of-Service (QoS) guarantee requires the reservation of resource needed to accommodate the traffic flow of service for which resource reservation protocol (RSVP) was introduced. However, if any RSVP-capable router on the path fails to accommodate the traffic flow due to lack of resource, the flow is not allowed no matter how much surplus resources other routers on the path have. In order to solve this problem, this paper proposes a resource reservation method with available resource migration between RSVP-capable routers in which the routers use the recently developed latency optimized fair queuing scheduler. The results of the simulation applying the proposed method to an evaluation network show that it may yield the gain of up to 165% compared to that in the original one in terms of the number of admitted flows.

Robust Inter-MAP Binding Update Scheme in HMIPv6 (HMIPv6 네트워크에서 Robust 한 Inter-MAP 바인딩 업데이트 기법)

  • Jinwook Park;Jongpil Jeong;Hyunseung Choo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1387-1390
    • /
    • 2008
  • In a wireless network, handover latency is very important in supporting user mobility with the required quality of service (QoS). In view of this many schemes have been developed which aim to reduce the handover latency. The Hierarchical Mobile IPv6 (HMIPv6) approach is one such scheme which reduces the high handover latency that arises when mobile nodes perform frequent handover in Mobile IPv6 wireless networks. Although HMIPv6 reduces handoff latency, failures in the mobility anchor point (MAP) results in severe disruption or total disconnection that can seriously affect user satisfaction in ongoing sessions between the mobile and its correspondent nodes. HMIPv6 can avoid this situation by using more than one mobility anchor point for each link. In [3], an improved Robust Hierarchical Mobile IPv6 (RH-MIPv6) scheme is presented which enhances the HMIPv6 method by providing a fault-tolerant mobile service using two different MAPs (Primary and Secondary). It has been shown that the RH-MIPv6 scheme can achieve approximately 60% faster recovery times compared with the standard HMIPv6 approach. However, if mobile nodes perform frequent handover in RH-MIPv6, these changes incur a high communication overhead which is configured by two local binding update units (LBUs) as to two MAPs. To reduce this communication overhead, a new cost-reduced binding update scheme is proposed here, which reduces the communication overhead compared to previous schemes, by using an increased number of MAP switches. Using this new proposed method, it is shown that there is a 19.6% performance improvement in terms of the total handover latency.

Channel Allocation Using Mobile Station Network in Reproduction Stage (이동통신망에서 재생산 단계를 적용한 채널할당)

  • Heo, Seo-Jung;Son, Dong-Cheol;Kim, Chang-Suk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.5
    • /
    • pp.577-582
    • /
    • 2012
  • If the mobile station requests the channel allocation in mobile networks, switching center is assigned a channel to mobile station that belong to each base station. Channel allocation schemes is a fixed channel allocation, dynamic channel allocation and a hybrid approach that combines the two forms. To assign a frequency well to use resources efficiently to provide quality service to our customers. In this paper, we proposed method to assign frequencies to minimize interference between channels and to minimizes the number of searching time. The proposed method by the genetic algorithm to improve accuracy and efficiency of the verification steps and reproduction stages were used. In addition, the proposed method by comparing with other methods showed that proposed method is better through the simulations.

Resource scheduling scheme for 5G mmWave CP-OFDM based wireless networks with delay and power allocation optimizations

  • Marcus Vinicius G. Ferreira;Flavio H. T. Vieira;Alisson A. Cardoso
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.45-59
    • /
    • 2023
  • In this paper, to optimize the average delay and power allocation (PA) for system users, we propose a resource scheduling scheme for wireless networks based on Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) according to the first fifth-generation standards. For delay minimization, we solve a throughput maximization problem that considers CPOFDM systems with carrier aggregation (CA). Regarding PA, we consider an approach that involves maximizing goodput using an effective signal-to-noise ratio. An algorithm for jointly solving delay minimization through computation of required user rates and optimizing the power allocated to users is proposed to compose the resource allocation approach. In wireless network simulations, we consider a scenario with the following capabilities: CA, 256-Quadrature Amplitude Modulation, millimeter waves above 6 GHz, and a radio frame structure with 120 KHz spacing between the subcarriers. The performance of the proposed resource allocation algorithm is evaluated and compared with those of other algorithms from the literature using computational simulations in terms of various Quality of Service parameters, such as the throughput, delay, fairness index, and loss rate.