February 2018 - Bird-users

Adding more then one bgp community at once
by Борис Коваленко 05 May '23

05 May '23

Hello! Is this possible to add many communites at once? bgp_community.add([(1,1), (1,2)]) is wrong "Setting clist attribute to non-clist value" Regards, Boris -- С уважением, Борис Коваленко

4 5

Bird 1.6.3 removing IPv6 device routes on Linux (3.10.0)
by Ben Arblaster 12 Oct '19

12 Oct '19

Hi, I’m seeing an issue with bird 1.6.3 where IPv6 device routes are unexpectedly removed from the kernel table on Linux (3.10.0, CentOS 7) when bird removes a matching route learned via another protocol (in this case OSPF). To reproduce, I’ve rigged up a very simple test with two bird6 instances running OSPF in a single area 0 over a ptp tunnel. Configs are here - https://gist.github.com/andatche/ca5b5ac120e09b6b8171ec5ca95d2e25 If I add an address/network (e.g. fd00::1/64) to an interface (dummy0) on host A, the route is flooded by A, learned by B and correctly installed in the kernel table on B: fd00::/64 via fe80::5efe:ae2:b006 dev tun0 proto bird metric 1024 If I then add the same address/network (e.g. fd00::1/64) to an interface (dummy0) on host B, at that instant a device route is installed in the kernel table alongside the existing route on host B and it now looks like this: fd00::/64 dev dummy0 proto kernel metric 256 fd00::/64 via fe80::5efe:ae2:b006 dev tun0 proto bird metric 1024 Shortly after, bird picks up the new address/network on dummy0, recalculates the area and correctly selects the connected route as the new best. It then removes the old route via host A from the kernel table, as expected: kernel1 < removed fd00::/64 via fe80::5efe:ae2:b006 on tun0 However, this causes both the route via host A *and* the device route to be removed from the kernel table, leaving the kernel table on host B with no route to fd00::/64 at all. # ip -6 route show fd00::/64 # This is a change in behaviour from 1.4.5 and seems like a bug, rather than the expected behaviour? Regards, Ben -- Ben Arblaster e: ben(a)andatche.com t: +447943860840 w: https://andatche.com

3 3

manipulating the best path, eBGP, MED?
by Thomas＠PhaseHosting 14 Apr '18

14 Apr '18

Supp, I implemented bird in our Private cloud running proxmox to distribute our public address with eBGP to our serverhost. Through iBGP and a ucarp interface i have a HA gateway, the problem is that our host receives the routes but there are multiple entry points to our subnet ( the proxmox hosts). This makes that a diffrent in & out route doenst work. through following link: https://supportforums.cisco.com/document/126691/understanding-bgp-best-path… I learned that my hosts selects its route based on age ( the bird with the first connection is chosen). Can i send a multi-exit discriminator with my eBGP connection to my host? I googled but could find 2 answers that did't change anything: # your default gateway IP below here protocol bgp eBGP { import none; export where proto = "static_packet"; local as 65000; neighbor 10.80.x.x as 65530; password "SECRET"; #med metric 10; #default bgp_med 10; } (offcourse i tried both without # and waited till export) Or is there an other way to make sure that our host routes always to the first server and so on. -- Thomas Valgaeren thomas(a)phasehosting.io +32477915307

6 8

[PATCH] babel: Use acknowledged retractions when losing a prefix
by Toke Høiland-Jørgensen 04 Apr '18

04 Apr '18

