Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.459
JCR 5-Year IF: 0.442
Issues per year: 4
Current issue: Nov 2016
Next issue: Feb 2017
Avg review time: 96 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 644266260
doi: 10.4316/AECE


TRAFFIC STATS

1,463,357 unique visits
469,816 downloads
Since November 1, 2009



Robots online now
Googlebot


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
 Volume 15 (2015)
 
     »   Issue 4 / 2015
 
     »   Issue 3 / 2015
 
     »   Issue 2 / 2015
 
     »   Issue 1 / 2015
 
 
 Volume 14 (2014)
 
     »   Issue 4 / 2014
 
     »   Issue 3 / 2014
 
     »   Issue 2 / 2014
 
     »   Issue 1 / 2014
 
 
 Volume 13 (2013)
 
     »   Issue 4 / 2013
 
     »   Issue 3 / 2013
 
     »   Issue 2 / 2013
 
     »   Issue 1 / 2013
 
 
  View all issues  


FEATURED ARTICLE

ABC Algorithm based Fuzzy Modeling of Optical Glucose Detection, SARACOGLU, O. G., BAGIS, A., KONAR, M., TABARU, T. E.
Issue 3/2016

AbstractPlus






LATEST NEWS

2016-Jun-14
Thomson Reuters published the Journal Citations Report for 2015. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.459, and the JCR 5-Year Impact Factor is 0.442.

2015-Dec-04
Starting with Issue 2/2016, the article processing charge is 300 EUR for each article accepted for publication. The charge of 25 EUR per page for papers over 8 pages will not be changed. Details are available in the For authors section.

2015-Jun-10
Thomson Reuters published the Journal Citations Report for 2014. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.529, and the JCR 5-Year Impact Factor is 0.476.

2015-Feb-09
Starting on the 9th of February 2015, we require all authors to identify themselves, when a submission is made, by entering their SCOPUS Author IDs, instead of the organizations, when available. This information will let us better know the publishing history of the authors and better assign the reviewers on different topics.

2015-Feb-08
We have more than 500 author names on the ban-list for cheating, including plagiarism, false signatures on the copyright form, false E-mail addresses and even tentative to impersonate well-known researchers in order to become a reviewer of our Journal. We maintain a full history of such incidents.

Read More »


    
 

  4/2014 - 16

A Popularity-Aware Semantic Overlay for Efficient Peer-to-Peer Search

LEE, C. See more information about LEE, C. on SCOPUS See more information about LEE, C. on IEEExplore See more information about LEE, C. on Web of Science, CHOI, J. See more information about  CHOI, J. on SCOPUS See more information about  CHOI, J. on SCOPUS See more information about CHOI, J. on Web of Science, KIM, E. See more information about KIM, E. on SCOPUS See more information about KIM, E. on SCOPUS See more information about KIM, E. on Web of Science
 
Click to see author's profile on See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (784 KB) | Citation | Downloads: 189 | Views: 884

Author keywords
computer networks, distributed computing, distributed information systems, keyword search, peer to peer computing

References keywords
peer(14), search(8), networks(6), systems(5), social(4), semantic(4), science(4), notes(4), lecture(4), information(4)
Blue keywords are present in both the references section and the paper title.

About this article
Date of Publication: 2014-11-30
Volume 14, Issue 4, Year 2014, On page(s): 105 - 108
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2014.04016
Web of Science Accession Number: 000348772500016
SCOPUS ID: 84921628988

Abstract
Quick view
Full text preview
This paper presents a novel semantic overlay scheme that connects peers based on the similarity of their contents. Semantic closeness among overlay peers can effectively be determined via the exchanges of their content summary using Bloom filters. The overlay link quality is further improved by carefully selecting semantic neighbors according to their potential to contribute to content-based searches. The basic idea behind the semantic neighbor selection is that highly replicated documents should not excessively dominate the overlay topology, overshadowing rare to modestly-replicated items whose query efficiency is often more critical for overall search performance. The efficacy of the proposed semantic overlay is validated through our simulation study which demonstrates superior overlay link quality and query routing performance.


References | Cited By  «-- Click to see who has cited this paper

[1] J. Risson and T. Moors, "Survey of research towards robust peer-to-peer networks: search methods," Computer Networks, vol. 50, no. 17, pp. 3485-3521, Dec. 2006.
[CrossRef] [Web of Science Times Cited 107] [SCOPUS Times Cited 160]


[2] M. Bender et al., "Peer-to-peer information search: semantic, social, or spiritual?", IEEE Data Engineering Bulletin, vol. 30, no. 2, pp. 51-60, Jun. 2007.

