• Title/Summary/Keyword: Optimal service rate

Search Result 240, Processing Time 0.025 seconds

QoSCM: QoS-aware Coded Multicast Approach for Wireless Networks

  • Mohajer, Amin;Barari, Morteza;Zarrabi, Houman
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.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.

Circuit-Switched “Network Capacity” under QoS Constraints

  • Wieselthier, Jeffrey E.;Nguyen, Gam D.;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • v.4 no.3
    • /
    • pp.230-245
    • /
    • 2002
  • Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

Analysis of Vulnerable Districts for Electronic Vehicle Charging Infrastructure based on Gas Stations (주유소 기반의 전기자동차 충전인프라 구축에 대한 취약지역 분석)

  • Kim, Taegon;Kim, Solhee;Suh, Kyo
    • Journal of Korean Society of Rural Planning
    • /
    • v.20 no.4
    • /
    • pp.137-143
    • /
    • 2014
  • Car exhaust emissions are recognized as one of the key sources for climate change and electric vehicles have no emissions from tailpipe. However, the limited charging infrastructures could restrict the propagation of electric vehicles. The purpose of this study is to find the vulnerable districts limited to the charging station services after meeting the goal of Ministry of Knowledge Economy(12%). We assumed that the charging service can be provided by current gas stations. The range of the vulnerable grades was determined by the accessibility to current gas stations and the vulnerable regions were classified considering the optimal number of charging stations estimated by the efficiency function. We used 4,827 sub-municipal divisions and 11,677 gas station locations for this analysis. The results show that most of mountain areas are vulnerable and the fringe areas of large cities generally get a good grade for the charging infrastructure. The gangwon-do, jeollanam-do, gyeongsangbuk-do, and chungcheongnam-do include more than 40% vulnerable districts.

Randomized Block Size (RBS) Model for Secure Data Storage in Distributed Server

  • Sinha, Keshav;Paul, Partha;Amritanjali, Amritanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4508-4530
    • /
    • 2021
  • Today distributed data storage service are being widely used. However lack of proper means of security makes the user data vulnerable. In this work, we propose a Randomized Block Size (RBS) model for secure data storage in distributed environments. The model work with multifold block sizes encrypted with the Chinese Remainder Theorem-based RSA (C-RSA) technique for end-to-end security of multimedia data. The proposed RBS model has a key generation phase (KGP) for constructing asymmetric keys, and a rand generation phase (RGP) for applying optimal asymmetric encryption padding (OAEP) to the original message. The experimental results obtained with text and image files show that the post encryption file size is not much affected, and data is efficiently encrypted while storing at the distributed storage server (DSS). The parameters such as ciphertext size, encryption time, and throughput have been considered for performance evaluation, whereas statistical analysis like similarity measurement, correlation coefficient, histogram, and entropy analysis uses to check image pixels deviation. The number of pixels change rate (NPCR) and unified averaged changed intensity (UACI) were used to check the strength of the proposed encryption technique. The proposed model is robust with high resilience against eavesdropping, insider attack, and chosen-plaintext attack.

A Secure, Hierarchical and Clustered Multipath Routing Protocol for Homogenous Wireless Sensor Networks: Based on the Numerical Taxonomy Technique

  • Hossein Jadidoleslamy
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.8
    • /
    • pp.121-136
    • /
    • 2023
  • Wireless Sensor Networks (WSNs) have many potential applications and unique challenges. Some problems of WSNs are: severe resources' constraints, low reliability and fault tolerant, low throughput, low scalability, low Quality of Service (QoS) and insecure operational environments. One significant solution against mentioned problems is hierarchical and clustering-based multipath routing. But, existent algorithms have many weaknesses such as: high overhead, security vulnerabilities, address-centric, low-scalability, permanent usage of optimal paths and severe resources' consumption. As a result, this paper is proposed an energy-aware, congestion-aware, location-based, data-centric, scalable, hierarchical and clustering-based multipath routing algorithm based on Numerical Taxonomy technique for homogenous WSNs. Finally, performance of the proposed algorithm has been compared with performance of LEACH routing algorithm; results of simulations and statistical-mathematical analysis are showing the proposed algorithm has been improved in terms of parameters like balanced resources' consumption such as energy and bandwidth, throughput, reliability and fault tolerant, accuracy, QoS such as average rate of packet delivery and WSNs' lifetime.

