We introduce two new classes of graphs which we call convex-round, respectively concave-round graphs. Convex-round (concave-round) graphs are those graphs whose vertices can be circularly enumerated so that the (closed) neighborhood of each vertex forms an interval in the enumeration. Hence the two classes transform into each other by taking complements. We show that both classes of graphs have...

The performance of different ATM switch buffer queuing schemes for round-robin and weighted round-robin didn‘t have too much difference. This paper presents the discrete-event simulation provides detailed, accurate network simulation results and it observed a wide variety of network statistics. The software simulation package, OPNET, which specializes in discrete-event simulation of communicati...