Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, Chia-Taien_US
dc.contributor.authorJan, Rong-Hongen_US
dc.contributor.authorWang, Kuochenen_US
dc.date.accessioned2014-12-08T15:47:40Z-
dc.date.available2014-12-08T15:47:40Z-
dc.date.issued2010-12-01en_US
dc.identifier.issn1074-5351en_US
dc.identifier.urihttp://dx.doi.org/10.1002/dac.1127en_US
dc.identifier.urihttp://hdl.handle.net/11536/31888-
dc.description.abstractHow to optimally allocate redundant routers for high availability (HA) networks is a crucial task. In this paper, a 5-tuple availability function A (N, M, lambda, mu, delta) is proposed to determine the minimum required number of standby routers to meet the desired availability (rho) of an HA router, where N and M are the numbers of active routers and standby routers, respectively, and lambda, mu, and delta are a single router's failure rate, repair rate, and failure detection and recovery rate, respectively. We have derived the availability function, and analytical results show that the failure detection and recovery rate (delta) is a key parameter for reducing the minimum required number of standby routers of an HA router. Thus, we also propose a High Availability Management (HAM) middleware, which was designed based on an open architecture specification, called OpenAIS, to achieve the goal of reducing takeover delay (1/delta) by stateful backup. We have implemented an HA Open Shortest Path First (HA-OSPF) router, which consists of two active routers and one standby router, to illustrate the proposed HA router. Experimental results show that the takeover delays of the proposed HA-OSPF router were reduced by 6, 37.3, and 98.6% compared with those of the industry standard approaches, the Cisco-ASR 1000 series router, the Juniper MX series router, and the Virtual Router Redundancy Protocol (VRRP) router, respectively. In addition, in contract to the industry routers, the proposed HA router, which was designed based on an open architecture specification, is more cost-effective, and its redundancy model can be more flexibly adjusted. Copyright (C) 2010 John Wiley & Sons, Ltd.en_US
dc.language.isoen_USen_US
dc.subjectcontinues time Markov chainen_US
dc.subjectfailure detection and recovery rateen_US
dc.subjecthigh availabilityen_US
dc.subjectOSPFen_US
dc.subjectredundancy modelen_US
dc.titleOptimal redundancy allocation for high availability routersen_US
dc.typeArticleen_US
dc.identifier.doi10.1002/dac.1127en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMSen_US
dc.citation.volume23en_US
dc.citation.issue12en_US
dc.citation.spage1581en_US
dc.citation.epage1599en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000285307900008-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000285307900008.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.