Near Optimal Broadcasting in Optimal Triple Loop Graphs

Harutyunyan, Hovhannes A.; Maraachlian, Edward

doi:10.1109/aina.2008.83

Search citation statements

Order By: Relevance

Paper Sections

Select...

Scheme B: Odd Source Node1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, there might be cases that two informed nodes might try to inform the same node because the above schemes do not check either the node that is being message forwarded already informed or not. There are three cases on how the message is forwarded [7]. …”

Section: Scheme B: Odd Source Nodementioning

confidence: 99%

Broadcasting Communication in High Degree Modified Chordal Rings Networks

Shah¹,

Othman²

2014

Appl. Math. Inf. Sci.

View full text Add to dashboard Cite

Abstract:The design of the interconnection network is one of the main research issues in distributed computing with regard to some specific parameters. This paper works on Modified Chordal Rings Degree Six (CHRm6) topology. Two broadcasting schemes for CHRm6 are proposed. The first scheme is for even source nodes and the second scheme is for odd source nodes. The proposed broadcasting schemes give upper and lower bound of broadcasting in CHRm6 depends on total number of nodes. We prove the lower bound on the broadcast time is d + 2 where d is the diameter of the CHRm6.

show abstract

Section: Scheme B: Odd Source Nodementioning

confidence: 99%