[3] S. B. Handurukande, A. -M. Kermarrec, F. L. Fessant, and L. Massoulie, "Exploiting semantic clustering in the eDonkey P2P network," in Proc. 11th ACM SIGOPS European Workshop, Leuven, Belgium, 2004, pp. 1-6.

[4] S. Voulgaris, A. -M. Kermarrec, L. Massoulie, and M. van Steen, "Exploiting semantic proximity in peer-to-peer content searching," in Proc. 10th International Workshop Future Trends in Distributed Computing Systems,Suzhou, China, 2004, pp. 238-243.

[5] S. Voulgaris and M. van Steen, "Epidemic-style management of semantic overlays for content-based searching," Lecture Notes in Computer Science, vol. 3648, pp. 1143-1152, 2005.
[CrossRef]


[6] J. P. Callan, Z. Lu, and W. B. Croft, "Searching distributed collections with inference networks," in Proc. 18th Annu. International ACM SIGIR Conf. Research and Development in Information Retrieval, Seattle, WA, USA, 1995, pp.21-28.

[7] J. A. Pouwelse et al., "Tribler: a social-based peer-to-peer system," Concurrency and Computation: Practice & Experience, vol. 20, no. 2, pp. 127-138, Feb. 2008.
[CrossRef] [Web of Science Times Cited 96] [SCOPUS Times Cited 164]


[8] F. Saihan and V. Issarny, "Scalable service discovery for MANET," in Proc. 3rd International Conf. Pervasive Computing and Communications, Kauai Island, HI, USA, 2005, pp. 235-244.

[9] M. Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer, "Improving collection selection with overlap awareness in P2P search engines," in Proc. 28th Annu. International ACM SIGIR Conf. Research and Development in Information Retrieval, Salvador, Brazil, 2005, pp. 67-74.

[10] G. Koloniari, Y. Petrakis, and E. Pitoura, "Content-based overlay networks for XML peers based on multi-level Bloom filters," Lecture Notes in Computer Science, vol. 2944, pp. 232-247, 2004.
[CrossRef]


[11] B. T. Loo, R. Huebsch, I. Stoica, and J. Hellerstein, "The case for a hybrid P2P search infrastructure," in Proc. 3rd International Workshop Peer-to-Peer Systems, San Diego, CA, USA, 2004, pp. 141-150.

[12] A. Broder and M. Mitzenmacher, "Network applications of Bloom filters: a survey," Internet Mathematics, vol. 1, no. 4, pp. 485-509, Oct. 2004.
[CrossRef] [SCOPUS Times Cited 748]


[13] B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, Jul. 1970.
[CrossRef] [SCOPUS Times Cited 3024]


[14] G. Sakaryan, M. Wulff, and H. Unger, "Search methods in P2P networks: a survey," Lecture Notes in Computer Science, vol. 3473, pp. 59-68, 2006.
[CrossRef] [SCOPUS Times Cited 2]


[15] Y. Aytas, H. Ferhatosmanoglu, and O. Ulusoy, "Link recommendation in P2P social networks," in Proc. 1st International Workshop Online Social Systems, Istanbul, Turkey, Aug. 2012.

[16] R. Zhang and Y. C. Hu, "Assisted peer-to-peer search with partial indexing," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 8, pp. 1146-1158, Aug. 2007.
[CrossRef] [Web of Science Times Cited 28] [SCOPUS Times Cited 47]


[17] F. Draidi, E. Pacitti, and B. Kemme, "P2Prec: a P2P recommendation system for large-scale data sharing," Lecture Notes in Computer Science, vol. 6790, pp. 87-116, 2011.
[CrossRef] [SCOPUS Times Cited 4]


[18] K. Sripanidkulchai, B. M. Maggs, and H. Zhang, "Efficient content location using interest-based locality in peer-to-peer systems," in Proc. IEEE INFOCOM, San Francisco, CA, USA, 2003, p. 2166-2176.

[19] Y. Zhang, G. Shen, and Y. Yu, "LiPS: efficient P2P search scheme with novel link prediction techniques," in Proc. IEEE International Conf. Communications, Glasgow, Scotland, 2007, pp. 1875-1880.

[20] H. Han, J. He, and C. Zuo, "A hybrid P2P overlay network for high efficient search," in Proc. 2nd IEEE International Conf. Information and Financial Engineering, Chongqing, China, 2010, pp. 241-245.



References Weight

Web of Science® Citations for all references: 231 TCR
SCOPUS® Citations for all references: 4,149 TCR

Web of Science® Average Citations per reference: 11 ACR
SCOPUS® Average Citations per reference: 198 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2016-12-06 05:05 in 49 seconds.




Note1: Web of Science® is a registered trademark of Thomson Reuters.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2016
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania


All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.

Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.

Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.




Website loading speed and performance optimization powered by: