You are on page 1of 4

Webservices Journal-2011

How Private Is the Internet?

Kaufman, L.M.; Security & Privacy, IEEE Volume: 9 , Issue: 1 Digital Object Identifier: 10.1109/MSP.2011.11 Publication Year: 2011 , Page(s): 73 - 75 IEEE JOURNALS Abstract | Full Text: PDF (163 KB)

Most common uses of the Internet are email, Web surfing, and transactions ranging from e-commerce to bill paying. This paper discussed on how to prevent eavesdropping and eliminate possible attack modalities. HTTPS allows for the growing work of e-commerce, online banking and bill paying, and other activities requiring secure information exchange. Read More

Security and Privacy in Social Networks


Ahn, Gail-Joon; Shehab, Mohamed; Squicciarini, Anna; Internet Computing, IEEE Volume: 15 , Issue: 3 Digital Object Identifier: 10.1109/MIC.2011.66 Publication Year: 2011 , Page(s): 10 - 12 IEEE JOURNALS Abstract | Full Text: PDF (747 KB)

Over the past several years, social networking sites have arisen to facilitate social interactions on the Internet while revolutionizing how online users interact with others. Most social networking sites offer the basic features of online interaction, communication, and interest sharing, letting individuals create online profiles that other users can view. Unfortunately, current trends in social networks indirectly require users to become system and policy administrators to protect their online contents. Social networks' security and privacy requirements still aren't well understood or fully defined. Nevertheless, it's clear that they'll be quite different from classic security and privacy requirements because social networks involve user-centric concerns and allow multiple users to specify security policies on shared data. So, we must bring a depth of security experience from multiple security domains and technologies to this field, as well as a breadth of knowledge about social networks. Read More

From Crowdsourcing to Crowdservicing

Davis, J.G.; Internet Computing, IEEE Volume: 15 , Issue: 3 Digital Object Identifier: 10.1109/MIC.2011.61 Publication Year: 2011 , Page(s): 92 - 94 IEEE JOURNALS Abstract | Full Text: PDF (269 KB) The evolving vision of Web 3.0 is based on the balanced integration of diverse services provided by human agents and machines over the World Wide Web. This is also the intuition that drives crowdservicing, which helps in creating platforms on which new applications and even enterprises can be build. Crowdsourcing as a concept as well as a practice refers to the idea that the Web can facilitate the aggregation or selection of useful information from a potentially large number of people connected to the Internet. Read More

Guest Editors' Introduction: Provenance in Web Applications

Lakshmanan, G.T.; Curbera, F.; Freire, J.; Sheth, A.; Internet Computing, IEEE Volume: 15 , Issue: 1 Digital Object Identifier: 10.1109/MIC.2011.9 Publication Year: 2011 , Page(s): 17 - 21 IEEE JOURNALS Abstract | Full Text: PDF (1042 KB)

The Web has completely changed the way in which we share data, rapidly shifting us from a world of paper documents to a world of digital objects that include online documents, videos, photos, artwork, and databases. This shift has also made data management an increasingly complex problem as applications take advantage of loosely coupled resources brought together by distributed computing systems and abundant storage capacity. It's now easier than ever to modify documents, particularly with the help of general-purpose specifications such as XML, and extract data from documents or databases through the use of technologies such as query languages, REST interfaces, and Web service interconnectivity. Read More

Why Web Services Need Social Networks

Maamar, Z.; Hacid, H.; Huhns, M.N.; Internet Computing, IEEE Volume: 15 , Issue: 2 Digital Object Identifier: 10.1109/MIC.2011.49 Publication Year: 2011 , Page(s): 90 - 94 IEEE JOURNALS Abstract | Full Text: PDF (672 KB)

To make Web services recommend the peers with whom they would like to collaborate in case of compositions, recommend the peers that can substitute for them in case of failure, and be aware of the peers that compete against them in case of selection, weaving social computing elements into service-oriented computing principles is required. We discuss how this weaving takes place. Read More

Nymble: Blocking Misbehaving Users in Anonymizing Networks

Tsang, P.P.; Kapadia, A.; Cornelius, C.; Smith, S.W.; Dependable and Secure Computing, IEEE Transactions on Volume: 8 , Issue: 2 Digital Object Identifier: 10.1109/TDSC.2009.38 Publication Year: 2011 , Page(s): 256 - 269 IEEE JOURNALS Abstract | Full Text: PDF (1294 KB)

Anonymizing networks such as Tor allow users to access Internet services privately by using a series of routers to hide the client's IP address from the server. The success of such networks, however, has been limited by users employing this anonymity for abusive purposes such as defacing popular Web sites. Web site administrators routinely rely on IPaddress blocking for disabling access to misbehaving users, but blocking IP addresses is not practical if the abuser routes through an anonymizing network. As a result, administrators block all known exit nodes of anonymizing networks, denying anonymous access to misbehaving and behaving users alike. To address this problem, we present Nymble, a system in which servers can blacklist misbehaving users, thereby blocking users without compromising their anonymity. Our system is thus agnostic to different servers' definitions of misbehavior-servers can blacklist users for whatever reason, and the privacy of blacklisted users is maintained. Read More

Distributed Service-Oriented Robotics