In order to prevent routing loops, Babel installs temporary blackhole routes to prefixes that expire or are otherwise lost. These blackhole routes are maintained for a while to ensure the route has been flushed from the whole network; the default hold time is 64 seconds. In the updated IETF version of Babel (rfc6126bis), an alternative procedure was added which replaces this hold time with an explicit acknowledgement procedure. This procedure simply consists of sending a retraction along with an acknowledgement request to all neighbours, and removing the blackhole route once all neighbours have acknowledged the retraction. As this usually happens pretty quickly, the hold time during which the route is blackholed is almost completely avoided. This patch implements the above behaviour. It adds a generic facility to the Babel protocol which allows for sending sequences of acknowledgement requests to a number of neighbours, and executing a callback function once all the requests have been ACKed. This facility is then used to implement the acknowledgement scheme when a route is lost. Signed-off-by: Toke Høiland-Jørgensen <toke(a)toke.dk> --- proto/babel/babel.c | 199 +++++++++++++++++++++++++++++++++++++++++++++++--- proto/babel/babel.h | 25 +++++++ proto/babel/packets.c | 71 +++++++++++++++++- 3 files changed, 283 insertions(+), 12 deletions(-) diff --git a/proto/babel/babel.c b/proto/babel/babel.c index 3cf8aaf0..3d235382 100644 --- a/proto/babel/babel.c +++ b/proto/babel/babel.c @@ -52,8 +52,10 @@ static void babel_select_route(struct babel_proto *p, struct babel_entry *e, str static inline void babel_announce_retraction(struct babel_proto *p, struct babel_entry *e); static void babel_send_route_request(struct babel_proto *p, struct babel_entry *e, struct babel_neighbor *n); static void babel_send_seqno_request(struct babel_proto *p, struct babel_entry *e, struct babel_seqno_request *sr); +static void babel_send_ack_sequence(struct babel_ack_sequence *seq); +static void babel_flush_outgoing_ack(struct babel_outgoing_ack_req *ack); static void babel_update_cost(struct babel_neighbor *n); -static inline void babel_kick_timer(struct babel_proto *p); +static inline void babel_kick_timer(struct babel_proto *p, btime interval); static inline void babel_iface_kick_timer(struct babel_iface *ifa); static inline void babel_lock_neighbor(struct babel_neighbor *nbr) @@ -428,6 +430,7 @@ babel_get_neighbor(struct babel_iface *ifa, ip_addr addr) nbr->txcost = BABEL_INFINITY; nbr->cost = BABEL_INFINITY; init_list(&nbr->routes); + init_list(&nbr->ack_reqs); babel_lock_neighbor(nbr); add_tail(&ifa->neigh_list, NODE nbr); @@ -438,6 +441,7 @@ static void babel_flush_neighbor(struct babel_proto *p, struct babel_neighbor *nbr) { struct babel_route *r; + struct babel_outgoing_ack_req *a; node *n; TRACE(D_EVENTS, "Removing neighbor %I on %s", nbr->addr, nbr->ifa->iface->name); @@ -449,6 +453,12 @@ babel_flush_neighbor(struct babel_proto *p, struct babel_neighbor *nbr) babel_flush_route(p, r); } + WALK_LIST_FIRST(n, nbr->ack_reqs) + { + a = SKIP_BACK(struct babel_outgoing_ack_req, neigh_ack, n); + babel_flush_outgoing_ack(a); + } + nbr->ifa = NULL; rem_node(NODE nbr); babel_unlock_neighbor(nbr); @@ -508,6 +518,69 @@ babel_expire_neighbors(struct babel_proto *p) } } +static void babel_flush_ack_seq(struct babel_ack_sequence *seq) +{ + struct babel_proto *p = seq->p; + struct babel_msg_node *msgn; + + rem_node(NODE seq); + + WALK_LIST_FIRST(msgn, seq->payload) + { + rem_node(NODE msgn); + sl_free(p->msg_slab, msgn); + } + + mb_free(seq); +} + +static int +babel_check_ack_seq(struct babel_ack_sequence *seq) +{ + if (EMPTY_LIST(seq->acks)) + { + seq->callback(seq); + babel_flush_ack_seq(seq); + return 1; + } + return 0; +} + +static void +babel_flush_outgoing_ack(struct babel_outgoing_ack_req *ack) +{ + struct babel_ack_sequence *seq = ack->seq; + rem_node(&ack->neigh_ack); + rem_node(NODE ack); + mb_free(ack); + babel_check_ack_seq(seq); +} + +static void +babel_expire_ack_seqs(struct babel_proto *p) +{ + struct babel_ack_sequence *seq, *nxt; + btime now_ = current_time(); + + WALK_LIST_DELSAFE(seq, nxt, p->ack_seqs) + { + if (now_ >= seq->expires) + { + if (seq->retries > 0) + { + babel_send_ack_sequence(seq); + seq->retries--; + seq->expires = now_ + BABEL_ACK_RETRY_INTERVAL; + babel_kick_timer(p, BABEL_ACK_RETRY_INTERVAL); + } + else + { + babel_flush_ack_seq(seq); + } + } + } +} + /* * Best route selection @@ -784,6 +857,40 @@ babel_send_ack(struct babel_iface *ifa, ip_addr dest, u16 nonce) babel_send_unicast(&msg, ifa, dest); } +static void +babel_send_ack_sequence(struct babel_ack_sequence *seq) +{ + struct babel_msg_node msgn = {}; + struct babel_outgoing_ack_req *ack; + + msgn.msg.type = BABEL_TLV_ACK_REQ; + msgn.msg.ack_req.interval = BABEL_ACK_RETRY_INTERVAL; + add_tail(&seq->payload, NODE &msgn); + + WALK_LIST(ack, seq->acks) { + DBG("Sending ACK request to %I with nonce %d\n", ack->nbr->addr, ack->nonce); + msgn.msg.ack_req.nonce = ack->nonce; + babel_send_unicast_list(&seq->payload, ack->nbr->ifa, ack->nbr->addr); + } + rem_node(NODE &msgn); +} + +static void +babel_retraction_ack_complete(struct babel_ack_sequence *seq) +{ + struct babel_proto *p = seq->p; + struct babel_msg_node *msgn = HEAD(seq->payload); + struct babel_entry *e = babel_find_entry(p, &msgn->msg.update.net) + + ASSERT(msgn->msg.type == BABEL_TLV_UPDATE); + + if (e && e->unreachable && e->valid == BABEL_ENTRY_STALE) + { + DBG("ACK sequence for retraction complete, retracting route: %N\n", e->n.addr); + babel_announce_retraction(p, e); + } +} + static void babel_build_ihu(union babel_msg *msg, struct babel_iface *ifa, struct babel_neighbor *n) { @@ -1020,7 +1127,7 @@ babel_send_retraction(struct babel_iface *ifa, net_addr *n) TRACE(D_PACKETS, "Sending retraction for %N seqno %d", n, p->update_seqno); msg.type = BABEL_TLV_UPDATE; - msg.update.interval = ifa->cf->update_interval; + msg.update.interval = BABEL_INFINITY; msg.update.seqno = p->update_seqno; msg.update.metric = BABEL_INFINITY; msg.update.net = *n; @@ -1028,6 +1135,54 @@ babel_send_retraction(struct babel_iface *ifa, net_addr *n) babel_enqueue(&msg, ifa); } +static void +babel_send_retraction_acked(struct babel_proto *p, net_addr *n) +{ + struct babel_ack_sequence *seq = mb_allocz(p->p.pool, sizeof(struct babel_ack_sequence)); + struct babel_msg_node *msgn = sl_alloc(p->msg_slab); + struct babel_iface *ifa; + struct babel_neighbor *nbr; + int i = 0; + + init_list(&seq->acks); + init_list(&seq->payload); + memset(msgn, 0, sizeof(*msgn)); + seq->callback = babel_retraction_ack_complete; + seq->expires = current_time() + BABEL_ACK_RETRY_INTERVAL; + seq->retries = BABEL_ACK_RETRIES; + seq->p = p; + add_tail(&p->ack_seqs, NODE seq); + + msgn->msg.type = BABEL_TLV_UPDATE; + msgn->msg.update.interval = BABEL_INFINITY; + msgn->msg.update.seqno = p->update_seqno; + msgn->msg.update.metric = BABEL_INFINITY; + msgn->msg.update.net = *n; + + add_tail(&seq->payload, NODE msgn); + + WALK_LIST(ifa, p->interfaces) { + WALK_LIST(nbr, ifa->neigh_list) { + struct babel_outgoing_ack_req *ack = mb_allocz(p->p.pool, sizeof(struct babel_outgoing_ack_req)); + ack->nbr = nbr; + ack->seq = seq; + ack->nonce = random(); + add_tail(&seq->acks, NODE ack); + add_tail(&nbr->ack_reqs, &ack->neigh_ack); + i++; + } + } + + DBG("Created ACK sequence for %N with %d requests\n", n, i); + + /* Sequence may be empty if we have no neighbors */ + if (!babel_check_ack_seq(seq)) + { + babel_send_ack_sequence(seq); + babel_kick_timer(p, BABEL_ACK_RETRY_INTERVAL); + } +} + static void babel_send_wildcard_retraction(struct babel_iface *ifa) { @@ -1096,11 +1251,35 @@ babel_update_hello_history(struct babel_neighbor *n, u16 seqno, uint interval) n->last_hello_int = interval; } - /* * TLV handlers */ +void +babel_handle_ack(union babel_msg *m, struct babel_iface *ifa) +{ + struct babel_proto *p = ifa->proto; + struct babel_msg_ack *msg = &m->ack; + node *n; + + TRACE(D_PACKETS, "Handling ACK nonce %d from %I", + msg->nonce, msg->sender); + + struct babel_neighbor *nbr = babel_find_neighbor(ifa, msg->sender); + if (!nbr) + return; + + WALK_LIST(n, nbr->ack_reqs) + { + struct babel_outgoing_ack_req *ack = SKIP_BACK(struct babel_outgoing_ack_req, neigh_ack, n); + if (ack->nonce == msg->nonce) + { + babel_flush_outgoing_ack(ack); + return; + } + } +} + void babel_handle_ack_req(union babel_msg *m, struct babel_iface *ifa) { @@ -2044,13 +2223,14 @@ babel_timer(timer *t) babel_expire_routes(p); babel_expire_neighbors(p); + babel_expire_ack_seqs(p); } static inline void -babel_kick_timer(struct babel_proto *p) +babel_kick_timer(struct babel_proto *p, btime interval) { - if (p->timer->expires > (current_time() + 100 MS)) - tm_start(p->timer, 100 MS); + if (p->timer->expires > (current_time() + interval)) + tm_start(p->timer, interval); } @@ -2161,9 +2341,9 @@ babel_rt_notify(struct proto *P, struct channel *c UNUSED, struct network *net, e->valid = BABEL_ENTRY_STALE; e->metric = BABEL_INFINITY; - - babel_trigger_update(p); e->updated = current_time(); + + babel_send_retraction_acked(p, net->n.addr); } } @@ -2214,6 +2394,7 @@ babel_start(struct proto *P) OFFSETOF(struct babel_entry, n), 0, babel_init_entry); init_list(&p->interfaces); + init_list(&p->ack_seqs); p->timer = tm_new_init(P->pool, babel_timer, p, 1 S, 0); tm_start(p->timer, 1 S); p->update_seqno = 1; @@ -2269,7 +2450,7 @@ babel_reconfigure(struct proto *P, struct proto_config *CF) babel_reconfigure_ifaces(p, new); babel_trigger_update(p); - babel_kick_timer(p); + babel_kick_timer(p, 100 MS); return 1; } diff --git a/proto/babel/babel.h b/proto/babel/babel.h index 1128d261..684bad1b 100644 --- a/proto/babel/babel.h +++ b/proto/babel/babel.h @@ -56,6 +56,8 @@ #define BABEL_TIME_UNITS 10000 /* On-wire times are counted in centiseconds */ #define BABEL_MIN_INTERVAL (0x0001 * BABEL_TIME_UNITS) #define BABEL_MAX_INTERVAL (0xFFFF * BABEL_TIME_UNITS) +#define BABEL_ACK_RETRY_INTERVAL (1 S_) +#define BABEL_ACK_RETRIES 2 #define BABEL_OVERHEAD (IP6_HEADER_LENGTH+UDP_HEADER_LENGTH) #define BABEL_MIN_MTU (512 + BABEL_OVERHEAD) @@ -142,6 +144,7 @@ struct babel_proto { struct channel *ip6_channel; list interfaces; /* Interfaces we really know about (struct babel_iface) */ + list ack_seqs; /* Outstanding ACK sequences */ u64 router_id; u16 update_seqno; /* To be increased on request */ u8 update_seqno_inc; /* Request for update_seqno increase */ @@ -205,6 +208,7 @@ struct babel_neighbor { btime ihu_expiry; list routes; /* Routes this neighbour has sent us (struct babel_route) */ + list ack_reqs; /* Outstanding ack requests sent to this neighbor */ }; struct babel_source { @@ -263,6 +267,25 @@ struct babel_entry { #define BABEL_ENTRY_VALID 1 /* Valid outgoing route */ #define BABEL_ENTRY_STALE 2 /* Stale outgoing route, waiting for GC */ +struct babel_ack_sequence { + node n; + list acks; /* list of pending acks in sequence (babel_outgoing_ack_req) */ + btime expires; + u8 retries; + list payload; /* list of babel_msg_nodes in outgoing messages */ + + void (*callback)(struct babel_ack_sequence *); /* called when there are no more pending ACKs */ + struct babel_proto *p; +}; + +struct babel_outgoing_ack_req { + node n; /* in struct babel_ack_sequence->acks */ + node neigh_ack; /* in struct babel_neighbor->ack_reqs */ + u16 nonce; + struct babel_neighbor *nbr; + struct babel_ack_sequence *seq; +}; + /* * Internal TLV messages @@ -278,6 +301,7 @@ struct babel_msg_ack_req { struct babel_msg_ack { u8 type; u16 nonce; + ip_addr sender; }; struct babel_msg_hello { @@ -358,6 +382,7 @@ void babel_show_routes(struct proto *P); /* packets.c */ void babel_enqueue(union babel_msg *msg, struct babel_iface *ifa); void babel_send_unicast(union babel_msg *msg, struct babel_iface *ifa, ip_addr dest); +void babel_send_unicast_list(list *lst, struct babel_iface *ifa, ip_addr dest); int babel_open_socket(struct babel_iface *ifa); void babel_send_queue(void *arg); diff --git a/proto/babel/packets.c b/proto/babel/packets.c index dd86222a..5b4c4555 100644 --- a/proto/babel/packets.c +++ b/proto/babel/packets.c @@ -229,6 +229,7 @@ put_ip6_ll(void *p, ip6_addr addr) * TLV read/write functions */ +static int babel_read_ack(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_ack_req(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_hello(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static int babel_read_ihu(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); @@ -239,6 +240,7 @@ static int babel_read_route_request(struct babel_tlv *hdr, union babel_msg *msg, static int babel_read_seqno_request(struct babel_tlv *hdr, union babel_msg *msg, struct babel_parse_state *state); static uint babel_write_ack(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); +static uint babel_write_ack_req(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_hello(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_ihu(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); static uint babel_write_update(struct babel_tlv *hdr, union babel_msg *msg, struct babel_write_state *state, uint max_len); @@ -256,14 +258,14 @@ static const struct babel_tlv_data tlv_data[BABEL_TLV_MAX] = { [BABEL_TLV_ACK_REQ] = { sizeof(struct babel_tlv_ack_req), babel_read_ack_req, - NULL, + babel_write_ack_req, babel_handle_ack_req }, [BABEL_TLV_ACK] = { sizeof(struct babel_tlv_ack), - NULL, + babel_read_ack, babel_write_ack, - NULL + babel_handle_ack }, [BABEL_TLV_HELLO] = { sizeof(struct babel_tlv_hello), @@ -327,6 +329,36 @@ babel_read_ack_req(struct babel_tlv *hdr, union babel_msg *m, return PARSE_SUCCESS; } +static uint +babel_write_ack_req(struct babel_tlv *hdr, union babel_msg *m, + struct babel_write_state *state UNUSED, uint max_len UNUSED) +{ + struct babel_tlv_ack_req *tlv = (void *) hdr; + struct babel_msg_ack_req *msg = &m->ack_req; + + TLV_HDR0(tlv, BABEL_TLV_ACK_REQ); + put_u16(&tlv->nonce, msg->nonce); + put_time16(&tlv->interval, msg->interval); + + return sizeof(struct babel_tlv_ack_req); +} + + +static int +babel_read_ack(struct babel_tlv *hdr, union babel_msg *m, + struct babel_parse_state *state) +{ + struct babel_tlv_ack *tlv = (void *) hdr; + struct babel_msg_ack *msg = &m->ack; + + msg->type = BABEL_TLV_ACK; + msg->nonce = get_u16(&tlv->nonce); + msg->sender = state->saddr; + + return PARSE_SUCCESS; +} + + static uint babel_write_ack(struct babel_tlv *hdr, union babel_msg *m, struct babel_write_state *state UNUSED, uint max_len UNUSED) @@ -1141,6 +1173,39 @@ babel_send_unicast(union babel_msg *msg, struct babel_iface *ifa, ip_addr dest) babel_kick_queue(ifa); } +/** + * babel_send_unicast_list - send a multi-TLV packet via unicast to a destination + * @lst: list of TLVs to send + * @ifa: Interface to send via + * @dest: Destination of the TLV + * + * This function is used to send a list of TLVs via unicast to a designated + * receiver. This is used for sending messages that comprise multiple TLVs, such + * as those that include an acknowledgement request. + */ +void +babel_send_unicast_list(list *lst, struct babel_iface *ifa, ip_addr dest) +{ + struct babel_proto *p = ifa->proto; + struct babel_msg_node *msgn, *msgn_copy; + list queue; + + init_list(&queue); + WALK_LIST(msgn, *lst) + { + msgn_copy = sl_alloc(p->msg_slab); + memcpy(msgn_copy, msgn, sizeof(*msgn_copy)); + + add_tail(&queue, NODE msgn_copy); + } + babel_write_queue(ifa, &queue); + babel_send_to(ifa, dest); + + /* We could overwrite waiting packet here, we may have to kick TX queue */ + if (!EMPTY_LIST(ifa->msg_queue)) + babel_kick_queue(ifa); +} + /** * babel_enqueue - enqueue a TLV for transmission on an interface * @msg: TLV to enqueue (in internal TLV format) -- 2.16.1

