Browse Prior Art Database

Covering method for multicast destinations

IP.com Disclosure Number: IPCOM000014536D
Original Publication Date: 2001-Apr-28
Included in the Prior Art Database: 2003-Jun-19

Publishing Venue

IBM

Abstract

The multicast covering problem can be defined as follows. There are D 2 destinations possible, so D elements in a set S of all possible destinations across a switch. The destinations are labeled with the integers 1, 2, ..., D. There are N nonempty, distinct subsets {Si},i=1,2, ..., N 2^D of the D elements. The set of subsets {Si} includes all D subsets consisting of exactly one element. The set of all integer labels used to enumerate the subsets is A {1, 2, ..., N}. There is in addition a given subset G. G might be exactly the same as one of the subsets in {Si}, but in general it is not. The problem is to find a set of subsets among {Si} with indices in a set F such that F has two proproperties: 1. if i and j are distinct indices in F, then Si and Sj do not intersect; 2. the union of all subsets with indices in F is exactly G.