Multi-Slice Joint Task Offloading and Resource Allocation Scheme for Massive MIMO Enabled Network

  • Yin Ren;Aihuang Guo;Chunlin Song
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.3
    • /
    • pp.794-815
    • /
    • 2023
  • The rapid development of mobile communication not only has made the industry gradually diversified, but also has enhanced the service quality requirements of users. In this regard, it is imperative to consider jointly network slicing and mobile edge computing. The former mainly ensures the requirements of varied vertical services preferably, and the latter solves the conflict between the user's own energy and harsh latency. At present, the integration of the two faces many challenges and need to carry out at different levels. The main target of the paper is to minimize the energy consumption of the system, and introduce a multi-slice joint task offloading and resource allocation scheme for massive multiple input multiple output enabled heterogeneous networks. The problem is formulated by collaborative optimizing offloading ratios, user association, transmission power and resource slicing, while being limited by the dissimilar latency and rate of multi-slice. To solve it, assign the optimal problem to two sub-problems of offloading decision and resource allocation, then solve them separately by exploiting the alternative optimization technique and Karush-Kuhn-Tucker conditions. Finally, a novel slices task offloading and resource allocation algorithm is proposed to get the offloading and resource allocation strategies. Numerous simulation results manifest that the proposed scheme has certain feasibility and effectiveness, and its performance is better than the other baseline scheme.

Quality Characteristics of Pan Bread Added with Citrus Mandarin Peel Powder (감귤과피 분말을 첨가한 식빵의 품질 특성)

  • Lee, Eun-Jin;Ju, Hyoung-Woog;Lee, Kwang-Suck
    • Culinary science and hospitality research
    • /
    • v.18 no.1
    • /
    • pp.27-39
    • /
    • 2012
  • This study was conducted to examine the characteristics of bread quality as per addition rate of citrus mandarin peel powder since interests and concerns about healthy functional food have been increased in contemporary society. The result of mixogram from Mixograph showed that dough added with 3% citrus mandarin peel powder was suitable for baking quality. Stickiness of dough was decreased with addition of citrus mandarin peel powder. Compared with the controlled group, fermentation rate was decreased as the level of citrus mandarin peel powder increased while pH levels of dough and bread were significantly decreased. The TPA analysis showed that the hardness and adhesiveness levels increased as the level of citrus mandarin peel powder increased whereas springiness, cohesiveness and chewiness became decreased. Crumb fineness and elongation became higher as seen from the result of crumbScan. Volume and specific volume was decreased. The result of preference test presented that crumb color, texture, flavor and taste were the highest in the M3, which showed highest point in overall preference. In conclusion, M3 was the best in preference, taste and texture, thus determined as the optimal rate in association with the addition of citrus mandarin peel powder.

  • PDF

Regional Traffic Information Acquisition by Non-intrusive Automatic Vehicle Identification (비매설식 자동차량인식장치를 이용한 구간교통정보 산출 방법 연구)

  • Kang Jin-Kee;Son Youngtae;Yoon Yeo-Hwan;Byun Sangchul
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.1 no.1
    • /
    • pp.22-32
    • /
    • 2002
  • This paper describes about non-burial AVI (Automatic Vehicle Identification) system using general vehicle as probe car for obtaining more accurate traffic information while conserving road pavement surface. Existing spot traffic detectors have their own limits of not obtaining right information owing to its mathematical method. Burial AVI systems have some defects, causing traffic jam, needing much maintenance cost because of frequent cutting of loop and piezo-electric sensors. Especially, they have hard time to make right detection, when it comes to jamming time. Therefore, in this paper, we propose non-burial AVI system with laser trigger unit. Proposed non-burial AVI system is developed to obtain regional traffic information from normal Passing vehicle by automatic license number recognition technology. We have adapted it to national highway section between Suwon city and Pyong$\~$Taek city(9.5km) and get affirmative results. Vehicle detection rate of laser trigger unit is more than 95$\%$, vehicle recognition rate is 87.8$\%$ and vehicle matching rate is about 14.3$\%$. So we regard these as satisfying results to use the system for traffic information service. We evaluate proposed AVI system by regulation of some institutions which are using similar AVI system and the proposed system satisfies all conditions. For future study, we have plan of detailed research about proper lane number from all of the target lanes, optimal section length, information service period, and data fusion method for existing spot detector.

  • PDF

Clinical Implications of Device-Detected Atrial Fibrillation in Cardiac Resynchronization Therapy

  • Minjae Yoon;Jaewon Oh;Kyeong-Hyeon Chun;Hee Tae Yu;Chan Joo Lee;Tae-Hoon Kim;Hui-Nam Pak;Moon-Hyoung Lee;Boyoung Joung;Seok-Min Kang
    • Korean Circulation Journal
    • /
    • v.53 no.7
    • /
    • pp.483-496
    • /
    • 2023
  • Background and Objectives: Atrial fibrillation (AF) is associated with decreased cardiac resynchronization therapy (CRT) benefits compared to sinus rhythm (SR). Effective biventricular (BiV) pacing is a determinant of CRT success, but AF can interfere with adequate BiV pacing and affect clinical outcomes. We investigated the effect of device-detected AF on clinical outcomes and optimal BiV pacing in patients with heart failure (HF) treated with CRT. Methods: We retrospectively analyzed 174 patients who underwent CRT implantation between 2012 and 2019 at a tertiary center. The optimal BiV pacing percentage was defined as ≥98%. Device-detected AF was defined as an atrial high-rate episode ≥180 beats per minute lasting more than 6 minutes during the follow-up period. We stratified the patients without preexisting AF at pre-implantation into device-detected AF and no-AF groups. Results: A total of 120 patients did not show preexisting AF at pre-implantation, and 54 had AF. Among these 120 patients, 19 (15.8%) showed device-detected AF during a median follow-up of 25.1 months. The proportion of optimal BiV pacing was significantly lower in the device-detected AF group than in the no-AF group (42.1% vs. 75.2%, p=0.009). The devicedetected AF group had a higher incidence of HF hospitalization, cardiovascular death, and all-cause death than the no-AF group. The device-detected AF and previous AF groups showed no significant differences regarding the percentage of BiV pacing and clinical outcomes. Conclusions: For HF patients implanted with CRT, device-detected AF was associated with lower optimal BiV pacing and worse clinical outcomes than no-AF.

Simulation and Analysis of Slammer Worm Propagation With Automatic Quarantine (자동 격리를 감안한 슬래머 웜 전파과정에 대한 모의실험 및 분석)

  • Lim, Jae-Myung;Jung, Han-Gyun;Yoon, Chong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8B
    • /
    • pp.529-538
    • /
    • 2007
  • In this paper, we have analyzed a simulation model of Slammer worm propagation process which caused serious disruptions on the Internet in the year of 2003 by using NS-2. Previously we had presented and analyzed Abstract Network to Abstract Network(AN-AN) model being modified from the Detailed Network to Abstract Network(DN-AN) of NS-2. However, packet analysis in AN-AN model had a problem of taking 240 hours to simulate the initial 300 seconds of infection. We have reduced the AN-AN model to save the simulation time and analyzed total 3.5 hours of the network congestions within 107 hours. Moreover, we have derived optimal quarantine rate of 0.0022 considering service outage of network devices caused by the heavy infected traffics, which was not taken into consideration in previous works. As the result of simulation, Although the inbound traffic at the Korean international gateway was back in normal conditions at 4,787 second, due to the revese direction saturation was maintained until 12,600 seconds, the service outage was persisted for 3.5 hours.