TY - JOUR

T1 - k-port line broadcasting in trees

AU - Averbuch, A.

AU - Shabtai, R. Hollander

AU - Roditty, Y.

PY - 2011/5

Y1 - 2011/5

N2 - Broadcasting is the process of message transmission in a communication network. The communication network is modeled by a graph G = (V, E), where the set of vertices V represents the network members and the set of edges E represents the communication links between two given vertices. We assume that G is connected and undirected. One vertex, called the originator of the graph holds a message that has to be transmitted to all vertices of the network by placing a series of calls over the network. A k- port line broadcasting in G is a model in which an informed vertex can call, at each time unit, at most k vertices and transmit a message through a path, as long as, two transmissions do not use the same edge at the same time.case k is not bounded the model is called all-port line model.this paper, we extend Cohen's work [6], that handles the all-port line model.

AB - Broadcasting is the process of message transmission in a communication network. The communication network is modeled by a graph G = (V, E), where the set of vertices V represents the network members and the set of edges E represents the communication links between two given vertices. We assume that G is connected and undirected. One vertex, called the originator of the graph holds a message that has to be transmitted to all vertices of the network by placing a series of calls over the network. A k- port line broadcasting in G is a model in which an informed vertex can call, at each time unit, at most k vertices and transmit a message through a path, as long as, two transmissions do not use the same edge at the same time.case k is not bounded the model is called all-port line model.this paper, we extend Cohen's work [6], that handles the all-port line model.

UR - http://www.scopus.com/inward/record.url?scp=79959195220&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:79959195220

VL - 77

SP - 125

EP - 160

JO - Journal of Combinatorial Mathematics and Combinatorial Computing

JF - Journal of Combinatorial Mathematics and Combinatorial Computing

SN - 0835-3026

ER -