• Title/Summary/Keyword: quality-of-service, QoS

Search Result 1,469, Processing Time 0.03 seconds

A Study on an Efficient Routing Scheme for using a priority scheme in Wireless Sensor Networks (무선 센서 네트워크 환경에서 우선순위 기법을 이용한 효율적인 경로 설정에 대한 연구)

  • Won, Dae-Ho;Yang, Yeon-Mo
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.48 no.4
    • /
    • pp.40-46
    • /
    • 2011
  • Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

Challenges to Next Generation Services in IP Multimedia Subsystem

  • Chang, Kai-Di;Chen, Chi-Yuan;Chen, Jiann-Liang;Chao, Han-Chieh
    • Journal of Information Processing Systems
    • /
    • v.6 no.2
    • /
    • pp.129-146
    • /
    • 2010
  • The trend of Next Generation Networks' (NGN) evolution is towards providing multiple and multimedia services to users through ubiquitous networks. The aim of IP Multimedia Subsystem (IMS) is to integrate mobile communication networks and computer networks. The IMS plays an important role in NGN services, which can be achieved by heterogeneous networks and different access technologies. IMS can be used to manage all service related issues such as Quality of Service (QoS), Charging, Access Control, User and Services Management. Nowadays, internet technology is changing with each passing day. New technologies yield new impact to IMS. In this paper, we perform a survey of IMS and discuss the different impacts of new technologies on IMS such as P2P, SCIM, Web Service and its security issues.

Packet Scheduling with QoS and Fairness for Downlink Traffic in WiMAX Networks

  • Nie, Wei;Wang, Houjun;Park, Jong-Hyuk
    • Journal of Information Processing Systems
    • /
    • v.7 no.2
    • /
    • pp.261-270
    • /
    • 2011
  • The IEEE 802.16 standard is supposed to provide a wide-range broadband wireless service, but it leaves the implementation of the wireless resource scheduler as an open issue. We have studied the scheduling problem and propose a two level scheduling (TLS) scheme with support for quality of service and fairness guarantees for downlink traffic in a WiMAX network. A central controller Base Station has a number of users, and each mobile subscriber station has different channel conditions. The same mobile subscriber station may have different service requirements at different times in the WiMAX network. Based on OPNET simulation, the results show our scheduling algorithm can increase the network throughput, maintain relative fairness, and lower delay over the round robin and weighted round robin algorithms.

Feedback-Assisted Multipolling Scheme for Real-Time Multimedia Traffics in Wireless LANs (무선 LAN에서 실시간 멀티미디어 트래픽을 위한 피드백 기반의 다중폴링 방법)

  • Kim Sun-Myeng;Cho Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6B
    • /
    • pp.495-507
    • /
    • 2006
  • In wireless local area networks (WLANs), the successful design of scheduling algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a multipolling-based dynamic scheduling algorithm for providing delay guarantees to multimedia traffics such as MPEG streams. The dynamic algorithm exploits the characteristics of MPEG stream, and uses mini frames for feedback control in order to deliver dynamic parameters for channel requests from stations to the point coordinator (PC) operating at the access point (AP). In this scheme, the duration of channel time allocated to a station during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to conventional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

Design of Amplify-and-Forward Helper Stations for Cellular Networks with Device-to-Device Links (단말 간 직접 통신을 포함하는 셀룰러 망을 위한 증폭 후 전달 방식 조력국의 설계 방법)

  • Chung, Jihoon;Kim, Donggun;Sung, Youngchul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.5
    • /
    • pp.539-545
    • /
    • 2016
  • In this paper, the use of an amplify-and-forward (AF) helper station in a cellular network with device-to-device (D2D) communication links is considered to enhance D2D rates and control the interference caused by D2D users to the cellular network. Two design criteria for the AF helper station are considered to improve the overall system quality-of-service (QoS). One is maximization of the worst D2D user rate under a constraint on interference caused by D2D users to the cellular network and the other is its dual, i.e., minimization of interference caused by D2D users to the cellular network with minimum rate guarantee for each D2D user. It is shown that the considered problems reduce to semi-definite programming (SDP) problems. Numerical results show that the proposed AF helper station significantly improves the system performance.

