WASET
	@article{(Open Science Index):https://publications.waset.org/pdf/5217,
	  title     = {Discrete Time Optimal Solution for the Connection Admission Control Problem },
	  author    = {C. Bruni and  F. Delli Priscoli and  G. Koch and  I. Marchetti},
	  country	= {},
	  institution	= {},
	  abstract     = {The Connection Admission Control (CAC) problem is formulated in this paper as a discrete time optimal control problem. The control variables account for the acceptance/ rejection of new connections and forced dropping of in-progress connections. These variables are constrained to meet suitable conditions which account for the QoS requirements (Link Availability, Blocking Probability, Dropping Probability). The performance index evaluates the total throughput. At each discrete time, the problem is solved as an integer-valued linear programming one. The proposed procedure was successfully tested against suitably simulated data.
},
	    journal   = {International Journal of Electrical and Computer Engineering},
	  volume    = {1},
	  number    = {3},
	  year      = {2007},
	  pages     = {534 - 542},
	  ee        = {https://publications.waset.org/pdf/5217},
	  url   	= {https://publications.waset.org/vol/3},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 3, 2007},
	}