Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKong, L.en
dc.contributor.authorShen, H.en
dc.identifier.citationComputer Science and Information Systems, 2015; 12(4):1327-1344en
dc.description.abstractTo resolve the difficulties in deployment of the classic security solution S-BGP (Secure Border Gateway Protocol), the Translator Trust Model (TTM) for a new solution SE-BGP (Security Enhanced BGP) was proposed to transform the centralized deployment mode of S-BGP to distributed mode. However, the trust (attestations of routing information) translation of TTM only depends on a single hub node and this results in severe threats for the inter-domain routing system. To overcome the deficiencies of TTM, in this paper we improve TTM to Distributed TTM (DTTM) by expanding the single hub node to a set of selected multiple hub nodes; in our DTTM, the task of attestations is distributed over multiple hub nodes instead of on a single hub node. In order to make the hub nodes respond to the case of single node failures, we design a restoration mechanism to recover the network based on the neighbour-ring structure. Besides, we develop Cooperative Secure BGP (CSBGP) to realize DTTM in BGP. In comparison with SE-BGP, our experimental results show that CS-BGP achieves an improved scalability, reduced convergence time and enhanced security.en
dc.description.statementofresponsibilityLingjing Kong and Hong Shenen
dc.publisherComSIS Consortiumen
dc.rightsCopyright status unknownen
dc.subjectBGP security; TTM; DTTM; restoration mechanism; CS-BGPen
dc.titleAchieving inter-domain routing security based on distributed translator trust modelen
dc.typeJournal articleen
pubs.library.collectionComputer Science publicationsen
dc.identifier.orcidShen, H. [0000-0002-3663-6591]en
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.