An Intelligent Model To Control Preemption Rate Of Instantaneous Request Calls In Networks With Book-Ahead Reservation

Resource sharing between book-ahead (BA) and instantaneous request (IR) reservation often results in high preemption rate of on-going IR calls. High IR call preemption rate causes interruption to service continuity which is considered as detrimental in a QoS-enabled network. A number of call admission control models have been proposed in literature to reduce the preemption rate of on-going IR calls. Many of these models use a tuning parameter to achieve certain level of preemption rate. This paper presents an artificial neural network (ANN) model to dynamically control the preemption rate of on-going calls in a QoS-enabled network. The model maps network traffic parameters and desired level of preemption rate into appropriate tuning parameter. Once trained, this model can be used to automatically estimate the tuning parameter value necessary to achieve the desired level of preemption rate. Simulation results show that the preemption rate attained by the model closely matches with the target rate

Rerouting Technique for Faster Restoration of Preempted Calls

In a communication network where resources are shared between instantaneous request (IR) and book-ahead (BA) connections, activation of future BA connections causes preemption of many on-going IR connections upon resource scarcity. A solution to this problem is to reroute the preempted calls via alternative feasible paths, which often does not ensure acceptably low disruption of service. In this paper, a new rerouting strategy is proposed that uses the destination node to initiate the rerouting and thereby reduces the rerouting time, which ultimately improves the service disruption time. Simulations on a widely used network topology suggest that the proposed rerouting scheme achieves more successful rerouting rate with lower service disruption time, while not compromising other network performance metrics like utilization and call blocking rate

An Intelligent Model to Control Preemption Rate of Instantaneous Request Calls in Networks with Book-Ahead Reservation

Resource sharing between Book-Ahead (BA) and Instantaneous Request (IR) reservation often results in high preemption rate of on-going IR calls. High IR call preemption rate causes interruption to service continuity which is considered as detrimental in a QoS-enabled network. A number of call admission control models have been proposed in literature to reduce the preemption rate of on-going IR calls. Many of these models use a tuning parameter to achieve certain level of preemption rate. This paper presents an Artificial Neural Network (ANN) model to dynamically control the preemption rate of on-going calls in a QoS-enabled network. The model maps network traffic parameters and desired level of preemption rate into appropriate tuning parameter. Once trained, this model can be used to automatically estimate the tuning parameter value necessary to achieve the desired level of preemption rate. Simulation results show that the preemption rate attained by the model closely matches with the target ra

Revenue Management of Reusable Resources with Advanced Reservations

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/137568/1/poms12672_am.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/137568/2/poms12672.pd

Advance and Immediate Request Admission: A Preemptable Service Definition for Bandwidth Brokers

Differentiated Services Architecture lacks control level functionalities and Bandwidth Brokers are proposed to fill that gap. In order to provide proper control level functionalities, Bandwidth Brokers need to provide services for both advance requests and immediate requests. There is a tradeoff between preemption of immediate flows and utilization of links. It is important for a resource manager to provide the promised QoS level to a flow without any preemption. In this study, we solve the preemption and the experienced QoS problem by defining a preemptable service and explain how this service works and also show the performance and scalability characteristics of resource manager with the addition of a preemptable service

Components and Interfaces of a Process Management System for Parallel Programs

Parallel jobs are different from sequential jobs and require a different type of process management. We present here a process management system for parallel programs such as those written using MPI. A primary goal of the system, which we call MPD (for multipurpose daemon), is to be scalable. By this we mean that startup of interactive parallel jobs comprising thousands of processes is quick, that signals can be quickly delivered to processes, and that stdin, stdout, and stderr are managed intuitively. Our primary target is parallel machines made up of clusters of SMPs, but the system is also useful in more tightly integrated environments. We describe how MPD enables much faster startup and better runtime management of parallel jobs. We show how close control of stdio can support the easy implementation of a number of convenient system utilities, even a parallel debugger. We describe a simple but general interface that can be used to separate any process manager from a parallel library, which we use to keep MPD separate from MPICH.Comment: 12 pages, Workshop on Clusters and Computational Grids for Scientific Computing, Sept. 24-27, 2000, Le Chateau de Faverges de la Tour, Franc

Обобщенный алгоритм расчета характеристик стратегий Клейнрока-Камоуна для распределения буфера в сетях коммутации пакетов

Проанализированы проблемы распределения буфера между конфликтующими трафиками в системах передачи сообщений с буферизацией. Рассмотрены классические стратегии такого распределения, предложенные Л.Клейнроком и Ф.Камоуном. Описан новый подход к решению проблемы расчета характеристик стохастических асинхронных систем передачи сообщений, основанный на принципах теории фазового укрупнения их состояний. Получены явные формулы для определения характеристик наиболее общей из стратегий.Проаналізовані проблеми розподілу буферу між конфліктуючими трафіками в системах передачі повідомлень з буферизацією. Розглянуті класичні стратегії такого розподілу, запропоновані Л. Клейнроком і Ф. Камоуном. Запропоновано новий підхід до розв’язання проблем розрахунку характеристик стохастичних асинхронних систем передачі повідомлень, заснований на принципах теорії фазового укрупнення їх станів. Одержані явні формули для визначення характеристик найзагальнішої зі стратегій.Problem of buffer sharing between conflict traffics in message transfer systems with bufferisation were analyzed. Classic strategies of such sharing, offered by L. Kleinrock and F. Kamoun, were considered. A new approach to solving the problem of calculating characteristics in stochastic asynchronous message transfer systems, based upon principles of phase-aggregation states theory, is offered. Practical engineering formulas for calculating characteristics of the most general strategy is obtained

Information Outlook, November 2006

Volume 10, Issue 11https://scholarworks.sjsu.edu/sla_io_2006/1010/thumbnail.jp