200 S Laurel Ave - Bldg B
Middletown, NJ
A network design technique for selective restoration
Kostas Oikonomou, Robert Doverspike, Rakesh Sinha
OFC 2011,
2011.
[PDF]
[BIB]
Optical Society of America Copyright
The definitive version was published in proceedings of OFC 2011 (Optical Society of America). , 2011-03-09
{We outline a network design technique that exploits differences in the failure
rate and impact of network elements to produce a more efficient design. We
demonstrate its efficacy on a Tier-1 backbone network.}
Performability analysis of multi-layer restoration in a satellite network
Kostas Oikonomou, Kadangode Ramakrishnan, Robert Doverspike, Angela Chiu, Rakesh Sinha, Miguel Martinez-Heath
2007.
[TXT]
[BIB]
{Abstract. The ability of an IP backbone network to deliver robust and dependable communications relies on quickly restoring service after failures. Service-level agreements (SLAs) between a network service provider and customers typically include overall availability and performance objectives. To achieve the desired SLA, we have developed a methodology for the combined analysis of performance and reliability (performability)of networks across multiple layers by modeling the probabilistic failure state space in detail and analyzing different restoration alternatives. This methodology has been used to analyze large commercial IP-over-Optical layer networks. In this paper we extend our methodology to evaluate restoration approaches for an IP-based satellite backbone network. Because of the environment in which they operate (long delay links, frequent impairments), satellite networks pose an interesting challenge to typical restoration strategies. We describe the potential multi-layer restoration alternatives and compare their performability. Interestingly, while it is commonly thought that SONET ring restoration at the lower layer improves overall reliability, we find that it may not always improve performability in this environment. }
IP Backbone Design for Multimedia Distribution: Architecture and Performance
Guangzhi Li, Robert Doverspike, Kadangode Ramakrishnan, Dongmei Wang, Kostas Oikonomou
2006.
[PDF]
[BIB]
{Multimedia distribution, especially broadcast TV distribution over an IP network requires high bandwidth combined with tight latency and loss constraints, even under failure conditions. Due to high bandwidth requirements of broadcast TV distribution, use of IP-based multicast to distribute TV content is needed for capacity efficiency. The protection and restoration mechanisms currently adopted in IP backbones use either IGP re-convergence or some form of Fast Reroute. The IGP re-convergence mechanism is too slow for real-time multimedia distribution while a drawback of fast reroute is that since they re-route traffic on a link-basis (instead of end-to-end) they can suffer traffic overlap during failures. Here traffic overlap is defined as the same traffic passing through the same link along the same direction more than once, which requires more link capacity. We propose a method that interacts with Fast Reroute and multicast to minimize traffic overlap during failures. We also present an algorithm for link-weight setting that avoids traffic overlap for any single link failure. Performance analysis shows that the proposed method improves network service availability and significantly reduces the impact of failure events. version 2 record added in error; please see version 1 for paper. }
Network Performance And Reliability Evaluation Taking Into Account Abstract Components,
March 29, 2011
Network performability characteristics with improved accuracy are derived by taking into account, in the various analyzed network failure states, attributes of elements at the logical level other than just the capacities of edges, as well as by taking into account one or more "abstract components," such as scheduled maintenance, and by using multiple traffic matrices.
Method And Apparatus For Computing The Cost Of Providing VPN Service,
July 28, 2009
A method and apparatus is disclosed wherein a cost of bandwidth usage in a virtual private network is calculated as a function of a plurality of traffic matrices associated with said bandwidth. In a first embodiment, the cost is calculated as a function of the maximum number of channels required to support an upper bound of the bandwidth of all connections originating from at least one node in the network. In accordance with another embodiment, the cost of providing service is calculated as a function of a traffic matrix in said plurality of traffic matrices, said traffic matrix requiring the highest possible bandwidth use of all traffic matrices in said plurality of traffic matrices. Finally, in accordance with a third embodiment, said cost is calculated as a function of the most-likely amount of bandwidth used by a customer.
