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

Search Result 1,469, Processing Time 0.033 seconds

A Management for IMS Network Using SDN and SNMP (SDN과 SNMP를 이용한 IMS 네트워크 관리)

  • Yang, Woo-Seok;Kim, Jung-Ho;Lee, Jae-Oh
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.4
    • /
    • pp.694-699
    • /
    • 2017
  • In accordance with the development of information and communications technology, a network user has to be able to use quality of service (QoS)-based multimedia services easily. Thus, information and communications operators began to focus on a technique for providing multimedia services. The IP Multimedia Subsystem (IMS) is a platform based on Internet Protocol (IP) as a technology for providing multimedia services and application services. The emerging 5G networks are described as having massive capacity and connectivity, adaptability, seamless heterogeneity, and great flexibility. The explosive growth in network services and devices for 5G will cause excessive traffic loads. In this paper, software-defined networking (SDN) is applied as a kind of virtualization technology for the network in order to minimize the traffic load, and Simple Network Management Protocol (SNMP) is used to provide more efficient network management. To accomplish these purposes, we suggest the design of a dynamic routing algorithm to be utilized in the IMS network using SDN and an SNMP private management information base (MIB). The proposal in this paper gives information and communications operators the ability to supply more efficient network resources.

A Priority- based Minimum Interference Path Multicast Routing Algorithm in NGOI based DWDM (고밀도 파장 분할 다중화 방식 기반 차세대 광 인터넷망에서 우선순위 기반 최소간섭 경로 멀티캐스트 라우팅 알고리즘)

  • Jo, Chan-Hyo;Seo, Sang-Bo;Lee, Jun-Won;Kim, Sung-Un
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.4
    • /
    • pp.286-296
    • /
    • 2009
  • A major challenge in next generation optical Internet (NGOI) networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. One of the critical issues in NGOI is the routing and wavelength assignment problem that is embossed as very important and plays a key role in improving the global efficiency for capacity utilization. But the previous researches had the delay problem, and the path routed by higher priority nodes may be congested and interfere with potential future multicast session requests. To overcome these problems, in this research we suggest a Priority-based Minimum Interference Path Multicast Routing (PMIPMR) algorithm, a new routing algorithm which finds alternative routes based on node priorities and Virtual Source (VS) nodes that has both splitting and wavelength conversion, and then chooses a path that does not interfere with potential future multicast session requests when congestions occur in the network. The PMIPMR algorithm reduces blocking rate significantly and increases the wavelength utilization by avoiding congestion in future multicast session requests.

A New Incentive Based Bandwidth Allocation Scheme For Cooperative Non-Orthogonal Multiple Access (협력 비직교 다중 접속 네트워크에서 새로운 인센티브 기반 주파수 할당 기법)

  • Kim, Jong Won;Kim, Sung Wook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.6
    • /
    • pp.173-180
    • /
    • 2021
  • Non Orthogonal Multiple Access (NOMA) is a technology to guarantee the explosively increased Quality of Service(QoS) of users in 5G networks. NOMA can remove the frequent orthogonality in Orthogonal Multiple Access (OMA) while allocating the power differentially to classify user signals. NOMA can guarantee higher communication speed than OMA. However, the NOMA has one disadvantage; it consumes a more energy power when the distance increases. To solve this problem, relay nodes are employed to implement the cooperative NOMA control idea. In a cooperative NOMA network, relay node participations for cooperative communications are essential. In this paper, a new bandwidth allocation scheme is proposed for cooperative NOMA platform. By employing the idea of Vickrey-Clarke-Groves (VCG) mechanism, the proposed scheme can effectively prevent selfishly actions of relay nodes in the cooperative NOMA network. Especially, base stations can pay incentives to relay nodes as much as the contributes of relay nodes. Therefore, the proposed scheme can control the selfish behavior of relay nodes to improve the overall system performance.

A TXOP Sharing Scheme for QoS Strategy of IEEE 802.11ac DL MU-MIMO MAC (IEEE 802.11ac DL MU-MIMO MAC의 QoS 정책을 고려한 TXOP 공유 방안)

  • Lee, Ji-Young;Seok, Seung-Joon
    • Journal of Digital Convergence
    • /
    • v.12 no.10
    • /
    • pp.317-327
    • /
    • 2014
  • To improve the efficiency of wireless channel, IEEE 802.11ac uses the DL MU-MIMO MAC scheme through which an AP transmits multiple frames to different mobile nodes simultaneously. IEEE 802.11ac DL MU-MIMO MAC needs a new step, called as TXOP sharing, between legacy IEEE 802.11n DL SU-MIMO's two operations, the obtaining an EDCA TXOP and the transmitting multiple frames for EDCA TXOP. In the TXOP sharing operation, both wireless channel destinations and frames transmitted for its TXOP period should are determined. So this paper deals with the TXOP sharing for improving IEEE 802.11ac MAC performance. However, the EDCA priority based method mentioned by IEEE 802.11ac standard document not fair among the buffers and the frames of buffers, and occurs in high_loss rate and high_delay about specific buffers. In this paper, we propose a new scheme of the TXOP sharing with sequencing p-AC, s-AC in similar properties, and all S-AC. This method provides a differentiated service without damage of EDCA characteristics.

JXTA based P2P Framework using Mobile Agents (모바일 에이전트를 이용한 JXTA 기반의 P2P 프레임워크)

  • Min, Su-Hong;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.384-387
    • /
    • 2003
  • In this paper, we have designed the integrated wire and wireless P2P framework using mobile agents to share efficiently resources as media file. Most of the P2P applications are used on the wire network. We propose the integrated wire and wireless P2P framework. Proposed P2P platform is based on JXTA of Sun Microsystems. But JXTA is pure peer-to-peer network model, so it sends message other peers as broadcast style to request resources. In this way, there are some problems as massage overload, bandwidth loss, etc. In order to solve this problem, we propose a hybrid peer-to-peer network model using mobile agent. Proposed scheme also solve existing hybrid pEp model's flaws which have the delay and low rate due to concentrated server. In proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Besides, mobile agents could solve the loss problem of the search result. To improve P2P QoS(Quality of Service), we could monitor peer's state information using PIP(Peer Information Protocol) of JXTA.

  • PDF

