Define symmetric disciplines using an equation like (1.6) for multiple-class networks. Show that the LCFSPR discipline can be defined to satisfy this equation, but random selection cannot. How would...

Define symmetric disciplines using an equation like (1.6) for multiple-class networks. Show that the LCFSPR discipline can be defined to satisfy this equation, but random selection cannot. How would you characterize the LBPS class of disciplines? Also show that if no customer has to wait (i.e., we have a multi server station with at least as many servers as the number of customers present), we can always characterize the queue by the symmetry property.