Improving the Implementation Complexity of the Latency-Optimized Fair Queuing Algorithm (최적 레이턴시 기반 공정 큐잉 알고리즘의 구현 복잡도 개선)

  • Kim, Tae-Joon;Suh, Bong-Sue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6B
    • /
    • pp.405-413
    • /
    • 2012
  • WFQ(Weighted Fair Queuing) is the most popular fair queuing algorithm to guarantee the Quality-of-Service(QoS), but it has the inherent drawback of a poor resource utilization, particularly under the low rate traffic requiring a tight delay bound. It was recently identified that the poor utilization is mainly due to non-optimized latency of a traffic flow and then LOFQ(Latency-Optimized Fair Queuing) to overcome the drawback was introduced. The LOFQ algorithm, however, renews their optimal latencies for all flows whenever a new flow arrives, which results in the high implementation complexity of O($N^2$).This paper is to reduce thecomplexity to O(1). The proposed method is first to derive the optimal latency index function from the statistical QoS characteristics of the offered load, and then to simply calculate the optimal latency index of the arriving flow using the function.

An Interconnection Model of ISP Networks (ISP 네트워크간 상호접속 모델)

  • Choi Eunjeong;Tcha Dong-Wan
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.4
    • /
    • pp.151-161
    • /
    • 2005
  • For Internet service providers (ISPs), there are three common types of interconnection agreements : private peering, public peering and transit. One of the most important problems for a single ISP is to determine which other ISPs to interconnect with, and under which agreements. The problem can be then to find a set of private peering providers, transit providers and Internet exchanges (IXs) when the following input data are assumed to be given : a set of BGP addresses with traffic demands, and a set of potential service providers (Private peering/transit providers and IXs) with routing information, cost functions and capacities. The objective is to minimize the total interconnection cost. We show that the problem is NP-hard, give a mixed-integer programming model, and propose a heuristic algorithm. Computational experience with a set of test instances shows the remarkable performance of the proposed algorithm of rapidly generating near-optimal solutions.

An Adaptive Fast Expansion, Loading Statistics with Dynamic Swapping Algorithm to Support Real Time Services over CATV Networks

  • Lo Chih-Chen, g;Lai Hung-Chang;Chen, Wen-Shyen E.
    • Journal of Communications and Networks
    • /
    • v.8 no.4
    • /
    • pp.432-441
    • /
    • 2006
  • As the community antenna television (CATV) networks becomes ubiquitous, instead of constructing an entirely new broadband network infrastructure, it has emerged as one of the rapid and economic technologies to interconnecting heterogeneous network to provide broadband access to subscribers. How to support ubiquitous real-time multimedia applications, especially in a heavy traffic environment, becomes a critical issue in modern CATV networks. In this paper, we propose a time guaranteed and efficient upstream minislots allocation algorithm for supporting quality-of-service (QoS) traffic over data over cable service interface specification (DOCSIS) CATV networks to fulfill the needs of realtime interactive services, such as video telephony, video on demand (VOD), distance learning, and so on. The proposed adaptive fast expansion algorithm and the loading statistics with dynamic swapping algorithm have been shown to perform better than that of the multimedia cable network system (MCNS) DOCSIS.

A Study on IT Network Policy Directions : Focusing on Network Neutrality versus Network Efficiency (IT Network 정책방향에 대한 연구 : 망(網) 중립성과 효율성을 중심으로)

  • Chung, Suk-Kyun
    • Journal of Digital Convergence
    • /
    • v.10 no.1
    • /
    • pp.49-57
    • /
    • 2012
  • The Internet succeeded because of the end-to-end principle which allowed anyone to add functionality to the network. However, as the internet is increasingly becoming the platform for smart IT applications such as VoIP, IPTV, Cloud Computing and Smart Phone, networks are now under increasing strain of traffic congestion and the absence of quality of service insurances. To date, the debate over internet rules has focused on network neutrality rather than network efficiency. This article emphasizes the well-functioning role of market mechanism for the efficient use and further development of the network. To maximize the value of the network, this article proposes a differential treatment to packets based on customer types, and a two-part tariff pricing rule to secure funding to expand and upgrade networks.

CADRAM - Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing

  • Abdullah, M.;Surputheen, M. Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.3
    • /
    • pp.95-100
    • /
    • 2022
  • Cloud computing platform is a shared pool of resources and services with various kind of models delivered to the customers through the Internet. The methods include an on-demand dynamically-scalable form charged using a pay-per-use model. The main problem with this model is the allocation of resource in dynamic. In this paper, we have proposed a mechanism to optimize the resource provisioning task by reducing the job completion time while, minimizing the associated cost. We present the Cooperative Agents Dynamic Resource Allocation and Monitoring in Cloud Computing CADRAM system, which includes more than one agent in order to manage and observe resource provided by the service provider while considering the Clients' quality of service (QoS) requirements as defined in the service-level agreement (SLA). Moreover, CADRAM contains a new Virtual Machine (VM) selection algorithm called the Node Failure Discovery (NFD) algorithm. The performance of the CADRAM system is evaluated using the CloudSim tool. The results illustrated that CADRAM system increases resource utilization and decreases power consumption while avoiding SLA violations.