Study on the Internet Industry Structure under the NgN Regime-Competitive Landscape of ISPs, CPs, and CDNs (디지털 컨버전스 인프라로서의 NgN 환경에서 인터넷 산업구조 : ISP, CP, CDN 사업자간 경쟁을 중심으로)

  • Kim, Do-Hoon
    • Korean Management Science Review
    • /
    • v.23 no.3
    • /
    • pp.243-257
    • /
    • 2006
  • ITU-T's NgN(Next generation Network) architecture is expected to offer a new Internet platforms such as QoS(Quality of Service) guaranteed services as it overcame the limitations of the existing best-effort Internet architecture. However, policy development crucial for the NgN framework(e.g., interconnections and billing) is lagging far behind technology development. For example, arguments over network neutrality clearly indicate little understanding of the Internet industry structure where diverse providers including ISP and CP coexist. This study employs a network economics approach to predict how the competitive landscape involving various providers will evolve under the traffic-based billing system under the NgN environment. Applied is the non-cooperative game theory, in particular, Stackelberg's repeated game in order to build and analyze model for competition among those providers. We also studied possible impacts that CPs would have on the competitive landscape if they have an option to replace ISP: i.e., CDN(Content Delivery Network) provider. Lastly, based on the model analysis and experiments, presented are their implications to policy development and tile future prospect.

Decision on Compression Ratios for Real-Time Transfer of Ultrasound Sequences

  • Lee, Jae-Hoon;Sung, Min-Mo;Kim, Hee-Joung;Yoo, Sun-Kwook;Kim, Eun-Kyung;Kim, Dong-Keun;Jung, Suk-Myung;Yoo, Hyung-Sik
    • Proceedings of the Korean Society of Medical Physics Conference
    • /
    • 2002.09a
    • /
    • pp.489-491
    • /
    • 2002
  • The need for video diagnosis in medicine has been increased and real-time transfer of digital video will be an important component in PACS and telemedicine. But, Network environment has certain limitations that the required throughput can not satisfy quality of service (QoS). MPEG-4 ratified as a moving video standard by the ISO/IEC provides very efficient video coding covering the various ranges of low bit-rate in network environment. We implemented MPEG-4 CODEC (coder/decoder) and applied various compression ratios to moving ultrasound images. These images were displayed in random order on a client monitor passed through network. Radiologists determined subjective opinion scores for evaluating clinically acceptable image quality and then these were statistically processed in the t-Test method. Moreover the MPEG-4 decoded images were quantitatively analyzed by computing peak signal-to-noise ratio (PSNR) to objectively evaluate image quality. The bit-rate to maintain clinically acceptable image quality was up to 0.8Mbps. We successfully implemented the adaptive throughput or bit-rate relative to the image quality of ultrasound sequences used MPEG-4 that can be applied for diagnostic performance in real-time.

  • PDF

Power Allocation Schemes For Downlink Cognitive Radio Networks With Opportunistic Sub-channel Access

  • Xu, Ding;Feng, Zhiyong;Zhang, Ping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.7
    • /
    • pp.1777-1791
    • /
    • 2012
  • This paper considers a downlink cognitive radio (CR) network where one secondary user (SU) and one primary user (PU) share the same base station (BS). The spectrum of interest is divided into a set of independent, orthogonal subchannels. The communication of the PU is of high priority and the quality of service (QoS) is guaranteed by the minimum rate constraint. On the other hand, the communication of the SU is of low priority and the SU opportunistically accesses the subchannels that were previously discarded by the PU during power allocation. The BS assigns fractions ?? and 1 ?? of the total available transmit power to the PU and the SU respectively. Two power allocation schemes with opportunistic subchannel access are proposed, in which the optimal values of ??'s are also obtained. The objective of one scheme is to maximize the rate of the SU, and the objective of the other scheme is to maximize the sum rate of the SU and the PU, both under the PU minimum rate constraint and the total transmit power constraint. Extensive simulation results are obtained to verify the effectiveness of the proposed schemes.

Chaotic Prediction Based Channel Sensing in CR System (CR 시스템에서 Chaotic 예측기반 채널 센싱기법)

  • Gao, Xiang;Lee, Juhyeon;Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.1
    • /
    • pp.140-142
    • /
    • 2013
  • Cognitive radio (CR) has been recently proposed to dynamically access unused-spectrum. Since the spectrum availability for opportunistic access is determined by spectrum sensing, sensing control is identified as one of the most crucial issues of cognitive radio networks. Out-of-band sensing to find an available channels to sense. Sensing is also required in case of spectrum hand-off. Sensing process needs to be done very fast in order to enhance the quality of service (QoS) of the CR nodes, and transmission not to be cut for longer time. During the sensing, the PU(primary user) detection probability condition should be satisfied. We adopt a channel prediction method to find target channels. Proposed prediction method combines chaotic global method and chaotic local method for channel idle probability prediction. Global method focus on channel history information length and order number of prediction model. Local method focus on local prediction trend. Through making simulation, Proposed method can find an available channel with very high probability, total sensing time is minimized, detection probability of PU's are satisfied.

Spectrum Leasing and Cooperative Resource Allocation in Cognitive OFDMA Networks

  • Tao, Meixia;Liu, Yuan
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.102-110
    • /
    • 2013
  • This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.