Admission control with advance reservations in simple networks

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

• Type: Journal
• Year: 2007
• Where: JDA
• Authors: Dror Rawitz
• Keywords: Admission Control Problem, Connection Requests, JDA 2007, Time Interval