2 6

Making a wish ... errr ... *four* wishes! 😳
by Clemens Schrimpe 23 Mar '18

23 Mar '18

Gentlepeople (especially those from the BIRD development team) - being an avid BIRD user for some time now I always kept a small list of „it would be nice, if …“-things for BIRD 1.x, which I kept for myself, as I knew BIRD 2.x was in the works (and thus people were busy already…), but now I get the feeling, that 2.x is slowly stabilizing and I’d like to put them on the table for open discussion: Simple things, a.k.a. low hanging fruits: (Optional) unicast replies to IPv6 RS As one of my many uses for BIRD is in large wireless environments (i.e., IETF meetings) I am very interested in keeping the amount of multicast traffic as low as possible. The standards allow for a router to (immediately) respond with a unicast RA to an RS as an alternative to sending out a multicast RA „some (short, random) time“ after receiving an RS. Many others (Juniper, et.al.) have implemented this and I’d like to see this in BIRD too. The code changes are apparently very simple, so I almost did it myself, but then I didn’t want to interfere with ongoing 2.x developments. (lame excuse, I know …) Context dependent (global) „variables“ for functions/filters I (and probably others too) would really enjoy having more global variables defined for use inside filters & functions, depending on the context within which the respective filter/function is being called. The most obvious ones would be the peer’s (and our own) AS number (in the context of BGP protocols), the filtering direction, the protocol (type and name), the next hop’s address (where applicable), and so on. Yes, I know, most of these could be explicitly given (at least to a function) when calling it as the import/export filter for a protocol with a „where“ clause, but that would defeat the purpose of using templates (which I really do like and use a lot). The general concept of having „globals“ inside functions/filters is already there - just presently only in the context of the route that is being evaluated. I’d like to see this expanded into other contexts as described above. Discuss! 😉😜 More „controversial“ things: Maintain interface addresses (Linux et.al.) It would be nice, if BIRD could be „enhanced“ [sic] to take care of addresses assigned to interfaces, i.e. establish them in the first place and afterwards maintain them, i.e., re-install static, global IPv6 addresses on interfaces, which have suffered a link-state bounce. The latter is particularly interesting, since Linux -by design- removes global IPv6 addresses from an interface during a link-down state transition. Rationale: The various Linux distributions have all sorts of (different and sometimes „funky“) implementations of how to establish addresses to interfaces in the first place and then „deal with them“ during link-state state changes. I would like to have BIRD take care of this relatively simple task as well as the way more complicated task of maintaining millions of routes. If only to have a clean way to define „a router“ within one system (BIRD) as opposed to „get the addresses onto the interfaces with a bunch of iproute2 commands and then start BIRD to take care of the rest“-approach I’ll have to use now. A simple „boot the machine and fire up BIRD - done“ one-stop-shopping solution, if you may. 😉 This is particularly interesting to smaller, dedicated routers, like (former) OpenWRT platforms, Raspberry Pis - or (my application) Ubiquiti routers of all shapes and sizes, where I presently replace the built-in Quagga Version with BIRD. Speaking of Quagga: It takes care of interface addresses too, you know … ;-) An „ipset“ protocol for Linux It would be tremendously helpful to have a protocol, which would maintain given (named) „ipset <http://ipset.netfilter.org/>“ tables on Linux. This would allow for very easy interactions with iptables-based ACLs on Linux platforms. It should/could be treated like a Linux route-table, just with less/different attributes. So it should „sync“, could possibly „import“ items from the ipset, could be made „persistent“, etc. Applications are numerous: From fully automatic BCP38 handling at border interfaces to (again, fully automated) suppression of bogon traffic, to statistical analysis, to … whatever. It would be a single, well defined tool to interact with the whole world of capabilities the iptables/ipsets world offers. If there is any interest in discussing the latter two any further I’d be very happy to spec them out in more detail, of course. Looking forward to hear what people think about these … 😳 Clemens

