File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Optimal gossiping in square meshes in all-port mode and with short packets

TitleOptimal gossiping in square meshes in all-port mode and with short packets
Authors
Wang, RLau, FCM
KeywordsAlgorithms
Gossiping
Information Dissemination
Meshes
Networks
Issue Date2005
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
The 12 International Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Mont Saint-Michel, France, 24-26 May 2005. In Lecture Notes In Computer Science, 2005, v. 3499, p. 292-306 How to Cite?
AbstractWe present optimal solutions for the gossiping problem in square meshes under the all-port, full-duplex (F*) and the all-port, half-duplex (H*) models. We assume packets are of finite size, each carrying at most one message. © Springer-Verlag Berlin Heidelberg 2005.
DescriptionLNCS v. 3299 entitled: Structural Information and Communication Complexity: 12 International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005. Proceedings
Persistent Identifierhttp://hdl.handle.net/10722/151864
ISSN
0302-9743
2020 SCImago Journal Rankings: 0.249
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorWang, Ren_US
dc.contributor.authorLau, FCMen_US
dc.date.accessioned2012-06-26T06:30:11Z-
dc.date.available2012-06-26T06:30:11Z-
dc.date.issued2005en_US
dc.identifier.citationThe 12 International Colloquium on Structural Information and Communication Complexity (SIROCCO 2005), Mont Saint-Michel, France, 24-26 May 2005. In Lecture Notes In Computer Science, 2005, v. 3499, p. 292-306en_US
dc.identifier.issn0302-9743en_US
dc.identifier.urihttp://hdl.handle.net/10722/151864-
dc.descriptionLNCS v. 3299 entitled: Structural Information and Communication Complexity: 12 International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005. Proceedings-
dc.description.abstractWe present optimal solutions for the gossiping problem in square meshes under the all-port, full-duplex (F*) and the all-port, half-duplex (H*) models. We assume packets are of finite size, each carrying at most one message. © Springer-Verlag Berlin Heidelberg 2005.en_US
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_US
dc.relation.ispartofLecture Notes in Computer Scienceen_US
dc.subjectAlgorithmsen_US
dc.subjectGossipingen_US
dc.subjectInformation Disseminationen_US
dc.subjectMeshesen_US
dc.subjectNetworksen_US
dc.titleOptimal gossiping in square meshes in all-port mode and with short packetsen_US
dc.typeConference_Paperen_US
dc.identifier.emailWang, R: rwang@cs.hku.hken_US
dc.identifier.emailLau, FCM: fcmlau@cs.hku.hk-
dc.identifier.authorityLau, FCM=rp00221en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-24944471276en_US
dc.identifier.hkuros103918-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-24944471276&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume3499en_US
dc.identifier.spage292en_US
dc.identifier.epage306en_US
dc.publisher.placeGermanyen_US
dc.identifier.scopusauthoridWang, R=25653261600en_US
dc.identifier.scopusauthoridLau, FCM=7102749723en_US
dc.customcontrol.immutablesml 160106 - merged-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats