CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: single–server queue model</title> <meta name="description" content="Search results for: single–server queue model"> <meta name="keywords" content="single–server queue model"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="single–server queue model" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="single–server queue model"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 20555</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: single–server queue model</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20555</span> On Four Models of a Three Server Queue with Optional Server Vacations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kailash%20C.%20Madan">Kailash C. Madan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study four models of a three server queueing system with Bernoulli schedule optional server vacations. Customers arriving at the system one by one in a Poisson process are provided identical exponential service by three parallel servers according to a first-come, first served queue discipline. In model A, all three servers may be allowed a vacation at one time, in Model B at the most two of the three servers may be allowed a vacation at one time, in model C at the most one server is allowed a vacation, and in model D no server is allowed a vacation. We study steady the state behavior of the four models and obtain steady state probability generating functions for the queue size at a random point of time for all states of the system. In model D, a known result for a three server queueing system without server vacations is derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=a%20three%20server%20queue" title="a three server queue">a three server queue</a>, <a href="https://publications.waset.org/abstracts/search?q=Bernoulli%20schedule%20server%20vacations" title=" Bernoulli schedule server vacations"> Bernoulli schedule server vacations</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20size%20distribution%20at%20a%20random%20epoch" title=" queue size distribution at a random epoch"> queue size distribution at a random epoch</a>, <a href="https://publications.waset.org/abstracts/search?q=steady%20state" title=" steady state"> steady state</a> </p> <a href="https://publications.waset.org/abstracts/50668/on-four-models-of-a-three-server-queue-with-optional-server-vacations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50668.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">296</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20554</span> On a Single Server Queue with Arrivals in Batches of Variable Size, Generalized Coxian-2 Service and Compulsory Server Vacations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kailash%20C.%20Madan">Kailash C. Madan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study the steady state behaviour of a batch arrival single server queue in which the first service with general service times is compulsory and the second service with general service times is optional. We term such a two phase service as generalized Coxian-2 service. Just after completion of a service the server must take a vacation of random length of time with general vacation times. We obtain steady state probability generating functions for the queue size as well as the steady state mean queue size at a random epoch of time in explicit and closed forms. Some particular cases of interest including some known results have been derived. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=batch%20arrivals" title="batch arrivals">batch arrivals</a>, <a href="https://publications.waset.org/abstracts/search?q=compound%20Poisson%20process" title=" compound Poisson process"> compound Poisson process</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20Coxian-2%20service" title=" generalized Coxian-2 service"> generalized Coxian-2 service</a>, <a href="https://publications.waset.org/abstracts/search?q=steady%20state" title=" steady state"> steady state</a> </p> <a href="https://publications.waset.org/abstracts/35090/on-a-single-server-queue-with-arrivals-in-batches-of-variable-size-generalized-coxian-2-service-and-compulsory-server-vacations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35090.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">455</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20553</span> A Two Server Poisson Queue Operating under FCFS Discipline with an ‘m’ Policy </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20Sivasamy">R. Sivasamy</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Paulraj"> G. Paulraj</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Kalaimani"> S. Kalaimani</a>, <a href="https://publications.waset.org/abstracts/search?q=N.Thillaigovindan"> N.Thillaigovindan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For profitable businesses, queues are double-edged swords and hence the pain of long wait times in a queue often frustrates customers. This paper suggests a technical way of reducing the pain of lines through a Poisson M/M1, M2/2 queueing system operated by two heterogeneous servers with an objective of minimising the mean sojourn time of customers served under the queue discipline ‘First Come First Served with an ‘m’ policy, i.e. FCFS-m policy’. Arrivals to the system form a Poisson process of rate λ and are served by two exponential servers. The service times of successive customers at server ‘j’ are independent and identically distributed (i.i.d.) random variables and each of it is exponentially distributed with rate parameter μj (j=1, 2). The primary condition for implementing the queue discipline ‘FCFS-m policy’ on these service rates μj (j=1, 2) is that either (m+1) µ2 > µ1> m µ2 or (m+1) µ1 > µ2> m µ1 must be satisfied. Further waiting customers prefer the server-1 whenever it becomes available for service, and the server-2 should be installed if and only if the queue length exceeds the value ‘m’ as a threshold. Steady-state results on queue length and waiting time distributions have been obtained. A simple way of tracing the optimal service rate μ*2 of the server-2 is illustrated in a specific numerical exercise to equalize the average queue length cost with that of the service cost. Assuming that the server-1 has to dynamically adjust the service rates as μ1 during the system size is strictly less than T=(m+2) while μ2=0, and as μ1 +μ2 where μ2>0 if the system size is more than or equal to T, corresponding steady state results of M/M1+M2/1 queues have been deduced from those of M/M1,M2/2 queues. To conclude this investigation has a viable application, results of M/M1+M2/1 queues have been used in processing of those waiting messages into a single computer node and to measure the power consumption by the node. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=two%20heterogeneous%20servers" title="two heterogeneous servers">two heterogeneous servers</a>, <a href="https://publications.waset.org/abstracts/search?q=M%2FM1" title=" M/M1"> M/M1</a>, <a href="https://publications.waset.org/abstracts/search?q=M2%2F2%20queue" title="M2/2 queue">M2/2 queue</a>, <a href="https://publications.waset.org/abstracts/search?q=service%20cost%20and%20queue%20length%20cost" title=" service cost and queue length cost"> service cost and queue length cost</a>, <a href="https://publications.waset.org/abstracts/search?q=M%2FM1%2BM2%2F1%20queue" title=" M/M1+M2/1 queue"> M/M1+M2/1 queue</a> </p> <a href="https://publications.waset.org/abstracts/42944/a-two-server-poisson-queue-operating-under-fcfs-discipline-with-an-m-policy" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42944.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">362</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20552</span> Analysis of the Unreliable M/G/1 Retrial Queue with Impatient Customers and Server Vacation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fazia%20Rahmoune">Fazia Rahmoune</a>, <a href="https://publications.waset.org/abstracts/search?q=Sofiane%20Ziani"> Sofiane Ziani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Retrial queueing systems have been extensively used to stochastically model many problems arising in computer networks, telecommunication, telephone systems, among others. In this work, we consider a $M/G/1$ retrial queue with an unreliable server with random vacations and two types of primary customers, persistent and impatient. This model involves the unreliability of the server, which can be subject to physical breakdowns and takes into account the correctives maintenances for restoring the service when a failure occurs. On the other hand, we consider random vacations, which can model the preventives maintenances for improving system performances and preventing breakdowns. We give the necessary and sufficient stability condition of the system. Then, we obtain the joint probability distribution of the server state and the number of customers in orbit and derive the more useful performance measures analytically. Moreover, we also analyze the busy period of the system. Finally, we derive the stability condition and the generating function of the stationary distribution of the number of customers in the system when there is no vacations and impatient customers, and when there is no vacations, server failures and impatient customers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modeling" title="modeling">modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=retrial%20queue" title=" retrial queue"> retrial queue</a>, <a href="https://publications.waset.org/abstracts/search?q=unreliable%20server" title=" unreliable server"> unreliable server</a>, <a href="https://publications.waset.org/abstracts/search?q=vacation" title=" vacation"> vacation</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20analysis" title=" stochastic analysis"> stochastic analysis</a> </p> <a href="https://publications.waset.org/abstracts/109241/analysis-of-the-unreliable-mg1-retrial-queue-with-impatient-customers-and-server-vacation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109241.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20551</span> The Fluid Limit of the Critical Processor Sharing Tandem Queue</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amal%20Ezzidani">Amal Ezzidani</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelghani%20Ben%20Tahar"> Abdelghani Ben Tahar</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Hanini"> Mohamed Hanini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A sequence of finite tandem queue is considered for this study. Each one has a single server, which operates under the egalitarian processor sharing discipline. External customers arrive at each queue according to a renewal input process and having a general service times distribution. Upon completing service, customers leave the current queue and enter to the next. Under mild assumptions, including critical data, we prove the existence and the uniqueness of the fluid solution. For asymptotic behavior, we provide necessary and sufficient conditions for the invariant state and the convergence to this invariant state. In the end, we establish the convergence of a correctly normalized state process to a fluid limit characterized by a system of algebraic and integral equations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fluid%20limit" title="fluid limit">fluid limit</a>, <a href="https://publications.waset.org/abstracts/search?q=fluid%20model" title=" fluid model"> fluid model</a>, <a href="https://publications.waset.org/abstracts/search?q=measure%20valued%20process" title=" measure valued process"> measure valued process</a>, <a href="https://publications.waset.org/abstracts/search?q=processor%20sharing" title=" processor sharing"> processor sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=tandem%20queue" title=" tandem queue"> tandem queue</a> </p> <a href="https://publications.waset.org/abstracts/130452/the-fluid-limit-of-the-critical-processor-sharing-tandem-queue" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/130452.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">324</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20550</span> Epistemic Uncertainty Analysis of Queue with Vacations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Baya%20Takhedmit">Baya Takhedmit</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Abbas"> Karim Abbas</a>, <a href="https://publications.waset.org/abstracts/search?q=Sofiane%20Ouazine"> Sofiane Ouazine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The vacations queues are often employed to model many real situations such as computer systems, communication networks, manufacturing and production systems, transportation systems and so forth. These queueing models are solved at fixed parameters values. However, the parameter values themselves are determined from a finite number of observations and hence have uncertainty associated with them (epistemic uncertainty). In this paper, we consider the M/G/1/N queue with server vacation and exhaustive discipline where we assume that the vacation parameter values have uncertainty. We use the Taylor series expansions approach to estimate the expectation and variance of model output, due to epistemic uncertainties in the model input parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=epistemic%20uncertainty" title="epistemic uncertainty">epistemic uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=M%2FG%2F1%2FN%20queue%20with%20vacations" title=" M/G/1/N queue with vacations"> M/G/1/N queue with vacations</a>, <a href="https://publications.waset.org/abstracts/search?q=non-parametric%20sensitivity%20analysis" title=" non-parametric sensitivity analysis"> non-parametric sensitivity analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=Taylor%20series%20expansion" title=" Taylor series expansion"> Taylor series expansion</a> </p> <a href="https://publications.waset.org/abstracts/63375/epistemic-uncertainty-analysis-of-queue-with-vacations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63375.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">433</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20549</span> An Analysis of a Queueing System with Heterogeneous Servers Subject to Catastrophes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Reni%20Sagayaraj">M. Reni Sagayaraj</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Anand%20Gnana%20Selvam"> S. Anand Gnana Selvam</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Reynald%20Susainathan"> R. Reynald Susainathan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study analyzed a queueing system with blocking and no waiting line. The customers arrive according to a Poisson process and the service times follow exponential distribution. There are two non-identical servers in the system. The queue discipline is FCFS, and the customers select the servers on fastest server first (FSF) basis. The service times are exponentially distributed with parameters μ1 and μ2 at servers I and II, respectively. Besides, the catastrophes occur in a Poisson manner with rate γ in the system. When server I is busy or blocked, the customer who arrives in the system leaves the system without being served. Such customers are called lost customers. The probability of losing a customer was computed for the system. The explicit time dependent probabilities of system size are obtained and a numerical example is presented in order to show the managerial insights of the model. Finally, the probability that arriving customer finds system busy and average number of server busy in steady state are obtained numerically. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=queueing%20system" title="queueing system">queueing system</a>, <a href="https://publications.waset.org/abstracts/search?q=blocking" title=" blocking"> blocking</a>, <a href="https://publications.waset.org/abstracts/search?q=poisson%20process" title=" poisson process"> poisson process</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20servers" title=" heterogeneous servers"> heterogeneous servers</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20discipline%20FCFS" title=" queue discipline FCFS"> queue discipline FCFS</a>, <a href="https://publications.waset.org/abstracts/search?q=busy%20period" title=" busy period"> busy period</a> </p> <a href="https://publications.waset.org/abstracts/32751/an-analysis-of-a-queueing-system-with-heterogeneous-servers-subject-to-catastrophes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32751.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">506</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20548</span> On the Use of Analytical Performance Models to Design a High-Performance Active Queue Management Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shahram%20Jamali">Shahram Jamali</a>, <a href="https://publications.waset.org/abstracts/search?q=Samira%20Hamed"> Samira Hamed </a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the open issues in Random Early Detection (RED) algorithm is how to set its parameters to reach high performance for the dynamic conditions of the network. Although original RED uses fixed values for its parameters, this paper follows a model-based approach to upgrade performance of the RED algorithm. It models the routers queue behavior by using the Markov model and uses this model to predict future conditions of the queue. This prediction helps the proposed algorithm to make some tunings over RED's parameters and provide efficiency and better performance. Widespread packet level simulations confirm that the proposed algorithm, called Markov-RED, outperforms RED and FARED in terms of queue stability, bottleneck utilization and dropped packets count. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=active%20queue%20management" title="active queue management">active queue management</a>, <a href="https://publications.waset.org/abstracts/search?q=RED" title=" RED"> RED</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20model" title=" Markov model"> Markov model</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20early%20detection%20algorithm" title=" random early detection algorithm "> random early detection algorithm </a> </p> <a href="https://publications.waset.org/abstracts/33934/on-the-use-of-analytical-performance-models-to-design-a-high-performance-active-queue-management-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33934.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">539</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20547</span> Proxisch: An Optimization Approach of Large-Scale Unstable Proxy Servers Scheduling</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xiaoming%20Jiang">Xiaoming Jiang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jinqiao%20Shi"> Jinqiao Shi</a>, <a href="https://publications.waset.org/abstracts/search?q=Qingfeng%20Tan"> Qingfeng Tan</a>, <a href="https://publications.waset.org/abstracts/search?q=Wentao%20Zhang"> Wentao Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xuebin%20Wang"> Xuebin Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Muqian%20Chen"> Muqian Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, big companies such as Google, Microsoft, which have adequate proxy servers, have perfectly implemented their web crawlers for a certain website in parallel. But due to lack of expensive proxy servers, it is still a puzzle for researchers to crawl large amounts of information from a single website in parallel. In this case, it is a good choice for researchers to use free public proxy servers which are crawled from the Internet. In order to improve efficiency of web crawler, the following two issues should be considered primarily: (1) Tasks may fail owing to the instability of free proxy servers; (2) A proxy server will be blocked if it visits a single website frequently. In this paper, we propose Proxisch, an optimization approach of large-scale unstable proxy servers scheduling, which allow anyone with extremely low cost to run a web crawler efficiently. Proxisch is designed to work efficiently by making maximum use of reliable proxy servers. To solve second problem, it establishes a frequency control mechanism which can ensure the visiting frequency of any chosen proxy server below the website’s limit. The results show that our approach performs better than the other scheduling algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=proxy%20server" title="proxy server">proxy server</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20queue" title=" priority queue"> priority queue</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20algorithm" title=" optimization algorithm"> optimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20web%20crawling" title=" distributed web crawling"> distributed web crawling</a> </p> <a href="https://publications.waset.org/abstracts/43957/proxisch-an-optimization-approach-of-large-scale-unstable-proxy-servers-scheduling" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43957.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">211</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20546</span> Discrete-Time Bulk Queue with Service Capacity Depending on Previous Service Time</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yutae%20Lee">Yutae Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper considers a discrete-time bulk-arrival bulkservice queueing system, where service capacity varies depending on the previous service time. By using the generating function technique and the supplementary variable method, we compute the distributions of the queue length at an arbitrary slot boundary and a departure time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete-time%20queue" title="discrete-time queue">discrete-time queue</a>, <a href="https://publications.waset.org/abstracts/search?q=bulk%20queue" title=" bulk queue"> bulk queue</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20service%20capacity" title=" variable service capacity"> variable service capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20length%20distribution" title=" queue length distribution"> queue length distribution</a> </p> <a href="https://publications.waset.org/abstracts/4113/discrete-time-bulk-queue-with-service-capacity-depending-on-previous-service-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4113.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">476</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20545</span> Decomposition of the Customer-Server Interaction in Grocery Shops</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Andreas%20Ahrens">Andreas Ahrens</a>, <a href="https://publications.waset.org/abstracts/search?q=Ojaras%20Purvinis"> Ojaras Purvinis</a>, <a href="https://publications.waset.org/abstracts/search?q=Jelena%20Zascerinska"> Jelena Zascerinska</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A successful shopping experience without overcrowded shops and long waiting times undoubtedly leads to the release of happiness hormones and is generally considered the goal of any optimization. Factors influencing the shopping experience can be divided into internal and external ones. External factors are related, e. g. to the arrival of the customers to the shop, whereas internal are linked with the service process itself when checking out (waiting in the queue to the cash register and the scanning of the goods as well as the payment process itself) or any other non-expected delay when changing the status from a visitor to a buyer by choosing goods or items. This paper divides the customer-server interaction into five phases starting with the customer's arrival at the shop, the selection of goods, the buyer waiting in the queue to the cash register, the payment process, and ending with the customer or buyer's departure. Our simulation results show how five phases are intertwined and influence the overall shopping experience. Parameters for measuring the shopping experience are estimated based on the burstiness level in each of the five phases of the customer-server interaction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=customers%E2%80%99%20burstiness" title="customers’ burstiness">customers’ burstiness</a>, <a href="https://publications.waset.org/abstracts/search?q=cash%20register" title=" cash register"> cash register</a>, <a href="https://publications.waset.org/abstracts/search?q=customers%E2%80%99%20wait-ing%20time" title=" customers’ wait-ing time"> customers’ wait-ing time</a>, <a href="https://publications.waset.org/abstracts/search?q=gap%20distribution%20function" title=" gap distribution function"> gap distribution function</a> </p> <a href="https://publications.waset.org/abstracts/147564/decomposition-of-the-customer-server-interaction-in-grocery-shops" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147564.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20544</span> A Study on Stochastic Integral Associated with Catastrophes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Reni%20Sagayaraj">M. Reni Sagayaraj</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Anand%20Gnana%20Selvam"> S. Anand Gnana Selvam</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Reynald%20Susainathan"> R. Reynald Susainathan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We analyze stochastic integrals associated with a mutation process. To be specific, we describe the cell population process and derive the differential equations for the joint generating functions for the number of mutants and their integrals in generating functions and their applications. We obtain first-order moments of the processes of the two-way mutation process in first-order moment structure of X (t) and Y (t) and the second-order moments of a one-way mutation process. In this paper, we obtain the limiting behaviour of the integrals in limiting distributions of X (t) and Y (t). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stochastic%20integrals" title="stochastic integrals">stochastic integrals</a>, <a href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model" title=" single–server queue model"> single–server queue model</a>, <a href="https://publications.waset.org/abstracts/search?q=catastrophes" title=" catastrophes"> catastrophes</a>, <a href="https://publications.waset.org/abstracts/search?q=busy%20period" title=" busy period"> busy period</a> </p> <a href="https://publications.waset.org/abstracts/21325/a-study-on-stochastic-integral-associated-with-catastrophes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21325.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">642</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20543</span> Client Hacked Server</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bagul%20Abhijeet">Bagul Abhijeet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Background: Client-Server model is the backbone of today’s internet communication. In which normal user can not have control over particular website or server? By using the same processing model one can have unauthorized access to particular server. In this paper, we discussed about application scenario of hacking for simple website or server consist of unauthorized way to access the server database. This application emerges to autonomously take direct access of simple website or server and retrieve all essential information maintain by administrator. In this system, IP address of server given as input to retrieve user-id and password of server. This leads to breaking administrative security of server and acquires the control of server database. Whereas virus helps to escape from server security by crashing the whole server. Objective: To control malicious attack and preventing all government website, and also find out illegal work to do hackers activity. Results: After implementing different hacking as well as non-hacking techniques, this system hacks simple web sites with normal security credentials. It provides access to server database and allow attacker to perform database operations from client machine. Above Figure shows the experimental result of this application upon different servers and provides satisfactory results as required. Conclusion: In this paper, we have presented a to view to hack the server which include some hacking as well as non-hacking methods. These algorithms and methods provide efficient way to hack server database. By breaking the network security allow to introduce new and better security framework. The terms “Hacking” not only consider for its illegal activities but also it should be use for strengthen our global network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hacking" title="Hacking">Hacking</a>, <a href="https://publications.waset.org/abstracts/search?q=Vulnerabilities" title=" Vulnerabilities"> Vulnerabilities</a>, <a href="https://publications.waset.org/abstracts/search?q=Dummy%20request" title=" Dummy request"> Dummy request</a>, <a href="https://publications.waset.org/abstracts/search?q=Virus" title=" Virus"> Virus</a>, <a href="https://publications.waset.org/abstracts/search?q=Server%20monitoring" title=" Server monitoring"> Server monitoring</a> </p> <a href="https://publications.waset.org/abstracts/36777/client-hacked-server" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36777.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">252</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20542</span> Modeling of Production Lines Systems with Layout Constraints</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sadegh%20Abebi">Sadegh Abebi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are problems with estimating time of product process of products, especially when there is variable serving time, like control stage. These problems will cause overestimation of process time. Layout constraints, reworking constraints and inflexible product schedule in multi product lines, needs a precise planning to reduce volume in particular situation of line stock. In this article, by analyzing real queue systems with layout constraints and by using concepts and principles of Markov chain in queue theory, a hybrid model has been presented. This model can be a base to assess queue systems with probable parameters of service. Here by presenting a case study, the proposed model will be described. so, production lines of a home application manufacturer will be analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Queuing%20theory" title="Queuing theory">Queuing theory</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20Chain" title=" Markov Chain"> Markov Chain</a>, <a href="https://publications.waset.org/abstracts/search?q=layout" title=" layout"> layout</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20balance" title=" line balance"> line balance</a> </p> <a href="https://publications.waset.org/abstracts/26003/modeling-of-production-lines-systems-with-layout-constraints" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26003.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">625</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20541</span> Performance Evaluation of Diverging Diamond Interchange Compared to Single Point Diamond Interchange in Riyadh City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Maged%20A.%20Mogalli">Maged A. Mogalli</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdullah%20I.%20Al-Mansour"> Abdullah I. Al-Mansour</a>, <a href="https://publications.waset.org/abstracts/search?q=Seongkwan%20Mark%20Lee"> Seongkwan Mark Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the last decades, population growth has gradually exceeded transportation infrastructure growth, and today’s transportation professionals are facing challenge on how to meet the mobility needs of a rising population especially in the absence of adequate public transport, as is the case in Saudi Arabia. The traffic movement congestion can be decreased by carrying out some appropriate alternative designs of interchanges such as diverging diamond interchange (DDI) and single diamond interchange (SPDI). In this paper, evaluation of newly implemented DDIs at the interchange of Makkah road with Prince Turki road and the interchange of King Khaled road with Prince Saud Ibn Mohammed Ibn Mugrin road in Riyadh city was carried out. The comparison between the DDI and SPDI is conducted by evaluating different measures of effectiveness (MOE) such as stop delay, average queue length, and number of stops. In this connection, each interchange type was evaluated for traffic flow at peak hours using micro-simulation program namely 'Synchro/SimTarffic' to measure its effectiveness such as stop delay, average queue length, and number of stops. The results of this study show that DDI provides a better result when compared with SPDI in terms of stope delay, average queue length, and number of stops. The stop delay for the SPDI is greater than DDI by three times. Also, the average queue length is approximately twice that of the SPDI when compared to the DDI. Furthermore, the number of stops for the SPDI is about twice as the DDI. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=single%20point%20diamond%20interchange" title="single point diamond interchange">single point diamond interchange</a>, <a href="https://publications.waset.org/abstracts/search?q=diverging%20diamond%20interchange" title=" diverging diamond interchange"> diverging diamond interchange</a>, <a href="https://publications.waset.org/abstracts/search?q=measures%20of%20effectiveness" title=" measures of effectiveness"> measures of effectiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/105752/performance-evaluation-of-diverging-diamond-interchange-compared-to-single-point-diamond-interchange-in-riyadh-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105752.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">258</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20540</span> Tracy: A Java Library to Render a 3D Graphical Human Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sina%20Saadati">Sina Saadati</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammadreza%20Razzazi"> Mohammadreza Razzazi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since Java is an object-oriented language, It can be used to solve a wide range of problems. One of the considerable usages of this language can be found in Agent-based modeling and simulation. Despite the significant power of Java, There is not an easy method to render a 3-dimensional human model. In this article, we are about to develop a library which helps modelers present a 3D human model and control it with Java. The library runs two server programs. The first one is a web page server that can connect to any browser and present an HTML code. The second server connects to the browser and controls the movement of the model. So, the modeler will be able to develop a simulation and display a good-looking human model without any knowledge of any graphical tools. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agent-based%20modeling%20and%20simulation" title="agent-based modeling and simulation">agent-based modeling and simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20model" title=" human model"> human model</a>, <a href="https://publications.waset.org/abstracts/search?q=graphics" title=" graphics"> graphics</a>, <a href="https://publications.waset.org/abstracts/search?q=Java" title=" Java"> Java</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20systems" title=" distributed systems"> distributed systems</a> </p> <a href="https://publications.waset.org/abstracts/150176/tracy-a-java-library-to-render-a-3d-graphical-human-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150176.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">111</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20539</span> Analysis of a Discrete-time Geo/G/1 Queue Integrated with (s, Q) Inventory Policy at a Service Facility</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akash%20Verma">Akash Verma</a>, <a href="https://publications.waset.org/abstracts/search?q=Sujit%20Kumar%20Samanta"> Sujit Kumar Samanta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study examines a discrete-time Geo/G/1 queueing-inventory system attached with (s, Q) inventory policy. Assume that the customers follow the Bernoulli process on arrival. Each customer demands a single item with arbitrarily distributed service time. The inventory is replenished by an outside supplier, and the lead time for the replenishment is determined by a geometric distribution. There is a single server and infinite waiting space in this facility. Demands must wait in the specified waiting area during a stock-out period. The customers are served on a first-come-first-served basis. With the help of the embedded Markov chain technique, we determine the joint probability distributions of the number of customers in the system and the number of items in stock at the post-departure epoch using the Matrix Analytic approach. We relate the system length distribution at post-departure and outside observer's epochs to determine the joint probability distribution at the outside observer's epoch. We use probability distributions at random epochs to determine the waiting time distribution. We obtain the performance measures to construct the cost function. The optimum values of the order quantity and reordering point are found numerically for the variety of model parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=discrete-time%20queueing%20inventory%20model" title="discrete-time queueing inventory model">discrete-time queueing inventory model</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20analytic%20method" title=" matrix analytic method"> matrix analytic method</a>, <a href="https://publications.waset.org/abstracts/search?q=waiting-time%20analysis" title=" waiting-time analysis"> waiting-time analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=cost%20optimization" title=" cost optimization"> cost optimization</a> </p> <a href="https://publications.waset.org/abstracts/186892/analysis-of-a-discrete-time-geog1-queue-integrated-with-s-q-inventory-policy-at-a-service-facility" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/186892.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">44</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20538</span> Avoiding Packet Drop for Improved through Put in the Multi-Hop Wireless N/W</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manish%20Kumar%20Rajak">Manish Kumar Rajak</a>, <a href="https://publications.waset.org/abstracts/search?q=Sanjay%20Gupta"> Sanjay Gupta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile ad hoc networks (MANETs) are infrastructure less and intercommunicate using single-hop and multi-hop paths. Network based congestion avoidance which involves managing the queues in the network devices is an integral part of any network. QoS: A set of service requirements that are met by the network while transferring a packet stream from a source to a destination. Especially in MANETs, packet loss results in increased overheads. This paper presents a new algorithm to avoid congestion using one or more queue on nodes and corresponding flow rate decided in advance for each node. When any node attains an initial value of queue then it sends this status to its downstream nodes which in turn uses the pre-decided flow rate of packet transfer to its upstream nodes. The flow rate on each node is adjusted according to the status received from its upstream nodes. This proposed algorithm uses the existing infrastructure to inform to other nodes about its current queue status. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mesh%20networks" title="mesh networks">mesh networks</a>, <a href="https://publications.waset.org/abstracts/search?q=MANET" title=" MANET"> MANET</a>, <a href="https://publications.waset.org/abstracts/search?q=packet%20count" title=" packet count"> packet count</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold" title=" threshold"> threshold</a>, <a href="https://publications.waset.org/abstracts/search?q=throughput" title=" throughput"> throughput</a> </p> <a href="https://publications.waset.org/abstracts/23702/avoiding-packet-drop-for-improved-through-put-in-the-multi-hop-wireless-nw" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23702.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">475</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20537</span> Computer Server Virtualization </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pradeep%20M.%20C.%20Chand">Pradeep M. C. Chand </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Virtual infrastructure initiatives often spring from data center server consolidation projects, which focus on reducing existing infrastructure “box count”, retiring older hardware or life-extending legacy applications. Server consolidation benefits result from a reduction in the overall number of systems and related recurring costs (power, cooling, rack space, etc.) and also helps in the reduction of heat to the environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=server%20virtualization" title="server virtualization">server virtualization</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20center" title=" data center"> data center</a>, <a href="https://publications.waset.org/abstracts/search?q=consolidation" title=" consolidation"> consolidation</a>, <a href="https://publications.waset.org/abstracts/search?q=project" title=" project"> project</a> </p> <a href="https://publications.waset.org/abstracts/20268/computer-server-virtualization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20268.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">530</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20536</span> Autonomic Recovery Plan with Server Virtualization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Hameed">S. Hameed</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Anwer"> S. Anwer</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Saad"> M. Saad</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Saady"> M. Saady</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For autonomic recovery with server virtualization, a cogent plan that includes recovery techniques and backups with virtualized servers can be developed instead of assigning an idle server to backup operations. In addition to hardware cost reduction and data center trail, the disaster recovery plan can ensure system uptime and to meet objectives of high availability, recovery time, recovery point, server provisioning, and quality of services. This autonomic solution would also support disaster management, testing, and development of the recovery site. In this research, a workflow plan is proposed for supporting disaster recovery with virtualization providing virtual monitoring, requirements engineering, solution decision making, quality testing, and disaster management. This recovery model would make disaster recovery a lot easier, faster, and less error prone. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomous%20intelligence" title="autonomous intelligence">autonomous intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=disaster%20recovery" title=" disaster recovery"> disaster recovery</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title=" cloud computing"> cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=server%20virtualization" title=" server virtualization"> server virtualization</a> </p> <a href="https://publications.waset.org/abstracts/129654/autonomic-recovery-plan-with-server-virtualization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129654.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">162</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20535</span> Steady-State Behavior of a Multi-Phase M/M/1 Queue in Random Evolution Subject to Catastrophe Failure</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reni%20M.%20Sagayaraj">Reni M. Sagayaraj</a>, <a href="https://publications.waset.org/abstracts/search?q=Anand%20Gnana%20S.%20Selvam"> Anand Gnana S. Selvam</a>, <a href="https://publications.waset.org/abstracts/search?q=Reynald%20R.%20Susainathan"> Reynald R. Susainathan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider stochastic queueing models for Steady-state behavior of a multi-phase M/M/1 queue in random evolution subject to catastrophe failure. The arrival flow of customers is described by a marked Markovian arrival process. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the investigation of the system we use a generalized phase-type service time distribution. This model contains a repair state, when a catastrophe occurs the system is transferred to the failure state. The paper focuses on the steady-state equation, and observes that, the steady-state behavior of the underlying queueing model along with the average queue size is analyzed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=M%2FG%2F1%20queuing%20system" title="M/G/1 queuing system">M/G/1 queuing system</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-phase" title=" multi-phase"> multi-phase</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20evolution" title=" random evolution"> random evolution</a>, <a href="https://publications.waset.org/abstracts/search?q=steady-state%20equation" title=" steady-state equation"> steady-state equation</a>, <a href="https://publications.waset.org/abstracts/search?q=catastrophe%20failure" title=" catastrophe failure"> catastrophe failure</a> </p> <a href="https://publications.waset.org/abstracts/53659/steady-state-behavior-of-a-multi-phase-mm1-queue-in-random-evolution-subject-to-catastrophe-failure" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53659.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">328</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20534</span> Distributed Framework for Pothole Detection and Monitoring Using Federated Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ezil%20Sam%20Leni">Ezil Sam Leni</a>, <a href="https://publications.waset.org/abstracts/search?q=Shalen%20S."> Shalen S.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Transport service monitoring and upkeep are essential components of smart city initiatives. The main risks to the relevant departments and authorities are the ever-increasing vehicular traffic and the conditions of the roads. In India, the economy is greatly impacted by the road transport sector. In 2021, the Ministry of Road Transport and Highways Transport, Government of India, produced a report with statistical data on traffic accidents. The data included the number of fatalities, injuries, and other pertinent criteria. This study proposes a distributed infrastructure for the monitoring, detection, and reporting of potholes to the appropriate authorities. In a distributed environment, the nodes are the edge devices, and local edge servers, and global servers. The edge devices receive the initial model to be employed from the global server. The YOLOv8 model for pothole detection is used in the edge devices. The edge devices run the pothole detection model, gather the pothole images on their path, and send the updates to the nearby edge server. The local edge server selects the clients for its aggregation process, aggregates the model updates and sends the updates to the global server. The global server collects the updates from the local edge servers, performs aggregation and derives the updated model. The updated model has the information about the potholes received from the local edge servers and notifies the updates to the local edge servers and concerned authorities for monitoring and maintenance of road conditions. The entire process is implemented in FedCV distributed environment with the implementation using the client-server model and aggregation entities. After choosing the clients for its aggregation process, the local edge server gathers the model updates and transmits them to the global server. After gathering the updates from the regional edge servers, the global server aggregates them and creates the updated model. Performance indicators and the experimentation environment are assessed, discussed, and presented. Accelerometer data may be taken into consideration for improved performance in the future development of this study, in addition to the images captured from the transportation routes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=federated%20Learning" title="federated Learning">federated Learning</a>, <a href="https://publications.waset.org/abstracts/search?q=pothole%20detection" title=" pothole detection"> pothole detection</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20framework" title=" distributed framework"> distributed framework</a>, <a href="https://publications.waset.org/abstracts/search?q=federated%20averaging" title=" federated averaging"> federated averaging</a> </p> <a href="https://publications.waset.org/abstracts/176254/distributed-framework-for-pothole-detection-and-monitoring-using-federated-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176254.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">104</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20533</span> Hierarchical Queue-Based Task Scheduling with CloudSim</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wanqing%20You">Wanqing You</a>, <a href="https://publications.waset.org/abstracts/search?q=Kai%20Qian"> Kai Qian</a>, <a href="https://publications.waset.org/abstracts/search?q=Ying%20Qian"> Ying Qian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The concepts of Cloud Computing provide users with infrastructure, platform and software as service, which make those services more accessible for people via Internet. To better analysis the performance of Cloud Computing provisioning policies as well as resources allocation strategies, a toolkit named CloudSim proposed. With CloudSim, the Cloud Computing environment can be easily constructed by modelling and simulating cloud computing components, such as datacenter, host, and virtual machine. A good scheduling strategy is the key to achieve the load balancing among different machines as well as to improve the utilization of basic resources. Recently, the existing scheduling algorithms may work well in some presumptive cases in a single machine; however they are unable to make the best decision for the unforeseen future. In real world scenario, there would be numbers of tasks as well as several virtual machines working in parallel. Based on the concepts of multi-queue, this paper presents a new scheduling algorithm to schedule tasks with CloudSim by taking into account several parameters, the machines’ capacity, the priority of tasks and the history log. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hierarchical%20queue" title="hierarchical queue">hierarchical queue</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a>, <a href="https://publications.waset.org/abstracts/search?q=CloudSim" title=" CloudSim"> CloudSim</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20technology" title=" information technology"> information technology</a> </p> <a href="https://publications.waset.org/abstracts/2721/hierarchical-queue-based-task-scheduling-with-cloudsim" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2721.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">422</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20532</span> Scheduling Algorithm Based on Load-Aware Queue Partitioning in Heterogeneous Multi-Core Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hong%20Kai">Hong Kai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhong%20Jun%20Jie"> Zhong Jun Jie</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen%20Lin%20Qi"> Chen Lin Qi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Chen%20Guang"> Wang Chen Guang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are inefficient global scheduling parallelism and local scheduling parallelism prone to processor starvation in current scheduling algorithms. Regarding this issue, this paper proposed a load-aware queue partitioning scheduling strategy by first allocating the queues according to the number of processor cores, calculating the load factor to specify the load queue capacity, and it assigned the awaiting nodes to the appropriate perceptual queues through the precursor nodes and the communication computation overhead. At the same time, real-time computation of the load factor could effectively prevent the processor from being starved for a long time. Experimental comparison with two classical algorithms shows that there is a certain improvement in both performance metrics of scheduling length and task speedup ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load-aware" title="load-aware">load-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithm" title=" scheduling algorithm"> scheduling algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=perceptual%20queue" title=" perceptual queue"> perceptual queue</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20multi-core" title=" heterogeneous multi-core"> heterogeneous multi-core</a> </p> <a href="https://publications.waset.org/abstracts/162110/scheduling-algorithm-based-on-load-aware-queue-partitioning-in-heterogeneous-multi-core-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162110.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">146</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20531</span> On the Inequality between Queue Length and Virtual Waiting Time in Open Queueing Networks under Conditions of Heavy Traffic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Saulius%20Minkevicius">Saulius Minkevicius</a>, <a href="https://publications.waset.org/abstracts/search?q=Edvinas%20Greicius"> Edvinas Greicius</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper is devoted to the analysis of queueing systems in the context of the network and communications theory. We investigate the inequality in an open queueing network and its applications to the theorems in heavy traffic conditions (fluid approximation, functional limit theorem, and law of the iterated logarithm) for a queue of customers in an open queueing network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fluid%20approximation" title="fluid approximation">fluid approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=heavy%20traffic" title=" heavy traffic"> heavy traffic</a>, <a href="https://publications.waset.org/abstracts/search?q=models%20of%20information%20systems" title=" models of information systems"> models of information systems</a>, <a href="https://publications.waset.org/abstracts/search?q=open%20queueing%20network" title=" open queueing network"> open queueing network</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20length%20of%20%20customers" title=" queue length of customers"> queue length of customers</a>, <a href="https://publications.waset.org/abstracts/search?q=queueing%20theory" title=" queueing theory"> queueing theory</a> </p> <a href="https://publications.waset.org/abstracts/76784/on-the-inequality-between-queue-length-and-virtual-waiting-time-in-open-queueing-networks-under-conditions-of-heavy-traffic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76784.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">286</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20530</span> Presenting Internals of Networks Using Bare Machine Technology</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Joel%20Weymouth">Joel Weymouth</a>, <a href="https://publications.waset.org/abstracts/search?q=Ramesh%20K.%20Karne"> Ramesh K. Karne</a>, <a href="https://publications.waset.org/abstracts/search?q=Alexander%20L.%20Wijesinha"> Alexander L. Wijesinha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bare Machine Internet is part of the Bare Machine Computing (BMC) paradigm. It is used in programming application ns to run directly on a device. It is software that runs directly against the hardware using CPU, Memory, and I/O. The software application runs without an Operating System and resident mass storage. An important part of the BMC paradigm is the Bare Machine Internet. It utilizes an Application Development model software that interfaces directly with the hardware on a network server and file server. Because it is “bare,” it is a powerful teaching and research tool that can readily display the internals of the network protocols, software, and hardware of the applications running on the Bare Server. It was also demonstrated that the bare server was accessible by laptop and by smartphone/android. The purpose was to show the further practicality of Bare Internet in Computer Engineering and Computer Science Education and Research. It was also to show that an undergraduate student could take advantage of a bare server with any device and any browser at any release version connected to the internet. This paper presents the Bare Web Server as an educational tool. We will discuss possible applications of this paradigm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bare%20machine%20computing" title="bare machine computing">bare machine computing</a>, <a href="https://publications.waset.org/abstracts/search?q=online%20research" title=" online research"> online research</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20technology" title=" network technology"> network technology</a>, <a href="https://publications.waset.org/abstracts/search?q=visualizing%20network%20internals" title=" visualizing network internals"> visualizing network internals</a> </p> <a href="https://publications.waset.org/abstracts/142622/presenting-internals-of-networks-using-bare-machine-technology" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142622.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">172</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20529</span> A Non-Invasive Blood Glucose Monitoring System Using near-Infrared Spectroscopy with Remote Data Logging</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bodhayan%20Nandi">Bodhayan Nandi</a>, <a href="https://publications.waset.org/abstracts/search?q=Shubhajit%20Roy%20Chowdhury"> Shubhajit Roy Chowdhury</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the development of a portable blood glucose monitoring device based on Near-Infrared Spectroscopy. The system supports Internet connectivity through WiFi and uploads the time series data of glucose concentration of patients to a server. In addition, the server is given sufficient intelligence to predict the future pathophysiological state of a patient given the current and past pathophysiological data. This will enable to prognosticate the approaching critical condition of the patient much before the critical condition actually occurs.The server hosts web applications to allow authorized users to monitor the data remotely. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non%20invasive" title="non invasive">non invasive</a>, <a href="https://publications.waset.org/abstracts/search?q=blood%20glucose%20concentration" title=" blood glucose concentration"> blood glucose concentration</a>, <a href="https://publications.waset.org/abstracts/search?q=microcontroller" title=" microcontroller"> microcontroller</a>, <a href="https://publications.waset.org/abstracts/search?q=IoT" title=" IoT"> IoT</a>, <a href="https://publications.waset.org/abstracts/search?q=application%20server" title=" application server"> application server</a>, <a href="https://publications.waset.org/abstracts/search?q=database%20server" title=" database server"> database server</a> </p> <a href="https://publications.waset.org/abstracts/85488/a-non-invasive-blood-glucose-monitoring-system-using-near-infrared-spectroscopy-with-remote-data-logging" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85488.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">220</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20528</span> Automated Server Configuration Management using Ansible</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kartik%20Mahajan">Kartik Mahajan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> DevOps methodologies streamline software development and operations, promoting collaboration and automation. Traditional server management often relies on manual, repetitive tasks, leading to inefficiencies, potential errors, and increased operational costs. Ansible, as a configuration management tool, presents a compelling solution for automating infrastructure management processes. This review paper explores the implementation and testing of Ansible for server management, specifically focusing on automated user account configuration. By replacing manual procedures with Ansible playbooks, we aim to optimize server management, reduce human error, and potentially mitigate operational expenses. This study offers insights into Ansible’s efficacy within a DevOps context, highlighting its potential to transform server administration practices. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud" title="cloud">cloud</a>, <a href="https://publications.waset.org/abstracts/search?q=Devops" title=" Devops"> Devops</a>, <a href="https://publications.waset.org/abstracts/search?q=automation" title=" automation"> automation</a>, <a href="https://publications.waset.org/abstracts/search?q=ansible" title=" ansible"> ansible</a> </p> <a href="https://publications.waset.org/abstracts/184587/automated-server-configuration-management-using-ansible" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184587.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">44</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20527</span> Performance Evaluation of a Prioritized, Limited Multi-Server Processor-Sharing System that Includes Servers with Various Capacities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yoshiaki%20Shikata">Yoshiaki Shikata</a>, <a href="https://publications.waset.org/abstracts/search?q=Nobutane%20Hanayama"> Nobutane Hanayama</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a prioritized, limited multi-server processor sharing (PS) system where each server has various capacities, and N (≥2) priority classes are allowed in each PS server. In each prioritized, limited server, different service ratio is assigned to each class request, and the number of requests to be processed is limited to less than a certain number. Routing strategies of such prioritized, limited multi-server PS systems that take into account the capacity of each server are also presented, and a performance evaluation procedure for these strategies is discussed. Practical performance measures of these strategies, such as loss probability, mean waiting time, and mean sojourn time, are evaluated via simulation. In the PS server, at the arrival (or departure) of a request, the extension (shortening) of the remaining sojourn time of each request receiving service can be calculated by using the number of requests of each class and the priority ratio. Utilising a simulation program which executes these events and calculations, the performance of the proposed prioritized, limited multi-server PS rule can be analyzed. From the evaluation results, most suitable routing strategy for the loss or waiting system is clarified. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=processor%20sharing" title="processor sharing">processor sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-server" title=" multi-server"> multi-server</a>, <a href="https://publications.waset.org/abstracts/search?q=various%20capacity" title=" various capacity"> various capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=N-priority%20classes" title=" N-priority classes"> N-priority classes</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20strategy" title=" routing strategy"> routing strategy</a>, <a href="https://publications.waset.org/abstracts/search?q=loss%20probability" title=" loss probability"> loss probability</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20sojourn%20time" title=" mean sojourn time"> mean sojourn time</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20waiting%20time" title=" mean waiting time"> mean waiting time</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/45569/performance-evaluation-of-a-prioritized-limited-multi-server-processor-sharing-system-that-includes-servers-with-various-capacities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45569.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">332</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">20526</span> Multi Tier Data Collection and Estimation, Utilizing Queue Model in Wireless Sensor Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amirhossein%20Mohajerzadeh">Amirhossein Mohajerzadeh</a>, <a href="https://publications.waset.org/abstracts/search?q=Abolghasem%20Mohajerzadeh"> Abolghasem Mohajerzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, target parameter is estimated with desirable precision in hierarchical wireless sensor networks (WSN) while the proposed algorithm also tries to prolong network lifetime as much as possible, using efficient data collecting algorithm. Target parameter distribution function is considered unknown. Sensor nodes sense the environment and send the data to the base station called fusion center (FC) using hierarchical data collecting algorithm. FC builds underlying phenomena based on collected data. Considering the aggregation level, x, the goal is providing the essential infrastructure to find the best value for aggregation level in order to prolong network lifetime as much as possible, while desirable accuracy is guaranteed (required sample size is fully depended on desirable precision). First, the sample size calculation algorithm is discussed, second, the average queue length based on M/M[x]/1/K queue model is determined and it is used for energy consumption calculation. Nodes can decrease transmission cost by aggregating incoming data. Furthermore, the performance of the new algorithm is evaluated in terms of lifetime and estimation accuracy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=aggregation" title="aggregation">aggregation</a>, <a href="https://publications.waset.org/abstracts/search?q=estimation" title=" estimation"> estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=queuing" title=" queuing"> queuing</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20network" title=" wireless sensor network"> wireless sensor network</a> </p> <a href="https://publications.waset.org/abstracts/92838/multi-tier-data-collection-and-estimation-utilizing-queue-model-in-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92838.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">186</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=685">685</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=686">686</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=single%E2%80%93server%20queue%20model&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>