Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

JDA
2007

favoriteEmaildiscussreport

98views more JDA 2007»

Admission control with advance reservations in simple networks

13 years 4 months ago

Admission control with advance reservations in simple networks

Download www.eng.tau.ac.il

In the admission control problem we are given a network and a set of connection requests, each of which is associated with a path, a time interval, a bandwidth requirement, and a weight. A feasible schedule is a set of connection requests such that at any given time, the

Dror Rawitz

Real-time Traffic

Admission Control Problem | Connection Requests | JDA 2007 | Time Interval |

claim paper

Related Content

» Differentiated Admission Control in Large Networks

» A Flexible Advance Reservation Model for MultiDomain WDM Optical Networks

» Predictive Admission Control Algorithm for Advance Reservation in Equipment Grid

» MYESSIR A Low Latency Reservation Protocol for MobileIP Networks

» MANET QoS support without reservations

» Adaptive Bandwidth Reservation and Admission Control in QoSSensitive Cellular Networks

» Failure Recovery in Distributed Environments with Advance Reservation Management Systems

» Endpoint admission control Architectural issues and performance

» Routing and Scheduling in Distributed Advance Reservation Networks

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JDA
Authors	Dror Rawitz

Comments (0)