Search results for "Queue"
showing 10 items of 64 documents
An Energy Saving Mechanism Based on Vacation Queuing Theory in Data Center Networks
2018
To satisfy the growing need for computing resources, data centers consume a huge amount of power which raises serious concerns regarding the scale of the energy consumption and wastage. One of the important reasons for such energy wastage relates to the redundancies. Redundancies are defined as the backup routing paths and unneeded active ports implemented for the sake of load balancing and fault tolerance. The energy loss may also be caused by the random nature of incoming packets forcing nodes to stay powered on all the times to await for incoming tasks. This paper proposes a re-architecturing of network devices to address energy wastage issue by consolidating the traffic arriving from di…
Interoperable real-time symbolic programming for smart environments
2019
Smart environments demand novel paradigms offering easy configuration, programming and deployment of pervasive applications. To this purpose, different solutions have been proposed ranging from visual paradigms based on mashups to formal languages. However, most of the paradigms proposed in the literature require further external tools to turn application description code into an executable program before the deployment on target devices. Source code generation, runtime upgrades and recovery, and online debugging and inspection are often cumbersome in these programming environments. In this work we describe a methodology for real-time and on-line programming in smart environments that is co…
Modeling Energy Demand Aggregators for Residential Consumers
2013
International audience; Energy demand aggregators are new actors in the energy scenario: they gather a group of energy consumers and implement a demand- response paradigm. When the energy provider needs to reduce the current energy demand on the grid, it can pay the energy demand aggregator to reduce the load by turning off some of its consumers loads or postponing their activation. Currently this operation involves only greedy energy consumers like industrial plants. In this paper we want to study the potential of aggregating a large number of small energy consumers like home users as it may happen in smart grids. In particular we want to address the feasibility of such approach by conside…
Application of queuing methodology to analyze congestion: A case study of the Manila International Container Terminal, Philippines
2016
The objective of this paper is to apply queuing methodology in order to analyze congestion at the Manila International Container Terminal (MICT) in the Port of Manila, the Philippines. The vessels calling at the MICT have to wait in a queue before receiving services at berths because of congestion. For vessel operators and cargo owners this situation creates waiting time costs and delays in delivery of goods to final customers. One option to decrease waiting time is to expand capacity by increasing the number of berths. Construction of a new berth is a time consuming and costly procedure, which needs to be considered carefully before being implemented. To determine whether the data collecte…
Closedness properties in team learning of recursive functions
1997
This paper investigates closedness properties in relation with team learning of total recursive functions. One of the first problems solved for any new identification types is the following: “Does the identifiability of classes U1 and U2 imply the identifiability of U1∪U2?” In this paper we are interested in a more general question: “Does the identifiability of every union of n−1 classes out of U1,...,Un imply the identifiability of U1∪...∪Un?” If the answer is positive, we call such identification type n-closed. We show that n-closedness can be equivalently formulated in terms of team learning. After that we find for which n team identification in the limit and team finite identification t…
A New Scalable and Cost-Effective Congestion Management Strategy for Lossless Multistage Interconnection Networks
2005
In this paper, we propose a new congestion management strategy for lossless multistage interconnection networks that scales as network size and/or link bandwidth increase. Instead of eliminating congestion, our strategy avoids performance degradation beyond the saturation point by eliminating the HOL blocking produced by congestion trees. This is achieved in a scalable manner by using separate queues for congested flows. These are dynamically allocated only when congestion arises, and deallocated when congestion subsides. Performance evaluation results show that our strategy responds to congestion immediately and completely eliminates the performance degradation produced by HOL blocking whi…
Channel Assembling with Priority-Based Queues in Cognitive Radio Networks: Strategies and Performance Evaluation
2014
[EN] With the implementation of channel assembling (CA) techniques, higher data rate can be achieved for secondary users in multi-channel cognitive radio networks. Recent studies which are based on loss systems show that maximal capacity can be achieved using dynamic CA strategies. However the channel allocation schemes suffer from high blocking and forced termination when primary users become active. In this paper, we propose to introduce queues for secondary users so that those flows that would otherwise be blocked or forcibly terminated could be buffered and possibly served later. More specifically, in a multi-channel network with heterogeneous traffic, two queues are separately allocate…
Model and optimal Call Admission Policy in Cellular Mobile Networks
2000
For current cellular networks, two important Quality of Service (QoS) measures are the fractions of new and handoff calls that are blocked due to unavailability of channels. Based on these QoS measures, we propose a queuing network model with impatient users for handoff and new calls in cellular mobile networks. The number of simultaneous calls, that can be supported, is modeled by C identical servers with exponentially distributed session duration for each one of them. Priority is given to handoffs over new calls. We use for that a Guard Channel policy that reserves a set of CH channels for handoff calls, new calls being served at their arrival if there are more than CH available channels.…
A Feature Set Decomposition Method for the Construction of Multi-classifier Systems Trained with High-Dimensional Data
2013
Data mining for the discovery of novel, useful patterns, encounters obstacles when dealing with high-dimensional datasets, which have been documented as the "curse" of dimensionality. A strategy to deal with this issue is the decomposition of the input feature set to build a multi-classifier system. Standalone decomposition methods are rare and generally based on random selection. We propose a decomposition method which uses information theory tools to arrange input features into uncorrelated and relevant subsets. Experimental results show how this approach significantly outperforms three baseline decomposition methods, in terms of classification accuracy.
Performance of frame transmissions and event-triggered sleeping in duty-cycled WSNs with error-prone wireless links
2018
Abstract Two types of packet transmission schemes are prevalent in duty-cycled wireless sensor networks, i.e., single packet transmission and aggregated packet transmission which integrates multiple packets in one frame. While most existing models are developed based on an error-free channel assumption, this paper evaluates the performance of both transmission schemes under error-prone channel conditions. We develop a four-dimensional discrete-time Markov chain model to investigate the impact of channel impairments on the performance of frame transmissions. Together with tracking the number of packets in the queue, number of retransmissions and number of active nodes, the fourth dimension o…