Displaying similar documents to “A Packet Buffer Evaluation Method Exploiting Queueing Theory for Wireless Sensor Networks”

Product form solution for g-networks with dependent service

Pavel Bocharov, Ciro D'Apice, Evgeny Gavrilov, Alexandre Pechinkin (2004)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: (0) an exponential node with c n servers, infinite buffer and FIFO discipline; (1) an infinite-server node; (2) a single-server node with infinite buffer and LIFO PR discipline; (3) a...

Allocating servers to facilities, when demand is elastic to travel and waiting times

Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers’ travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel...

Semi-Markov-based approach for the analysis of open tandem networks with blocking and truncation

Walenty Oniszczuk (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are nonexponentially distributed with means sA and sB , respectively. Both nodes have buffers with finite capacities. In this type of network,...

Combination of mobile agent and evolutionary algorithm to optimize the client transport services

Hayfa Zgaya, Slim Hammadi, Khaled Ghédira (2008)

RAIRO - Operations Research

Similarity:

This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this level, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it...

Extending Object-Oriented Network Protocols via alternative Transportation Bindings (Web Services over XMPP)

Irintchev, Mihail (2011)

Serdica Journal of Computing

Similarity:

Distributed and/or composite web applications are driven by intercommunication via web services, which employ application-level protocols, such as SOAP. However, these protocols usually rely on the classic HTTP for transportation. HTTP is quite efficient for what it does — delivering web page content, but has never been intended to carry complex web service oriented communication. Today there exist modern protocols that are much better fit for the job. Such a candidate is XMPP. It is...