3 5

How do I configure BIRD to support multiple Linux kernel routing tables?
by Grant Taylor 08 Mar '18

08 Mar '18

Pre Script: I'm a BIRD n00b How do I configure BIRD to support multiple Linux kernel routing tables? I have found and tried a few different things on the web, but none seem to be doing what I want. I want to export routes from my "main" routing table (254) and an additional routing table "default" (253). Aside: I have multiple ip rules to cascade across multiple routing tables (local, main, reject, bogons, …, and finally default) looking for a match. I do this so that I can have Linux's routing stack handle various filtering for me. BIRD is successfully exporting routes from the main (254) routing table. I'd like to also export route(s) from the default (253) routing table. # cat /etc/bird.conf protocol kernel main { learn; export all; import all; persist no; } protocol device { } protocol direct { interface "*"; } protocol rip { export all; import all; interface "eth0", "eth1", "eth2", "eth3" { version 2; }; } I have tried adding additional kernel protocols, including various incarnations of (kernel) table # entries and have had: syntax errors, references to required additional lines, and other unhappy things. So, will someone point me at a document that talks about how to work with multiple Linux routing tables? Thank you in advance. -- Grant. . . . unix || die

3 6

BGP Monitoring Protocol (BMP) support in Bird?
by Ori Finkelman 07 Mar '18

