18-20 Oct. 2010
Filter Results
-
Survivability of anycast and unicast flows under attacks on networks
Publication Year: 2010, Page(s):497 - 503
Cited by: Papers (1)Most of previous research on survivable networks has been focused on protecting the unicast traffic against random failures. In this paper we propose a new approach, called RA (resistant-to-attack), to provide protection of anycast and unicast communications against attacks on irregular (e.g. scale-free) networks. We use the single backup path approach to provide protection against a single node f... View full abstract»
-
A mixed integer programming model for multicast routing with multipath delay jitter reduction
Publication Year: 2010, Page(s):504 - 510
Cited by: Papers (1)Multipath routing is the technique of assigning multiple paths to destinations which is beneficial to satisfy QoS requirements, especially when there are strict delay requirements and violation from Service Level Agreement (SLA) leads to significant revenue loss. However, it has not yet analytically been analyzed that how multipath routing can improve different QoS parameters. In this paper, first... View full abstract»
-
Optimal results for Anycast-Protecting p-Cycles problem
Publication Year: 2010, Page(s):511 - 517
Cited by: Papers (3)p-Cycles present a very interesting approach to building survivable networks. They have been widely studied for unicast and recently for multicast traffic. For anycast traffic almost no research have been done. We will discuss a new p-cycles version, called Anycast-Protecting p-Cycles, introduced in our previous paper. We provide detailed description of some new properties, ILP models, results and... View full abstract»
-
Survivability of the MAP/PH/N queue with propagated failures
Publication Year: 2010, Page(s):518 - 524We consider the MAP/PH/N queueing system with propagated breakdowns. Breakdowns arrive in bunches (we call them attacks) according to the MAP. The process of further arrival of different types of server failures within an attack is governed by phase type Markov process. Recovering of the server takes an exponentially distributed time with intensity depending on the type of the occurred failure. We... View full abstract»
-
IEEE 802.11n based wireless backhaul enabled by Dual Channel IPT (DCH-IPT) relaying protocol
Publication Year: 2010, Page(s):525 - 530
Cited by: Papers (2)Wireless backhaul has received much attention as an enabler of future broadband mobile communication systems because it can reduce deployment cost of pico-cells, an essential part of high capacity system. A high throughput with a minimum delay network is highly appreciated to sustain the increasing proliferation in multimedia transmissions. In this research, we propose a backhaul network using the... View full abstract»
-
An optimum paths-finding algorithm for ±+1 path protection
Publication Year: 2010, Page(s):531 - 537A challenge towards Quality of Service (QoS) is to provide uninterrupted network services in the event of link failure. Path protection is a promising solution by employing a link-disjoint secondary backup path to protect the primary path to ensure the continuity of network services. Existing path protection schemes are classified into dedicated-path protection (e.g., 1+1 protection) and shared-pa... View full abstract»
-
A regional dangerous information service system using mobile communication and Web map delivery technology
Publication Year: 2010, Page(s):916 - 923Recently, the event that aims at children happens frequently. This threatens the safety of the regional society. The environment that can acquire information on danger at any time is requested. Thus, this paper describes the regional dangerous information service that applies three new technologies (Web map delivery, positioning system with mobile communication and Web-DB application). The regiona... View full abstract»
-
A comprehensive framework to simulate network attacks and challenges
Publication Year: 2010, Page(s):538 - 544
Cited by: Papers (6)Communication networks have evolved tremendously over the past several decades, offering a multitude of services while becoming an essential critical infrastructure in our daily lives. Networks in general, and the Internet in particular face a number of challenges to normal operation, including attacks and large-scale disasters, as well as due to the characteristics of the mobile wireless communic... View full abstract»
-
Formal analysis approach on networks with dynamic behaviours
Publication Year: 2010, Page(s):545 - 551
Cited by: Papers (2)Formal verification and validation techniques such as model checking are not widely used in computer networks. These methods are very useful to identify configuration errors, identify design problems and predict network behaviours under different network conditions. This paper describes the two main components of the formal verification process, formal modelling and the analysis process. For forma... View full abstract»
-
Link availability mapping in infrastructure-based overlay networks
Publication Year: 2010, Page(s):552 - 558Core networks are increasingly supporting overlay networks on top of an IP-WDM network. As network reliability is a growing concern, a major challenge in the survivable layered network design is the crosslayer survivable mapping problem that deals with QoS parameters such as availability, lightpath length, and many others. This work directly studies this problem and proposes matrix formulations of... View full abstract»
-
Linear programming approach to link capacity design for shared protection
Publication Year: 2010, Page(s):559 - 564
Cited by: Papers (1)The end-to-end traffic volume between source and destination nodes in a telecommunication carrier network is essential traffic information for computing the necessary link capacity for the network's primary and backup paths. However, the end-to-end traffic volumes are not frequently measured because it puts additional loads onto the network equipment, and the measuring devices are too expensive to... View full abstract»
-
Analyzing causes of failures in the Global Research Network using active measurements
Publication Year: 2010, Page(s):565 - 570
Cited by: Patents (2)With the objective to better understand how the global Internet should achieve an availability in the order of five nines, i.e. be available 0.99999 of the time, active measurements were performed between Norway and China through the Global Research Network. End-to-end downtime statistics was continuously collected during a 3-month period up to mid February 2010. In addition to periodically sendin... View full abstract»
-
Adaptive rate network coding using raptor codes for large wireless relay networks
Publication Year: 2010, Page(s):571 - 575
Cited by: Papers (1)This paper studies a network coding scheme that exploits a cooperative diversity and adaptation to variant link states for reliable networks. We propose a scheme, adaptive rate network coding (ARNC), to change the number of transmission in relay nodes according to channel states over fading channels by matching network graphs with rateless code graphs, raptor codes. In ARNC scheme, a relay transmi... View full abstract»
-
Experimental implementation of an IPTV architecture based on Content Delivery Network managed by VPLS technique
Publication Year: 2010, Page(s):576 - 581
Cited by: Papers (2)This work aims to shows how to use the base principles of a CDN (Content Delivery Network) to deliver Video Content through Open Internet for VoD (Video on Demand) service through a managed network to improve the reliability and to reduce the degradation due to congestion in the backbone area. The managed network is achieved by means of the VPLS (Virtual Protocol Lan Service) technique that allows... View full abstract»
-
Obtaining a SRLG-disjoint path pair of min-sum cost
Publication Year: 2010, Page(s):582 - 588
Cited by: Papers (5)Network survivability is very important due to the growth of Internet traffic and the number of services/business depending on telecommunication networks. A Shared Risk Link Group (SRLG) is the set of links in the network that share a common physical resource subject to fault(s). The fault of a given network resource implies a fault in all links in the corresponding SRLG. The concept of SRLG allow... View full abstract»
-
Failure localization in Transparent Optical Networks
Publication Year: 2010, Page(s):589 - 594
Cited by: Papers (2)In this paper, we address failure localization from both a practical and a theoretical perspective. After summarizing the state-of-the-art of failure localization algorithms and monitoring techniques, an overview of the most prevalent failures in optical core networks is presented. We review the role of the Optical Supervisory Channel and how it reports problems to the management plane. We analyze... View full abstract»
-
On the complexity of computing shortest fast reroute paths
Publication Year: 2010, Page(s):595 - 600In order to keep services running despite link or node failure in MPLS networks, RSVP-TE fast reroute (FRR) schemes use precomputed backup label-switched path tunnels for local repair of LSP tunnels. In the event of failure, the redirection of traffic occurs onto backup LSP tunnels that have the same quality of service constraints than original paths. In this paper, we study the algorithmic aspect... View full abstract»
-
A meta-heuristic approach for monitoring trail assignment in WDM optical networks
Publication Year: 2010, Page(s):601 - 607
Cited by: Papers (8)Optical network survivability relies on automatic fiber cut detection. Cost-effective and unambiguous fiber cut localization remains an open problem for transparent optical networks. In this paper, we focus on out-of-band monitoring techniques based on the concept of monitoring trail (m-trail) recently proposed in the literature [1]. An m-trail-based solution guarantees the exact localization of a... View full abstract»
-
The weighted graphs approach for the GMPLS network reliability enhancement
Publication Year: 2010, Page(s):608 - 614
Cited by: Papers (1)The influence of the control plane architecture on reliability of the GMPLS network is studied. A method for reliability improvement based on the graph-theoretical dominating set problem proposed by the authors in an earlier work is extended to apply for weighted graphs. The calculation of weights based on routing algorithm metrics is studied. The algorithms used to select dominating nodes are ext... View full abstract»
-
Inaccuracy of availability metrics estimated by the Serial-Parallel model
Publication Year: 2010, Page(s):615 - 621Provisioning QoS network connections with the desired availability relies on estimating the availability of the connections in advance. The redundancy of the protection - which denotes how many failures can be survived - gives a good hint on the availability, thus lower bound estimation can be carried out. If we want to achieve a more accurate approximation, we have to use other methods. The Seria... View full abstract»
-
A risk management approach to resilient network design
Publication Year: 2010, Page(s):622 - 627
Cited by: Papers (1)This paper considers the problem of where a survivability technique should be deployed in a network based on managing risk given a limited financial budget. We formulate three novel risk management resilient network design techniques: (1) minimize the maximum damage that could occur in the network, (2) minimize the maximum risk in the network and (3) minimize the root mean squared damage. The firs... View full abstract»
-
Using AR(I)MA-GARCH models for improving the IP routing table update
Publication Year: 2010, Page(s):628 - 634
Cited by: Papers (3)When an IP router updates its routing table, e.g., upon failure detection, network traffic is lost as long as the routing entries affected by the failure are not updated. In this paper, we model and predict the network traffic passing through an IP backbone router and define a dynamic heuristic in order to reduce the packet loss resulting from such routing tables entries update events. We use the ... View full abstract»
-
Dynamic alternative routing with local protection paths in MPLS networks
Publication Year: 2010, Page(s):635 - 641MPLS is a core technology for nowadays and future networks, and must meet the needs of real-time applications for which network survivability is critical. Dynamic alternative routing has already been proposed several times to increase MPLS network performance. In this paper, a proposal of a protection scheme to be used with dynamic alternative routing is presented and its performance is evaluated ... View full abstract»
-
Measurement of optical power in the upstream of PON signal from a single ONU at the side of the central office by optical power meter
Publication Year: 2010, Page(s):998 - 1002The paper presents a method for the attenuation measurement of the optical path from ONU to OLT in GPON network. Optical power meter is connected to the fiber section via splitter in central office receiving optical signal from all ONU's. Optical power difference is measured in upstream signal with desired ONU in “on” or “off” state. The difference has a linear relation... View full abstract»
-
Multi-period generation expansion planning using Genetic Algorithm
Publication Year: 2010, Page(s):358 - 363In this paper, a model for multi-period generation expansion planning (GEP) is presented. The proposed model is able to present a clear perspective to government for investment in generation. Some limits in fuel and environmental emission are also considered. Genetic Algorithm (GA) is used to optimize the results. Finally, the feasibility of this approach is demonstrated using a test power system. View full abstract»