Category Archive: 'M.Tech Projects in NS3'
Given the wide range deployment of disconnected delay-tolerant social Internet-of-Things (SIoT), efficient resource discovery remains a fundamental challenge for large-scale SIoT. The existing search mechanisms over the SIoT do not consider preference similarity and are designed in Cartesian coordinates without sufficient consideration of real-world network deployment environments. In this paper, we propose a novel resource discovery mechanism […]
In mobile social networks (MSN), with the aim of conserving limited resources, egotistic nodes might refuse to forward messages for other nodes. Different from previous work which mainly focuses on promoting cooperation between selfish nodes, we consider it from a more pragmatic perspective in this paper. Be specific, we regard selfishness as a native attribute of a system and […]
The reliability of peers is very important for safe communication in Peer-to-Peer (P2P) systems. The reliability of a peer can be evaluated based on the reputation and interactions with other peers toprovide different services. However, in order to decide the peer reliability there are needed many parameters, which make the problem NP-hard. In this paper, we propose and evaluate a new fuzzy-based reliability system for P2P communications […]
DC Microgrid Performance Excellence in Electricity Renewal is a major stimulating result of the decade-long non-profit Galvin Electricity Initiative and its objective of demonstrating and promoting truly intelligent 21st Century “Perfect Power” electricity distribution systems. The resulting Performance Excellence in Electricity Renewal (PEER) program with DC Microgrid certification is now being formally administered by the Green […]
There are two types of P2P systems satisfying two different user demands: 1) file downloading and 2) video-on-demand (VoD) streaming. An example of file downloading is the original BitTorrent, and examples for VoD streaming include various commercial P2P-based VoD streaming systems such as that offered by PPLive. We have a hypothesis – by combining a […]
Distributed applications require coordination of distributed software components in order to achieve a common goal. A coordination model that abstracts the complexity of network communication eases the development of such applications. The objective is to design collaboration with remote hosts in the same way as local interactions. Separation of coordination logic and application code increases maintainability, as components can be easily […]
Low latency, high throughput, and fairness are the stringent performance requirements of data centernetworks. For web applications continue to thrive, data center must remain effective by addressing these challenges. While most of the challenges have been handled by data center specific transport protocols (e.g. DCTCP), these transport protocols are not default options for data center users. Free […]
Binge drinking is an important global health issue that results in a range of health and social harms. Mobile technology’s portability and connectivity can be used in-situ to encourage the practice of monitoring and moderating alcohol use. Social networking services, if used among peer-supportnetworks to promote responsible drinking, could be effective in moderating alcohol consumption. In this article, the authors describe the […]
Name resolution is at the heart of Information-Centric Networking (ICN), where names are used to both identify information and/or services, and to guide routing and forwarding inside the network. The ICN focus on information, rather than hosts, raises significant concerns regarding the scalability of the required Name Resolution System (NRS), especially when considering global scale, inter-domain deployments. In the route-by-name approach to NRS construction, […]
We consider a peer-to-peer (P2P)-assisted video-on-demand (VoD) system where each peer can store a relatively small number of movies to offload the server when these movies are requested. User requests are stochastic based on some movie popularity distribution. The problem is how to replicate (or place) content at peer storage to minimize the server load. Several variations of this replication problem have been studied recently with somewhat […]