Remy, S.L.; Blake, M.B.; Internet Computing, IEEE Volume: 15 , Issue: 2 Digital Object Identifier: 10.1109/MIC.2011.38 Publication Year: 2011 , Page(s): 70 - 74 IEEE JOURNALS Abstract | Full Text: PDF (637 KB)

The Internet's next evolution will require the current Internet (which concentrates on information access) to combine with an Internet of Things. Consequently, Web services that operate on information will need to seamlessly interoperate with services, and perhaps robotic capabilities, which interact with physical objects. While the paradigm known as service-oriented computing has adopted standard interfaces that aggregate data-centric services, the development of similar standard interfaces for distributed robotic services (that have access to physical objects) has been a challenge for academic and industrial researchers. Read More

Toward energy-efficient content dissemination

Uichin Lee; Rimac, I.; Kilper, D.; Hilt, V.; Network, IEEE Volume: 25 , Issue: 2 Digital Object Identifier: 10.1109/MNET.2011.5730523 Publication Year: 2011 , Page(s): 14 - 19 IEEE JOURNALS Abstract | Full Text: PDF (262 KB)

A major role of today's Internet is to provide efficient content dissemination among users, such as distributing multimedia content and sharing user generated data. To meet the ever increasing demands, the Internet has been rapidly growing, and it now includes a web of tens of millions of networked devices ranging from content servers to core and edge routers to home gateways. Due to the sheer numbers, however, it is reported that these devices, such as those used for content delivery, consume a considerable amount of energy. While optimizing the energy efficiency of data centers is well studied in the literature, understanding the energy efficiency of various content dissemination strategies has received comparatively little attention thus far. In this article we review existing content dissemination architectures and survey the energy efficiency of various network devices used for content delivery. The energy efficiency comparison using simple trace-based simulations reveals that a change from a host-oriented to a contentcentric networking model can substantially improve energy efficiency of content dissemination. Our preliminary results are encouraging and will stimulate further research in this direction. Read More

INTERNET COMPUTING
Site-Based Partitioning and Repartitioning Techniques for Parallel PageRank Computation

Cevahir, A.; Aykanat, C.; Turk, A.; Cambazoglu, B.B.; Parallel and Distributed Systems, IEEE Transactions on Volume: 22 , Issue: 5 Digital Object Identifier: 10.1109/TPDS.2010.119 Publication Year: 2011 , Page(s): 786 - 802 IEEE JOURNALS Abstract | Full Text: PDF (5661 KB)

The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrix-vector multiplications where the involved web matrices grow in parallel with the growth of the web and are stored in a distributed manner due to space limitations. Hence, the PageRank computation, which is frequently repeated, must be performed in parallel with high-efficiency and low-preprocessing overhead while considering the initial distributed nature of the web matrices. Our contributions in this work are twofold. We first investigate the application of state-of-the-art sparse matrix partitioning models in order to attain high efficiency in parallel PageRank

computations with a particular focus on reducing the preprocessing overhead they introduce. For this purpose, we evaluate two different compression schemes on the web matrix using the site information inherently available in links. Second, we consider the more realistic scenario of starting with an initially distributed data and extend our algorithms to cover the repartitioning of such data for efficient PageRank computation. We report performance results using our parallelization of a state-of-the-art PageRank algorithm on two different PC clusters with 40 and 64 processors. Experiments show that the proposed techniques achieve considerably high speedups while incurring a preprocessing overhead of several iterations (for some instances even less than a single iteration) of the underlying sequential PageRank algorithm. Read More

TERSE: A Unified End-to-End Traffic Control Mechanism to Enable Elastic, Delay Adaptive, and Rate Adaptive Services

Ye, Lei; Wang, Zhijun; Che, Hao; Lagoa, Constantino M.; Selected Areas in Communications, IEEE Journal on Volume: 29 , Issue: 5 Digital Object Identifier: 10.1109/JSAC.2011.110504 Publication Year: 2011 , Page(s): 938 - 950 IEEE JOURNALS Abstract | Full Text: PDF (1106 KB)

This paper puts forward an end-to-end traffic control solution, which we refer to as TCP-Elastic Real-time SErvice (TERSE). TERSE provides a unified end-to-end traffic control protocol that enables Non-Real-time Elastic (NRE) service (i.e., the same as the one under the TCP control), Real-time Delay Adaptive (RDA) service, and Real-time Rate Adaptive (RRA) service. A specific service is enabled by properly setting a single parameter in the protocol. TERSE is underpinned by a sound design methodology. While having its roots in a well-known utility-based optimization approach, this methodology successfully addresses its limitations. It leads to a unified traffic control protocol, which has several provable properties, including fairness, convergence, and stability. The protocol is implemented in LINUXbased systems. The cross-pacific testing of this protocol shows that it can achieve more than 1.2Mbps throughput performance, 150% higher than TCP-reno and 50% higher than TCP cubic. Both analytical and simulation studies also show that it can provide soft minimum-rate guarantees for both RRA and RDA traffic flows. Moreover, simulation also demonstrates that it is resilient to network resource shortage. As part of the protocol design, an effective utility function of TCP and the corresponding control law are derived, which captures TCP behavior not only in a qualitative but also in a quantitative manner. Read Mor