No abstract

Failure-Independent Path-Protecting (FIPP) p-cycle is an extension of the basic p-cycle and an alternative approach for providing fully pre-connected protection paths with end-toend failure-independent path protection property. We study the unavailability of end-to-end traffic in FIPP based mesh networks, which are designed to protect against single failures and present an availability-aware network design method. Our results show that although FIPP is more efficient in terms of spare capacity redundancy than basic p-cycle [3], when the network design limits the service unavailability, FIPP tends to be less efficient and its redundancy is 8-13% more than basic p-cycle. We present our analysis and discussions on these findings.

No abstract

No abstract

No abstract

Dual-failures are considered as the main contributors to service unavailability in p-cycle based mesh networks that are designed to withstand single failures. Methods such as post-failure reconfiguration and pre-failure provisioning of additional protection capacity have been considered to add another level of protection against dual-failures. In this paper, we present availability-aware service provisioning method in networks designed to only withstand single failures. The approach we discuss builds upon previous work and uses the concept of "cutsets method" to categorize failures that cause overall service outage; we discuss some subtle issues which make existing methods inaccurate. We then develop an improved non-joint optimization ILP model for solving the service provisioning problem under the assumption of fully loaded straddling spans in p-cycles. We also address the scalability issue by introducing several techniques to speed up the run time of the model. We evaluate the resources of inaccuracy in different scenarios. Our results indicate that the ILP solutions of our models outperform the prior work in terms of estimating service path unavailability in all considered network and traffic scenarios.

No abstract

In this paper, for controlling information sharing in online social networks (OSNs) we present a community-centric access control mechanism called myCommunity. We develop heuristic ideas for efficiently computing myCommunities in OSNs and evaluate it using traces from actual OSNs. The experimental results indicate that myCommunity is a feasible idea and simple estimation strategies can be effective to obtain an initial value. In ongoing work, we are extending myCommunity to incorporate the dynamic nature of the trust within OSNs.