07 Mar '18

Hi, I have found this one in the archive from last July. Is BMP still planned for any time soon ? On Thu, Jul 06, 2017 at 04:26:13PM +0300, Mikhail Grishin wrote: >* Hi Ondrej, *> >* Is there any news/updates about BMP support in Bird? * Hi, it is planned for this year. -- *Ori Finkelman*Qwilt | Work: +972-72-2221647 | Mobile: +972-52-3832189 | orif(a)qwilt.com

2 2

Export to kernel table - no gateway
by Tom Funken 07 Mar '18

07 Mar '18

Hey, is there a way to define the gateway when export to the kernel table? I've seen some others using "filter { gw = 10.0.0.0; accept; }" on the import. But, when I do it, it will filter all import routes and non of them will be accepted. Regards, Tom

2 3

Support for dual AS and AS migration
by Adam Król 07 Mar '18

07 Mar '18

Does BIRD have any support for AS migration mechanism as mentioned in RFC7705 https://tools.ietf.org/html/rfc7705? Something like https://www.cisco.com/c/en/us/td/docs/ios-xml/ios/iproute_bgp/configuration… I know it can be achieved by functions, but maybe there is already simplier way to get this done. Best regards, Adam Król

6 8

My FreeBSD port for 2.0.1
by Leo Vandewoestijne 28 Feb '18

28 Feb '18

Hi, For the impatient ones who wish to run Bird 2.0.1 on FreeBSD; in advance of the port commit you could: cd /usr/ports # or custom path fetch https://dns.company/stuff/bird/bird-2.0.1.shar # or: fetch -o bird-2.0.1.shar --no-verify-peer https://bz-attachments.freebsd.org/attachment.cgi\?id=191018 sh bird-2.0.1.shar make -I net/bird2 install clean In case you wish to return any feedback: https://bugs.freebsd.org/bugzilla/show_bug.cgi?id=225962 -- Met vriendelijke groet, With kind regards, Leo Vandewoestijne <%2A%2A%2A(a)dns.company> <www.dns.company>

1 0