A Priority Queueing Network in Heavy Traffic: One Bottleneck Node

We consider a network of queues with K infinite capacity, multiple server stations. There are J customer classes, each with its own arrival process.