File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On the critical packet injection rate of a preferential next-nearest neighbor routing traffic model on Barabási-Albert networks

TitleOn the critical packet injection rate of a preferential next-nearest neighbor routing traffic model on Barabási-Albert networks
Authors
Issue Date2009
PublisherSpringer Verlag. The Journal's web site is located at http://www.edpsciences.org/journal/index.cfm?edpsname=epjb
Citation
European Physical Journal B, 2009, v. 72 n. 4, p. 641-655 How to Cite?
AbstractRecently, Yin et al. [Eur. Phys. J. B 49, 205 (2006)] introduced an efficient small-world network traffic model using preferential next-nearest neighbor routing strategy with the so-called path iteration avoidance (PIA) rule to study the jamming transition of internet. Here we study their model without PIA rule by a mean-field analysis which carefully divides the message packets into two types. Then, we argue that our mean-field analysis is also applicable in the presence of PIA rule in the limit of a large number of nodes in the network. Our analysis gives an explicit expression of the critical packet injection rate R c as a function of a bias parameter of the routing strategy α in their model with or without PIA rule. In particular, we predict a sudden change in R c at a certain value of α. These predictions agree quite well with our extensive computer simulations. © 2009 EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg.
Persistent Identifierhttp://hdl.handle.net/10722/80838
ISSN
2015 Impact Factor: 1.223
2015 SCImago Journal Rankings: 0.524
ISI Accession Number ID
Funding AgencyGrant Number
HPCPOWER system
Funding Information:

We thank B.- H. Wang for bringing his group's work to our attention and for his valuable discussions. We also thank the Computer Center of HKU for their helpful support in providing the use of the HPCPOWER system for performing part of the simulations reported in this paper.

References

 

DC FieldValueLanguage
dc.contributor.authorChau, HFen_HK
dc.contributor.authorChan, HYen_HK
dc.contributor.authorChow, FKen_HK
dc.date.accessioned2010-09-06T08:10:50Z-
dc.date.available2010-09-06T08:10:50Z-
dc.date.issued2009en_HK
dc.identifier.citationEuropean Physical Journal B, 2009, v. 72 n. 4, p. 641-655en_HK
dc.identifier.issn1434-6028en_HK
dc.identifier.urihttp://hdl.handle.net/10722/80838-
dc.description.abstractRecently, Yin et al. [Eur. Phys. J. B 49, 205 (2006)] introduced an efficient small-world network traffic model using preferential next-nearest neighbor routing strategy with the so-called path iteration avoidance (PIA) rule to study the jamming transition of internet. Here we study their model without PIA rule by a mean-field analysis which carefully divides the message packets into two types. Then, we argue that our mean-field analysis is also applicable in the presence of PIA rule in the limit of a large number of nodes in the network. Our analysis gives an explicit expression of the critical packet injection rate R c as a function of a bias parameter of the routing strategy α in their model with or without PIA rule. In particular, we predict a sudden change in R c at a certain value of α. These predictions agree quite well with our extensive computer simulations. © 2009 EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag. The Journal's web site is located at http://www.edpsciences.org/journal/index.cfm?edpsname=epjben_HK
dc.relation.ispartofEuropean Physical Journal Ben_HK
dc.rightsThe original publication is available at www.springerlink.com-
dc.titleOn the critical packet injection rate of a preferential next-nearest neighbor routing traffic model on Barabási-Albert networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1434-6028&volume=72&spage=641&epage=655&date=2009&atitle=On+the+critical+packet+injection+rate+of+a+preferential+next-nearest+neighbor+routing+traffic+model+on+Barabasi-Albert+networksen_HK
dc.identifier.emailChau, HF: hfchau@hku.hken_HK
dc.identifier.authorityChau, HF=rp00669en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1140/epjb/e2009-00411-1en_HK
dc.identifier.scopuseid_2-s2.0-72449127709en_HK
dc.identifier.hkuros169472en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-72449127709&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume72en_HK
dc.identifier.issue4en_HK
dc.identifier.spage641en_HK
dc.identifier.epage655en_HK
dc.identifier.isiWOS:000272803300020-
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridChau, HF=7005742276en_HK
dc.identifier.scopusauthoridChan, HY=24723418500en_HK
dc.identifier.scopusauthoridChow, FK=7005264096en_HK
dc.identifier.citeulike6372499-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats