Recent advances in peer-to-peer (P2P) technologies will enable users to establish ubiquitous connectivity among their personal networked devices and those of others. Building on top of such technologies, we propose a platform of middleware and user interaction tools, called MyNet, that allows everyday users to easily and securely access and share with others their devices, services, and content, without requiring expertise or centralized service support. MyNet offers a more immediate and responsive alternative to the current web-based paradigm of personal and social networking, because it allows users’ distributed services and content to be accessed and shared in real-time as they are produced, directly from their personal devices. In this paper, we describe the MyNet system architecture, including secure resource discovery, service management, security framework, and the user interaction tools for building personal and social networks and sharing resources over them. We also present our proof-of-concept implementation, including mobile devices and our tests with real users.

While pure Web-based services and P2P technologies are popular for personal and social networking, they both have inherent limitations. A hybrid P2P/Infrastrucutre approach could leverage strengths and address limitations of both paradigms. In this paper we propose such a platform based on MyNet, our P2P personal and social networking system. The new hybrid architecture enhances the properties of pervasive access, security and ease of use found in MyNet through the introduction of infrastructure-hosted MyNet Virtual Devices (MVD). MVDs act as userspsila personal devices, but also host MyNet-aware Internet services (MaIS), proxies for 3rdparty Internet services. A proof-of-concept prototype and user results are presented to showcase key system features.

Current radio access networks are based on tree and star topologies, which have no inherent restorability properties. This paper proposes a heuristic topology enhancement method that adds redundant spans and upgrades existing infrastructure cost-effectively, in order to create partially meshed architectures that can provide the desired level of restorability against single span failures. The algorithm is tested using several different variants of restoration mechanisms. Results show that reasonably good solutions can be achieved in a short time scale. Finally, a service-oriented protection and restoration model is presented. Attributes are defined and used to create differentiated protection classes.

In the past, wireless network reliability issues have received limited attention. Previously proposed solutions have focused on protection against base station failures, which may require significantly more base stations than necessary. Actual data from wireless carriers suggest that problems in the backhaul are the uttermost reliability problems faced, and is therefore the main focus of this work. Current radio access networks are based on tree and star-like topologies, which have no inherent restorability properties. We propose a heuristic topology enhancement method that adds redundant spans and upgrades existing infrastructure cost-effectively, in order to create partially meshed architectures that could provide the desired level of restorability against single span failure scenarios. Both span and path restoration techniques are explored. The algorithm was tested using several different variants of restoration mechanisms. Results show that the proposed heuristic algorithm is able to achieve reasonably good solutions in a time scale that is several orders of magnitude faster than an optimization approach based on binary integer programming formulation.

An IP transport scheme for third generation radio access networks (3G RAN) based on multiprotocol label switching (MPLS) technology is proposed. The basic idea is to establish and manage label switched paths for interconnecting base stations and radio network controllers. This scheme incorporates constraint-based routing and Diffserv to provide transport bears that can support bandwidth provisioning and a variety of QoS requirements in the RAN.

In this paper, an efficient scheme is proposed based on the introduced deadline-credit-based (DC) policy. This scheme is appropriate for any prerecorded media, but is particularly relevant for prerecorded semisoft continuous media (CM) applications. Semisoft are applications with very small initial delay tolerance and, thus, for which very small amount of content may be sent in advance. The proposed policy pushes content toward the end user during the session by taking advantage of any bandwidth underutilization periods, exploiting available storage, and building up fairly a deadline credit to be consumed during periods of overutilization. The scheduling policy is studied for the single-hop case (applicable to the server of the content), as well as for the multihop case (applicable to the server and network nodes). The derived results demonstrate the ability of the proposed scheme to decrease the amount of required bandwidth (or equivalently induced losses) with respect to alternative schemes without requiring large initial delay, which is not acceptable for semisoft CM applications.