Keyword: networks: scheduling

Found 220 papers in total
Bi‐objective conflict detection and resolution in railway traffic management
Bi‐objective conflict detection and resolution in railway traffic management
2012,
Railway conflict detection and resolution is the daily task faced by dispatchers and...
PAMSCOD: Platoon‐based arterial multi‐modal signal control with online data
PAMSCOD: Platoon‐based arterial multi‐modal signal control with online data
2012,
A unified platoon‐based mathematical formulation called PAMSCOD is presented to...
A revenue management approach to address a truck rental problem
A revenue management approach to address a truck rental problem
2012,
This paper describes an application of revenue management techniques and policies in...
Stability of a spatial polling system with greedy myopic service
Stability of a spatial polling system with greedy myopic service
2012,
This paper studies a spatial queueing system on a circle, polled at random locations...
Time‐limited polling systems with batch arrivals and phase‐type service times
Time‐limited polling systems with batch arrivals and phase‐type service times
2012,
In this paper, we develop a general framework to analyze polling systems with either...
Polling models with multi‐phase gated service
Polling models with multi‐phase gated service
2012,
In this paper we introduce and analyze a new class of service policies called...
Continuous polling models and application to ferry assisted WLAN
Continuous polling models and application to ferry assisted WLAN
2012,
In this paper we focus on a class of polling systems encountered while modeling the...
On the stability of a polling system with an adaptive service mechanism
On the stability of a polling system with an adaptive service mechanism
2012,
We consider a single‐server cyclic polling system with three queues where the...
Gated polling with stationary ergodic walking times, Markovian routing and random feedback
Gated polling with stationary ergodic walking times, Markovian routing and random feedback
2012,
We investigate a gated polling system with semi‐linear feedback and Markovian...
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
2013,
In a previous work, a min–max–min model has been proposed for robust...
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
Stability and delay of distributed scheduling algorithms for networks of conflicting queues
2012,
This paper explains recent results on distributed algorithms for networks of...
On optimizing CSMA for wide area ad hoc networks
On optimizing CSMA for wide area ad hoc networks
2012,
The recent deployment of data‐rich smart phones has led to a fresh impetus for...
Loss‐aware DR‐based update scheduling for improving consistency in DVEs
Loss‐aware DR‐based update scheduling for improving consistency in DVEs
2012,
Maintaining a consistent presentation of the virtual world among participants is a...
A latent class accelerated hazard model of social activity duration
A latent class accelerated hazard model of social activity duration
2012,
Over the past decade, activity scheduling processes have gained increasing attention...
Multicast Pull Scheduling: When Fairness Is Fine
Multicast Pull Scheduling: When Fairness Is Fine
2003,
We investigate server scheduling policies to minimize average user perceived latency...
The Data Broadcast Problem with Non‐Uniform Transmission Times
The Data Broadcast Problem with Non‐Uniform Transmission Times
2003,
The Data Broadcast Problem consists of finding an infinite schedule to broadcast a...
Dynamic routing under recurrent and non‐recurrent congestion using real‐time ITS information
Dynamic routing under recurrent and non‐recurrent congestion using real‐time ITS information
2012,
In just‐in‐time (JIT) manufacturing environments, on‐time...
Minimum Congestion Redundant Assignments to Tolerate Random Faults
Minimum Congestion Redundant Assignments to Tolerate Random Faults
2002,
We consider the problem of computing minimum congestion, fault‐tolerant,...
An Online Algorithm for the Dynamic Maximal Dense Tree Problem
An Online Algorithm for the Dynamic Maximal Dense Tree Problem
2002,
The Online Maximal Dense Tree problem is as follows: given a weighted directed graph...
Distributed and On‐Line Routing on Tori
Distributed and On‐Line Routing on Tori
2002,
In this paper we study the problem of assigning paths to packets on N imes N tori in...
A tractable analytical model for large‐scale congested protein synthesis networks
A tractable analytical model for large‐scale congested protein synthesis networks
2012,
This paper presents an analytical model, based on finite capacity queueing network...
On a numerical method for calculating stationary characteristics of the switching node with retrial transmissions
On a numerical method for calculating stationary characteristics of the switching node with retrial transmissions
2011,
The model is considered of the switching node of packages with a limited buffer...
Variable neighborhood descent with iterated local search for routing and wavelength assignment
Variable neighborhood descent with iterated local search for routing and wavelength assignment
2012,
In this work we treat the Routing and Wavelength Assignment (RWA) with focus on...
T‐preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks
T‐preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks
2012,
We propose a new priority discipline called the T ‐preemptive priority...
Papers per page: