The exact gossiping problem for six messages / Melissa D. Paderanga
Material type: TextLanguage: English Publication details: 2003Description: 29 leavesSubject(s): Dissertation note: Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002 Abstract: The integration of the telecommunication industry and computer industry is a distinct feature of the advancements of a third-wave technology. Communication, hence, the transfer of information between a source and a receiver, has portrayed a significant role in information dissemination. Information dissemination develop into different modes as one-to-one communication such as telegraph, telephone calls, conversations, radio communications and gossiping among others; one-to-many communication such as broadcasting, SMS applications, and multimedia messaging services; and many?to-many communication through groupwares, videoconferencing, and multimedia chat forums. For example, in teleconferencing, people in different regions are allowed to attend meetings using telephone lines. Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network through the concepts of graph. In a gossiping problem, each node (corresponding to each of the n person) has a unique piece of information that must be transmitted to all other nodes. This study presents a mathematical model, for a given number of exactly n persons, denoted by E(n,k) for each n person to know exactly k messages. This study focuses on the minimum number of calls of E(n,k) for k=6 messages and for all values of n.Cover image | Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
|
University Library Theses | Room-Use Only | LG993.5 2003 A64 P33 (Browse shelf(Opens below)) | Not For Loan | 3UPML00010399 | ||
|
University Library Archives and Records | Preservation Copy | LG993.5 2003 A64 P33 (Browse shelf(Opens below)) | Not For Loan | 3UPML00020902 |
Browsing College of Science and Mathematics shelves, Shelving location: Theses, Collection: Room-Use Only Close shelf browser (Hides shelf browser)
Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2002
The integration of the telecommunication industry and computer industry is a distinct feature of the advancements of a third-wave technology. Communication, hence, the transfer of information between a source and a receiver, has portrayed a significant role in information dissemination. Information dissemination develop into different modes as one-to-one communication such as telegraph, telephone calls, conversations, radio communications and gossiping among others; one-to-many communication such as broadcasting, SMS applications, and multimedia messaging services; and many?to-many communication through groupwares, videoconferencing, and multimedia chat forums. For example, in teleconferencing, people in different regions are allowed to attend meetings using telephone lines. Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network through the concepts of graph. In a gossiping problem, each node (corresponding to each of the n person) has a unique piece of information that must be transmitted to all other nodes. This study presents a mathematical model, for a given number of exactly n persons, denoted by E(n,k) for each n person to know exactly k messages. This study focuses on the minimum number of calls of E(n,k) for k=6 messages and for all values of n.
There are no comments on this title.