A new approach is proposed to studying queuing systems with request-specific channels and a common finite buffer for requests of different types. For sharing the common buffer, a virtual partitioning strategy is used. Explicit formulas for blocking probabilities of different requests are derived and optimization problems are solved. The results of numerical experiments are presented.