The Structure of PEC Networks

Richards, Dana; Jia, Zhenlei

doi:10.1080/15427951.2009.10129179

Search citation statements

Order By: Relevance

Paper Sections

Select...

Models M 1 and M1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2011

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is interesting to note that the scheme described for the clique portion of the dipper graph uses edges corresponding to a finite section of the so-called packed exponential connections (PEC) network [23,24].…”

Section: Models M 1 and Mmentioning

confidence: 99%

Messy broadcasting — Decentralized broadcast schemes with limited knowledge

Harutyunyan¹,

Hell²,

Liestman³

2011

Discrete Applied Mathematics

View full text Add to dashboard Cite

a b s t r a c tWe consider versions of broadcasting that proceed in the absence of information about the network. In particular, the vertices of the network do not know the structure of the network or the starting time, originator, or state of the broadcast. Furthermore, the protocols are not coordinated. This synchronous anonymous communication model has been called messy broadcasting. We perform a worst case analysis of three variants of messy broadcasting. These results also provide upper bounds on broadcasting where every vertex simply calls each of its neighbors once in random order. We prove exact bounds on the time required for broadcasting under two variants and give a conjectured value for the third.

show abstract

Section: Models M 1 and Mmentioning

confidence: 99%