Capacity assignment algorithm for packet switching network with different grades of service

Abstract

A multimedia communication network is expected to treat various kinds of information, e.g., voice, image, and data which have different demands of grade of service. Furthermore, in new high-speed networks, end-to-end delay distributions or packet-loss probabilities rather than average delays become more important performance measures. This paper presents a new heuristic design algorithm for packet switching communication networks in which the end-to-end delay distribution and packet-loss probabilities are adopted as design constraints. It is shown that, while the total cost is increased slightly when compared with the former approach, end-to-end delays and packet-loss probabilities between every two end-nodes can satisfy predefined constraint as expected.