The paper studies a high-ranking node in a broadband integrated servic
es digital network (B-ISDN). The input traffic is classified into two
types: real-time and non-real-time. For each type of input traffic, we
assume that the message arrival process is a batch Poisson process an
d that the message size is arbitrarily distributed so as to describe s
ervices from narrowband to wideband. We model the high-ranking node by
a queueing system with multiple synchronous servers and two separate
finite buffers, one for each type of traffic. We derive performance me
asures exactly by using a two-dimensional imbedded discrete-time Marko
v chain analysis, within which the transition probabilities are obtain
ed via an application of the residue theorem in complex variables. The
performance measures include the blocking probability, delay, and thr
oughput.