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: M/G/1/N queue with vacations</title> <meta name="description" content="Search results for: M/G/1/N queue with vacations"> <meta name="keywords" content="M/G/1/N queue with vacations"> <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="M/G/1/N queue with vacations" 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="M/G/1/N queue with vacations"> <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> 68</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: M/G/1/N queue with vacations</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">68</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">67</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">66</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">185</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">65</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">64</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">63</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">323</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">62</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">61</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">60</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">145</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">59</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">58</span> A Two Level Load Balancing Approach for Cloud Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anurag%20Jain">Anurag Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajneesh%20Kumar"> Rajneesh Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing is the outcome of rapid growth of internet. Due to elastic nature of cloud computing and unpredictable behavior of user, load balancing is the major issue in cloud computing paradigm. An efficient load balancing technique can improve the performance in terms of efficient resource utilization and higher customer satisfaction. Load balancing can be implemented through task scheduling, resource allocation and task migration. Various parameters to analyze the performance of load balancing approach are response time, cost, data processing time and throughput. This paper demonstrates a two level load balancer approach by combining join idle queue and join shortest queue approach. Authors have used cloud analyst simulator to test proposed two level load balancer approach. The results are analyzed and compared with the existing algorithms and as observed, proposed work is one step ahead of existing techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20analyst" title="cloud analyst">cloud analyst</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=join%20idle%20queue" title=" join idle queue"> join idle queue</a>, <a href="https://publications.waset.org/abstracts/search?q=join%20shortest%20queue" title=" join shortest queue"> join shortest 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=task%20scheduling" title=" task scheduling"> task scheduling</a> </p> <a href="https://publications.waset.org/abstracts/46562/a-two-level-load-balancing-approach-for-cloud-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46562.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">431</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">57</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">624</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">56</span> Repair Workshop Queue System Modification Using Priority Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=C.%20Okonkwo%20Ugochukwu">C. Okonkwo Ugochukwu</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Sinebe%20Jude"> E. Sinebe Jude</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Odoh%20Blessing"> N. Odoh Blessing</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Okafor%20Christian"> E. Okafor Christian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a modification on repair workshop queuing system using multi priority scheme was carried out. Chi square goodness of fit test was used to determine the random distribution of the inter arrival time and service time of crankshafts that come for maintenance in the workshop. The chi square values obtained for all the prioritized classes show that the distribution conforms to Poisson distribution. The mean waiting time in queue results of non-preemptive priority for 1st, 2nd and 3rd classes show 0.066, 0.09, and 0.224 day respectively, while preemptive priority show 0.007, 0.036 and 0.258 day. However, when non priority is used, which obviously has no class distinction it amounts to 0.17 days. From the results, one can observe that the preemptive priority system provides a very dramatic improvement over the non preemptive priority as it concerns arrivals that are of higher priority. However, the improvement has a detrimental effect on the low priority class. The trend of the results is similar to the mean waiting time in the system as a result of addition of the actual service time. Even though the mean waiting time for the queue and that of the system for no priority takes the least time when compared with the least priority, urgent and semi-urgent jobs will terribly suffer which will most likely result in reneging or balking of many urgent jobs. Hence, the adoption of priority scheme in this type of scenario will result in huge profit to the Company and more customer satisfaction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=queue" title="queue">queue</a>, <a href="https://publications.waset.org/abstracts/search?q=priority%20class" title=" priority class"> priority class</a>, <a href="https://publications.waset.org/abstracts/search?q=preemptive" title=" preemptive"> preemptive</a>, <a href="https://publications.waset.org/abstracts/search?q=non-preemptive" title=" non-preemptive"> non-preemptive</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20waiting%20time" title=" mean waiting time"> mean waiting time</a> </p> <a href="https://publications.waset.org/abstracts/69985/repair-workshop-queue-system-modification-using-priority-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69985.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">396</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">55</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">474</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">54</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">53</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">52</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">51</span> Algorithms for Fast Computation of Pan Matrix Profiles of Time Series Under Unnormalized Euclidean Distances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Zhang">Jing Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Nikovski"> Daniel Nikovski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an approximation algorithm called LINKUMP to compute the Pan Matrix Profile (PMP) under the unnormalized l∞ distance (useful for value-based similarity search) using double-ended queue and linear interpolation. The algorithm has comparable time/space complexities as the state-of-the-art algorithm for typical PMP computation under the normalized l₂ distance (useful for shape-based similarity search). We validate its efficiency and effectiveness through extensive numerical experiments and a real-world anomaly detection application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pan%20matrix%20profile" title="pan matrix profile">pan matrix profile</a>, <a href="https://publications.waset.org/abstracts/search?q=unnormalized%20euclidean%20distance" title=" unnormalized euclidean distance"> unnormalized euclidean distance</a>, <a href="https://publications.waset.org/abstracts/search?q=double-ended%20queue" title=" double-ended queue"> double-ended queue</a>, <a href="https://publications.waset.org/abstracts/search?q=discord%20discovery" title=" discord discovery"> discord discovery</a>, <a href="https://publications.waset.org/abstracts/search?q=anomaly%20detection" title=" anomaly detection"> anomaly detection</a> </p> <a href="https://publications.waset.org/abstracts/144363/algorithms-for-fast-computation-of-pan-matrix-profiles-of-time-series-under-unnormalized-euclidean-distances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144363.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">247</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">50</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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">49</span> VISSIM Modeling of Driver Behavior at Connecticut Roundabouts</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=F.%20Clara%20Fang">F. Clara Fang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hernan%20Castaneda"> Hernan Castaneda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Connecticut Department of Transportation (ConnDOT) has constructed four roundabouts in the State of Connecticut within the past ten years. VISSIM traffic simulation software was utilized to analyze these roundabouts during their design phase. The queue length and level of service observed in the field appear to be better than predicted by the VISSIM model. The objectives of this project are to: identify VISSIM input variables most critical to accurate modeling; recommend VISSIM calibration factors; and, provide other recommendations for roundabout traffic operations modeling. Traffic data were collected at these roundabouts using Miovision Technologies. Cameras were set up to capture vehicle circulating activity and entry behavior for two weekdays. A large sample size of filed data was analyzed to achieve accurate and statistically significant results. The data extracted from the videos include: vehicle circulating speed; critical gap estimated by Maximum Likelihood Method; peak hour volume; follow-up headway; travel time; and, vehicle queue length. A VISSIM simulation of existing roundabouts was built to compare both queue length and travel time predicted from simulation with measured in the field. The research investigated a variety of simulation parameters as calibration factors for describing driver behaviors at roundabouts. Among them, critical gap is the most effective calibration variable in roundabout simulation. It has a significant impact to queue length, particularly when the volume is higher. The results will improve the design of future roundabouts in Connecticut and provide decision makers with insights on the relationship between various choices and future performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=driver%20critical%20gap" title="driver critical gap">driver critical gap</a>, <a href="https://publications.waset.org/abstracts/search?q=roundabout%20analysis" title=" roundabout analysis"> roundabout analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=VISSIM%20modeling" title=" VISSIM modeling"> VISSIM modeling</a> </p> <a href="https://publications.waset.org/abstracts/43805/vissim-modeling-of-driver-behavior-at-connecticut-roundabouts" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43805.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">288</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">48</span> Management of Empty Containers by Consignees in the Hinterland</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Benjamin%20Legros">Benjamin Legros</a>, <a href="https://publications.waset.org/abstracts/search?q=Jan%20Fransoo"> Jan Fransoo</a>, <a href="https://publications.waset.org/abstracts/search?q=Oualid%20Jouini"> Oualid Jouini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study aims to evaluate street-turn strategies for empty container repositioning in the hinterland. Containers arrive over time at the (importer) consignee, while the demand for containers arises from the (exporter) shipper. A match can be operated between an empty container from the consignee and the load from the shipper. Therefore, we model the system as a double-ended queue with non-zero matching time and a limited number of resources in order to optimize the reposition- ing decisions. We determine the performance measures when the consignee operates using a fixed withholding threshold policy. We show that the matching time mainly plays a role in the matching proportion, while under a certain duration, it only marginally impacts the consignee’s inventory policy and cost per container. Also, the withholding level is mainly determined by the shipper’s production rate. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=container" title="container">container</a>, <a href="https://publications.waset.org/abstracts/search?q=double-ended%20queue" title=" double-ended queue"> double-ended queue</a>, <a href="https://publications.waset.org/abstracts/search?q=inventory" title=" inventory"> inventory</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20decision%20process" title=" Markov decision process"> Markov decision process</a>, <a href="https://publications.waset.org/abstracts/search?q=non-zero%20matching%20time" title=" non-zero matching time"> non-zero matching time</a>, <a href="https://publications.waset.org/abstracts/search?q=street-turn" title=" street-turn"> street-turn</a> </p> <a href="https://publications.waset.org/abstracts/159800/management-of-empty-containers-by-consignees-in-the-hinterland" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159800.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">141</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">47</span> Covariance of the Queue Process Fed by Isonormal Gaussian Input Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samaneh%20Rahimirshnani">Samaneh Rahimirshnani</a>, <a href="https://publications.waset.org/abstracts/search?q=Hossein%20Jafari"> Hossein Jafari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we consider fluid queueing processes fed by an isonormal Gaussian process. We study the correlation structure of the queueing process and the rate of convergence of the running supremum in the queueing process. The Malliavin calculus techniques are applied to obtain relations that show the workload process inherits the dependence properties of the input process. As examples, we consider two isonormal Gaussian processes, the sub-fractional Brownian motion (SFBM) and the fractional Brownian motion (FBM). For these examples, we obtain upper bounds for the covariance function of the queueing process and its rate of convergence to zero. We also discover that the rate of convergence of the queueing process is related to the structure of the covariance function of the input process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=queue%20length%20process" title="queue length process">queue length process</a>, <a href="https://publications.waset.org/abstracts/search?q=Malliavin%20calculus" title=" Malliavin calculus"> Malliavin calculus</a>, <a href="https://publications.waset.org/abstracts/search?q=covariance%20function" title=" covariance function"> covariance function</a>, <a href="https://publications.waset.org/abstracts/search?q=fractional%20Brownian%20motion" title=" fractional Brownian motion"> fractional Brownian motion</a>, <a href="https://publications.waset.org/abstracts/search?q=sub-fractional%20Brownian%20motion" title=" sub-fractional Brownian motion"> sub-fractional Brownian motion</a> </p> <a href="https://publications.waset.org/abstracts/182769/covariance-of-the-queue-process-fed-by-isonormal-gaussian-input-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182769.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">63</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">46</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">503</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">45</span> Effect of Traffic Composition on Delay and Saturation Flow at Signal Controlled Intersections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arpita%20Saha">Arpita Saha</a>, <a href="https://publications.waset.org/abstracts/search?q=Apoorv%20Jain"> Apoorv Jain</a>, <a href="https://publications.waset.org/abstracts/search?q=Satish%20Chandra"> Satish Chandra</a>, <a href="https://publications.waset.org/abstracts/search?q=Indrajit%20Ghosh"> Indrajit Ghosh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Level of service at a signal controlled intersection is directly measured from the delay. Similarly, saturation flow rate is a fundamental parameter to measure the intersection capacity. The present study calculates vehicle arrival rate, departure rate, and queue length for every five seconds interval in each cycle. Based on the queue lengths, the total delay of the cycle has been calculated using Simpson’s 1/3rd rule. Saturation flow has been estimated in terms of veh/hr of green/lane for every five seconds interval of the green period until at least three vehicles are left to cross the stop line. Vehicle composition shows an immense effect on total delay and saturation flow rate. The increase in two-wheeler proportion increases the saturation flow rate and reduces the total delay per vehicle significantly. Additionally, an increase in the heavy vehicle proportion reduces the saturation flow rate and increases the total delay for each vehicle. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=delay" title="delay">delay</a>, <a href="https://publications.waset.org/abstracts/search?q=saturation%20flow" title=" saturation flow"> saturation flow</a>, <a href="https://publications.waset.org/abstracts/search?q=signalised%20intersection" title=" signalised intersection"> signalised intersection</a>, <a href="https://publications.waset.org/abstracts/search?q=vehicle%20composition" title=" vehicle composition"> vehicle composition</a> </p> <a href="https://publications.waset.org/abstracts/62341/effect-of-traffic-composition-on-delay-and-saturation-flow-at-signal-controlled-intersections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62341.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">464</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">44</span> Evaluation of the Performance Measures of Two-Lane Roundabout and Turbo Roundabout with Varying Truck Percentages</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Evangelos%20Kaisar">Evangelos Kaisar</a>, <a href="https://publications.waset.org/abstracts/search?q=Anika%20Tabassum"> Anika Tabassum</a>, <a href="https://publications.waset.org/abstracts/search?q=Taraneh%20Ardalan"> Taraneh Ardalan</a>, <a href="https://publications.waset.org/abstracts/search?q=Majed%20Al-Ghandour"> Majed Al-Ghandour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The economy of any country is dependent on its ability to accommodate the movement and delivery of goods. The demand for goods movement and services increases truck traffic on highways and inside the cities. The livability of most cities is directly affected by the congestion and environmental impacts of trucks, which are the backbone of the urban freight system. Better operation of heavy vehicles on highways and arterials could lead to the network’s efficiency and reliability. In many cases, roundabouts can respond better than at-level intersections to enable traffic operations with increased safety for both cars and heavy vehicles. Recently emerged, the concept of turbo-roundabout is a viable alternative to the two-lane roundabout aiming to improve traffic efficiency. The primary objective of this study is to evaluate the operation and performance level of an at-grade intersection, a conventional two-lane roundabout, and a basic turbo roundabout for freight movements. To analyze and evaluate the performances of the signalized intersections and the roundabouts, micro simulation models were developed PTV VISSIM. The networks chosen for this analysis in this study are to experiment and evaluate changes in the performance of the movement of vehicles with different geometric and flow scenarios. There are several scenarios that were examined when attempting to assess the impacts of various geometric designs on vehicle movements. The overall traffic efficiency depends on the geometric layout of the intersections, which consists of traffic congestion rate, hourly volume, frequency of heavy vehicles, type of road, and the ratio of major-street versus side-street traffic. The traffic performance was determined by evaluating the delay time, number of stops, and queue length of each intersection for varying truck percentages. The results indicate that turbo-roundabouts can replace signalized intersections and two-lane roundabouts only when the traffic demand is low, even with high truck volume. More specifically, it is clear that two-lane roundabouts are seen to have shorter queue lengths compared to signalized intersections and turbo-roundabouts. For instance, considering the scenario where the volume is highest, and the truck movement and left turn movement are maximum, the signalized intersection has 3 times, and the turbo-roundabout has 5 times longer queue length than a two-lane roundabout in major roads. Similarly, on minor roads, signalized intersections and turbo-roundabouts have 11 times longer queue lengths than two-lane roundabouts for the same scenario. As explained from all the developed scenarios, while the traffic demand lowers, the queue lengths of turbo-roundabouts shorten. This proves that turbo roundabouts perform well for low and medium traffic demand. The results indicate that turbo-roundabouts can replace signalized intersections and two-lane roundabouts only when the traffic demand is low, even with high truck volume. Finally, this study provides recommendations on the conditions under which different intersections perform better than each other. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=At-grade%20intersection" title="At-grade intersection">At-grade intersection</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=turbo-roundabout" title=" turbo-roundabout"> turbo-roundabout</a>, <a href="https://publications.waset.org/abstracts/search?q=two-lane%20roundabout" title=" two-lane roundabout"> two-lane roundabout</a> </p> <a href="https://publications.waset.org/abstracts/177548/evaluation-of-the-performance-measures-of-two-lane-roundabout-and-turbo-roundabout-with-varying-truck-percentages" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/177548.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">149</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">43</span> Management and Genetic Characterization of Local Sheep Breeds for Better Productive and Adaptive Traits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Bedhiaf-Romdhani">Sonia Bedhiaf-Romdhani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The sheep (Ovis aries) was domesticated, approximately 11,000 years ago (YBP), in the Fertile Crescent from Asian Mouflon (Ovis Orientalis). The Northern African (NA) sheep is 7,000 years old, represents a remarkable diversity of sheep populations reared under traditional and low input farming systems (LIFS) over millennia. The majority of small ruminants in developing countries are encountered in low input production systems and the resilience of local communities in rural areas is often linked to the wellbeing of small ruminants. Regardless of the rich biodiversity encountered in sheep ecotypes there are four main sheep breeds in the country with 61,6 and 35.4 percents of Barbarine (fat tail breed) and Queue Fine de l’Ouest (thin tail breed), respectively. Phoenicians introduced the Barbarine sheep from the steppes of Central Asia in the Carthaginian period, 3000 years ago. The Queue Fine de l’Ouest is a thin-tailed meat breed heavily concentrated in the Western and the central semi-arid regions. The Noire de Thibar breed, involving mutton-fine wool producing animals, has been on the verge of extinction, it’s a composite black coated sheep breed found in the northern sub-humid region because of its higher nutritional requirements and non-tolerance of the prevailing harsher condition. The D'Man breed, originated from Morocco, is mainly located in the southern oases of the extreme arid ecosystem. A genetic investigation of Tunisian sheep breeds using a genome-wide scan of approximately 50,000 SNPs was performed. Genetic analysis of relationship between breeds highlighted the genetic differentiation of Noire de Thibar breed from the other local breeds, reflecting the effect of past events of introgression of European gene pool. The Queue Fine de l’Ouest breed showed a genetic heterogeneity and was close to Barbarine. The D'Man breed shared a considerable gene flow with the thin-tailed Queue Fine de l'Ouest breed. Native small ruminants breeds, are capable to be efficiently productive if essential ingredients and coherent breeding schemes are implemented and followed. Assessing the status of genetic variability of native sheep breeds could provide important clues for research and policy makers to devise better strategies for the conservation and management of genetic resources. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sheep" title="sheep">sheep</a>, <a href="https://publications.waset.org/abstracts/search?q=farming%20systems" title=" farming systems"> farming systems</a>, <a href="https://publications.waset.org/abstracts/search?q=diversity" title=" diversity"> diversity</a>, <a href="https://publications.waset.org/abstracts/search?q=SNPs." title=" SNPs."> SNPs.</a> </p> <a href="https://publications.waset.org/abstracts/149566/management-and-genetic-characterization-of-local-sheep-breeds-for-better-productive-and-adaptive-traits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/149566.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">147</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">42</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">41</span> Detecting and Thwarting Interest Flooding Attack in Information Centric Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vimala%20Rani%20P">Vimala Rani P</a>, <a href="https://publications.waset.org/abstracts/search?q=Narasimha%20Malikarjunan"> Narasimha Malikarjunan</a>, <a href="https://publications.waset.org/abstracts/search?q=Mercy%20Shalinie%20S"> Mercy Shalinie S</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data Networking was brought forth as an instantiation of information-centric networking. The attackers can send a colossal number of spoofs to take hold of the Pending Interest Table (PIT) named an Interest Flooding attack (IFA) since the in- interests are recorded in the PITs of the intermediate routers until they receive corresponding Data Packets are go beyond the time limit. These attacks can be detrimental to network performance. PIT expiration rate or the Interest satisfaction rate, which cannot differentiate the IFA from attacks, is the criterion Traditional IFA detection techniques are concerned with. Threshold values can casually affect Threshold-based traditional methods. This article proposes an accurate IFA detection mechanism based on a Multiple Feature-based Extreme Learning Machine (MF-ELM). Accuracy of the attack detection can be increased by presenting the entropy of Internet names, Interest satisfaction rate and PIT usage as features extracted in the MF-ELM classifier. Furthermore, we deploy a queue-based hostile Interest prefix mitigation mechanism. The inference of this real-time test bed is that the mechanism can help the network to resist IFA with higher accuracy and efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information-centric%20network" title="information-centric network">information-centric network</a>, <a href="https://publications.waset.org/abstracts/search?q=pending%20interest%20table" title=" pending interest table"> pending interest table</a>, <a href="https://publications.waset.org/abstracts/search?q=interest%20flooding%20attack" title=" interest flooding attack"> interest flooding attack</a>, <a href="https://publications.waset.org/abstracts/search?q=MF-ELM%20classifier" title=" MF-ELM classifier"> MF-ELM classifier</a>, <a href="https://publications.waset.org/abstracts/search?q=queue-based%20mitigation%20strategy" title=" queue-based mitigation strategy"> queue-based mitigation strategy</a> </p> <a href="https://publications.waset.org/abstracts/144061/detecting-and-thwarting-interest-flooding-attack-in-information-centric-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144061.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">205</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">40</span> Effects of Non-Motorized Vehicles on a Selected Intersection in Dhaka City for Non Lane Based Heterogeneous Traffic Using VISSIM 5.3</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20C.%20Dey">A. C. Dey</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20M.%20Ahsan"> H. M. Ahsan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Heterogeneous traffic composed of both motorized and non-motorized vehicles that are a common feature of urban Bangladeshi roads. Popular non-motorized vehicles include rickshaws, rickshaw-van, and bicycle. These modes performed an important role in moving people and goods in the absence of a dependable mass transport system. However, rickshaws play a major role in meeting the demand for door-to-door public transport services to the city dwellers. But there is no separate lane for non-motorized vehicles in this city. Non-motorized vehicles generally occupy the outermost or curb-side lanes, however, at intersections non-motorized vehicles get mixed with the motorized vehicles. That’s why the conventional models fail to analyze the situation completely. Microscopic traffic simulation software VISSIM 5.3, itself a lane base software but default behavioral parameters [such as driving behavior, lateral distances, overtaking tendency, CCO=0.4m, CC1=1.5s] are modified for calibrating a model to analyze the effects of non-motorized traffic at an intersection (Mirpur-10) in a non-lane based mixed traffic condition. It is seen from field data that NMV occupies an average 20% of the total number of vehicles almost all the link roads. Due to the large share of non-motorized vehicles, capacity significantly drop. After analyzing simulation raw data, significant variation is noticed. Such as the average vehicular speed is reduced by 25% and the number of vehicles decreased by 30% only for the presence of NMV. Also the variation of lateral occupancy and queue delay time increase by 2.37% and 33.75% respectively. Thus results clearly show the negative effects of non-motorized vehicles on capacity at an intersection. So special management technics or restriction of NMV at major intersections may be an effective solution to improve this existing critical condition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=lateral%20occupancy" title="lateral occupancy">lateral occupancy</a>, <a href="https://publications.waset.org/abstracts/search?q=non%20lane%20based%20intersection" title=" non lane based intersection"> non lane based intersection</a>, <a href="https://publications.waset.org/abstracts/search?q=nmv" title=" nmv"> nmv</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20delay%20time" title=" queue delay time"> queue delay time</a>, <a href="https://publications.waset.org/abstracts/search?q=VISSIM%205.3" title=" VISSIM 5.3"> VISSIM 5.3</a> </p> <a href="https://publications.waset.org/abstracts/98140/effects-of-non-motorized-vehicles-on-a-selected-intersection-in-dhaka-city-for-non-lane-based-heterogeneous-traffic-using-vissim-53" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98140.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">155</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">39</span> Evaluation of the Impact of Reducing the Traffic Light Cycle for Cars to Improve Non-Vehicular Transportation: A Case of Study in Lima</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gheyder%20Concha%20Bendezu">Gheyder Concha Bendezu</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodrigo%20Lescano%20Loli"> Rodrigo Lescano Loli</a>, <a href="https://publications.waset.org/abstracts/search?q=Aldo%20Bravo%20Lizano"> Aldo Bravo Lizano</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In big urbanized cities of Latin America, motor vehicles have priority over non-motor vehicles and pedestrians. There is an important problem that affects people's health and quality of life; lack of inclusion towards pedestrians makes it difficult for them to move smoothly and safely since the city has been planned for the transit of motor vehicles. Faced with the new trend for sustainable and economical transport, the city is forced to develop infrastructure in order to incorporate pedestrians and users with non-motorized vehicles in the transport system. The present research aims to study the influence of non-motorized vehicles on an avenue, the optimization of a cycle using traffic lights based on simulation in Synchro software, to improve the flow of non-motor vehicles. The evaluation is of the microscopic type; for this reason, field data was collected, such as vehicular, pedestrian, and non-motor vehicle user demand. With the values of speed and travel time, it is represented in the current scenario that contains the existing problem. These data allow to create a microsimulation model in Vissim software, later to be calibrated and validated so that it has a behavior similar to reality. The results of this model are compared with the efficiency parameters of the proposed model; these parameters are the queue length, the travel speed, and mainly the travel times of the users at this intersection. The results reflect a reduction of 27% in travel time, that is, an improvement between the proposed model and the current one for this great avenue. The tail length of motor vehicles is also reduced by 12.5%, a considerable improvement. All this represents an improvement in the level of service and in the quality of life of users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bikeway" title="bikeway">bikeway</a>, <a href="https://publications.waset.org/abstracts/search?q=microsimulation" title=" microsimulation"> microsimulation</a>, <a href="https://publications.waset.org/abstracts/search?q=pedestrians" title=" pedestrians"> pedestrians</a>, <a href="https://publications.waset.org/abstracts/search?q=queue%20length" title=" queue length"> queue length</a>, <a href="https://publications.waset.org/abstracts/search?q=traffic%20light%20cycle" title=" traffic light cycle"> traffic light cycle</a>, <a href="https://publications.waset.org/abstracts/search?q=travel%20time" title=" travel time"> travel time</a> </p> <a href="https://publications.waset.org/abstracts/133676/evaluation-of-the-impact-of-reducing-the-traffic-light-cycle-for-cars-to-improve-non-vehicular-transportation-a-case-of-study-in-lima" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133676.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">173</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=M%2FG%2F1%2FN%20queue%20with%20vacations&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=M%2FG%2F1%2FN%20queue%20with%20vacations&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=M%2FG%2F1%2FN%20queue%20with%20vacations&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>