{'fraction_non_alphanumeric': 0.02947845804988662, 'fraction_numerical': 0.0, 'mean_word_length': 5.3349282296650715, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Partial Complete iBGP

The Internet is a composition of ASes (Autonomous Systems), BGP (Border Gateway Protocol) is the routing protocol that is responsible of exchanging routes between these ASes. It operates in two modes: eBGP (External BGP) and iBGP (Internal BGP). EBGP exchanges routing information between ASes, while iBGP propagates that information within the AS. IBGP node has not the ability to reflect routes. Therefore, each internal node should have iBGP sessions with all ASBRs (Autonomous System Border Routers). BGP route reflection was widely employed as an alternative to full mesh solution to reduce the needed number of iBGP sessions and, in turn, increase the scalability inside the AS. Under particular configuration, BGP scaling mechanism defined in route reflection mechanism introduces persistent route oscillation, forwarding loops, and non-optimal egress nodes. We propose the PC-iBGP (Partial Complete iBGP) as an alternative to the route reflection approach. PC- iBGP nodes have the ability of reflecting routes. It eliminates the use of clusters and establishes iBGP sessions only between single hop neighbors. We prove that it holds sufficient correctness conditions as well as its robustness against failures, asymmetric path problem, and MED (Multi Exit Discriminator) induced oscillations.