Showing papers in "Computer Networks in 2012"

TL;DR: This paper identifies appropriate policies for the establishment and the management of social relationships between objects in such a way that the resulting social network is navigable and describes a possible architecture for the IoT that includes the functionalities required to integrate things into a social network.

TL;DR: This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext, and looks at the problem of how to effectively deal with uncontrolled hypertext collections.

TL;DR: This paper describes the main properties that a network workload generator should have today, and presents a tool for the generation of realistic network workload that can be used for the study of emerging networking scenarios.

TL;DR: This paper presents the most relevant research efforts made around RPL routing protocol that pertain to its performance evaluation, implementation, experimentation, deployment and improvement, and points out open research challenges on the RPL design.

TL;DR: This survey is the first to identify routing design issues for the SG and categorize the proposed routing protocols from the SG applications perspective and provides a comprehensive survey of the existing routing research and analyze the advantages and disadvantages of the proposed protocols with respect different applications areas.

TL;DR: A survey of the routing algorithms proposed for wireless networks is presented, which offers a comprehensive review of various categories such as Geographical, Geo-casting, Hierarchical, Multi-path, Power-aware, and Hybrid routing algorithms.

TL;DR: An overview of online social networks is provided to contribute to a better understanding of this worldwide phenomenon and addresses the following questions: What are the major functionalities and characteristics ofOnline social networks?

TL;DR: This paper proposes a routing-by-name architecture, named Lookup-and-Cache, where the FIB is used as a cache of routes, while the RIB is stored in a remote and centralized routing engine, and proves the effectiveness of the proposed architecture.

TL;DR: An RSA algorithm to be used in dynamic network scenarios is presented, the optimal slot width is studied as a function of the foreseen traffic to be served, and an algorithm to reallocate already established optical connections so that to make room in the spectrum for the new ones is proposed.

TL;DR: This paper devise a topology-aware measure on node resources based on random walks and use it to rank a node's resources and topological attributes and devise a greedy algorithm that matches nodes in the VN to nodes inThe substrate network according to node ranks.

TL;DR: The proposed mechanism, referred to as BotGAD (botnet group activity detector) needs a small amount of data from DNS traffic to detect botnet, not all network traffic content or known signatures, and shows that it can automatically detect botnets while providing real-time monitoring in large scale networks.

TL;DR: Two energy aware cost based routing algorithms named Exponential and Sine Cost Function based Route (ESCFR) and Double Cost Function Based Route (DCFR) have been proposed in this paper and have significantly better performance than existing competing algorithms.

TL;DR: This paper is devoted to the study of energy efficiency in optical transport networks, comparing the performance of an innovative flexible-grid network based on Orthogonal Frequency Division Multiplexing (OFDM) with that of conventional fixed-grid Wavelength Division MultipleXing (WDM) networks with a Single Line Rate (SLR) and with a Mixed Line rate (MLR) operation.

TL;DR: Experimental results demonstrate that the proposed CPR-based approach is substantially more effective compared to an existing Discrete Fourier Transform (DFT)-based approach - one of the most efficient approaches in detecting LDDoS attacks.

TL;DR: Current works are investigated, the key issues are discussed, and the future work of policy languages are outlined, especially for the network and security management.

TL;DR: This paper proposes a fast and secure handover authentication scheme, which is to fit in with all of the mobility scenarios in the LTE networks and cannot only achieve a simple authentication process with desirable efficiency, but also provide several security features including Perfect Forward/Backward Secrecy (PBS/PFS), which has never been achieved by previous works.

TL;DR: The aim of the method is to prevent malicious users from illicitly gaining high reputation in the network by demoting them in the ranking of users, and shows the propagation of trust and distrust to be a reliable mechanism in a Trust and Reputation System.

TL;DR: This paper presents efficient counting algorithms for 4-node graphlets, and shows how to efficiently count the total number of each type of graphlet, and the number of graphlets adjacent to a node, and presents a new algorithm for node position-aware graphlet counting, namely partitioning the graphlet count by the node position in the graphs.

TL;DR: The main goal of this work is to quantitatively evaluate the potential energy savings from applying energy-efficient techniques, while examining the trade-off between network performance and the achieved energy savings.

TL;DR: It is found that node importance is highly predictable due to both periodic and legacy effects of human social behaviour, and reasonable prediction functions are designed that can be efficiently computed in linear time, and are thus practical for processing dynamic networks in real-time.

TL;DR: This paper defines a new measure, called regulated neighborhood distance (RND), to address the hop-distance ambiguity problem by relating the proximity of two neighbors to their neighbor partitions, and proposes a new RND-based range-free localization method.

TL;DR: The lessons from this retrospective examination of the evolution of the Web are outlined, the main outcomes of Web Science activities are presented and directions along which future developments could be anticipated are discussed.

TL;DR: A novel algorithm, called GRiDA, to selectively switch off links in an Internet Service Provider IP-based network to reduce the system energy consumption is proposed, which achieves performance comparable to several existing centralized algorithms.

TL;DR: This paper presents an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol, which performs real-time, active traffic monitoring and uses data and other data gathered through passive mechanisms to assign a reliability rating to each street edge.

TL;DR: The performance evaluations show that the ZigBee is ideal to use for low-power and low-data rate smart grid applications not having very high reliability requirements and real-time deadlines.

TL;DR: This paper provides a comprehensive and in-depth survey of P2P live video streaming schemes from an algorithmic perspective, and identifies critical design choices in each aspect and proposes a taxonomy according to these choices.

TL;DR: It is argued that applications on the Internet should be built with privacy and security as a mandatory requirement, then an overview of the state of the art in privacy-enhancing mechanisms is provided, and a roadmap towards a privacy- enhanced digital world is concluded, pointing out a number of challenges that need to be solved.

TL;DR: An effective strategy for establishing connectivity among the partitioned segments by deploying the least count of relay nodes (RNs) by using an Optimized Relay node placement algorithm using a minimum Steiner tree on the Convex hull (ORC).

TL;DR: A taxonomy of security and reliability for cluster head election and clustering in WSNs is defined and the most relevant secure and reliable clustering protocols are described and analyzed.

TL;DR: This paper examines the use of the Web in education to date and looks forward to new challenges and aspirations such as MOOCs (massively online open coursewares) and the immersive 3D Web as the basis for the next generation of learning environments.