2020-01-29 21:23:07 +00:00
|
|
|
#!/usr/bin/env racket
|
|
|
|
#lang racket
|
2020-02-02 03:21:25 +00:00
|
|
|
; vim:ft=racket
|
2020-01-29 21:23:07 +00:00
|
|
|
|
2020-02-02 04:55:14 +00:00
|
|
|
; __ __ __
|
|
|
|
; __/ // /_/ /___ _____ ____ _ __ ___ ____ __
|
|
|
|
; /_ _ __/ / __ `/ __ \/ __ `/ / / / / | /| / / / / /
|
|
|
|
; /_ _ __/ / /_/ / / / / /_/ / / /_/ /| |/ |/ / /_/ /
|
|
|
|
; /_//_/ /_/\__,_/_/ /_/\__, / \__,_/ |__/|__/\__,_/
|
|
|
|
; /____/
|
|
|
|
|
2020-02-02 05:53:36 +00:00
|
|
|
(require "private/iputil.rkt"
|
2020-02-02 04:22:35 +00:00
|
|
|
"private/unix-socket.rkt"
|
|
|
|
"private/msg.rkt"
|
|
|
|
"private/radix-tree.rkt")
|
2020-01-30 23:33:13 +00:00
|
|
|
|
|
|
|
;; info : Peer
|
|
|
|
;; sock-in : Input-Port
|
|
|
|
;; sock-out : Output-Port
|
|
|
|
(struct peer-conn
|
|
|
|
[info sock-in sock-out]
|
|
|
|
#:transparent)
|
|
|
|
|
2020-02-01 03:35:34 +00:00
|
|
|
;; a Router is a [RTof [Listof [Cons Peer Route]]]
|
2020-02-01 02:31:56 +00:00
|
|
|
|
|
|
|
;; -> Router
|
|
|
|
(define (make-router)
|
2020-02-01 03:35:34 +00:00
|
|
|
(make-rt))
|
|
|
|
|
|
|
|
;; Router Route Peer -> Void
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Adds route r from peer to the routing database
|
2020-02-01 03:35:34 +00:00
|
|
|
(define (router-add! rt r peer)
|
|
|
|
(rt-update! rt
|
|
|
|
(subnet->bl (route-subnet r))
|
|
|
|
(lambda (rst) (cons (cons peer r) rst))
|
|
|
|
(lambda () '())))
|
|
|
|
|
2020-02-02 03:21:25 +00:00
|
|
|
;; IP -> IP
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Calculates our local IP on the subnet with peer p
|
2020-02-02 03:21:25 +00:00
|
|
|
(define (peer-ip->own-ip p)
|
|
|
|
(sub1 p))
|
|
|
|
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Route Route -> Bool
|
|
|
|
;; Checks if route r1 is "less than"/higher priority than r2 according to the specified rules
|
2020-02-01 03:35:34 +00:00
|
|
|
(define (route< r1 r2)
|
|
|
|
#|
|
|
|
|
(route< r1 r2) iff "r1 wins"
|
|
|
|
|
|
|
|
1. The path with the highest "localpref" wins. If the "localpref"s are equal...
|
|
|
|
2. The path with "selfOrigin" = true wins. If all selfOrigins are the equal...
|
|
|
|
3. The path with the shortest "ASPath" wins. If multiple routes have the shortest length...
|
|
|
|
4. The path with the best "origin" wins, were IGP > EGP > UNK.
|
|
|
|
If multiple routes have the best origin...
|
|
|
|
5. The path from the neighbor router with the lowest IP address.
|
|
|
|
|#
|
2020-02-01 04:13:49 +00:00
|
|
|
(let/ec meow
|
|
|
|
(define (cmp mapper)
|
|
|
|
(let ([x2 (mapper r1)]
|
|
|
|
[y2 (mapper r2)])
|
|
|
|
(cond [(< x2 y2) (meow #t)]
|
|
|
|
[(> x2 y2) (meow #f)])))
|
|
|
|
(cmp (compose - route-pref))
|
2020-02-04 19:18:17 +00:00
|
|
|
(cmp (lambda (x) (if (route-self-origin? x) 0 1)))
|
2020-02-01 04:13:49 +00:00
|
|
|
(cmp (compose length route-as-path))
|
2020-02-04 19:21:02 +00:00
|
|
|
(cmp (lambda (x) (match (route-origin x) ['IGP 1] ['EGP 2] ['UNK 3])))
|
2020-02-01 04:13:49 +00:00
|
|
|
(cmp route-nexthop)
|
|
|
|
(error "your router is angery...")))
|
2020-02-01 03:35:34 +00:00
|
|
|
|
|
|
|
;; Router IP -> (U Peer #f)
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Finds the most specific route for the given IP
|
2020-02-01 03:35:34 +00:00
|
|
|
(define (router-find-best rt src-ip)
|
|
|
|
(match (sort (rt-lookup rt
|
|
|
|
(ip->bl src-ip)
|
|
|
|
(λ () '()))
|
|
|
|
route<
|
|
|
|
#:key cdr)
|
|
|
|
[(list* (cons peer _) _) peer]
|
|
|
|
[_ #f]))
|
2020-02-01 02:31:56 +00:00
|
|
|
|
2020-02-01 04:39:42 +00:00
|
|
|
;; Router -> Msg
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Creates a table message with a dump of the current routing table
|
2020-02-01 04:39:42 +00:00
|
|
|
(define (router-dump rt src dst)
|
2020-02-02 03:21:25 +00:00
|
|
|
(define routing-table (rt-flatten rt))
|
|
|
|
(msg:table (peer-ip->own-ip src) src
|
|
|
|
(for/fold ([entries '()]) ([routes (in-list routing-table)])
|
|
|
|
(append entries (map (lambda (route)
|
|
|
|
(list (route-subnet (cdr route))
|
|
|
|
(route-nexthop (cdr route))))
|
|
|
|
routes)))))
|
2020-02-01 04:39:42 +00:00
|
|
|
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Peer Route Int -> Msg
|
|
|
|
;; Creates an update message based on a received update message r that we can forward to other
|
|
|
|
;; routers
|
2020-02-02 03:41:23 +00:00
|
|
|
(define (router-format-update peer r asn)
|
|
|
|
;; Route -> Route
|
|
|
|
(define (update-aspath r asn)
|
|
|
|
(struct-copy route r [as-path (append (route-as-path r) (list asn))]))
|
|
|
|
(msg:update
|
|
|
|
(peer-ip->own-ip (peer-ip peer))
|
|
|
|
(peer-ip peer)
|
|
|
|
(update-aspath r asn)))
|
|
|
|
|
|
|
|
;; Int [Listof Peer-Conn] -> Void
|
2020-01-30 23:33:13 +00:00
|
|
|
;; --
|
2020-01-31 00:51:35 +00:00
|
|
|
;; Runs router logic, given a list of peer connections.
|
2020-02-02 03:41:23 +00:00
|
|
|
(define (run-router/conns asn peer-conns)
|
2020-02-02 04:55:14 +00:00
|
|
|
;; This channel collects messages from every peer connection
|
2020-01-30 23:33:13 +00:00
|
|
|
(define mail
|
|
|
|
(make-channel))
|
|
|
|
|
|
|
|
(define peer-threads
|
|
|
|
(for/list ([pc (in-list peer-conns)])
|
|
|
|
(match-define (peer-conn peer sock-in sock-out) pc)
|
|
|
|
(thread (λ ()
|
|
|
|
(define buf (make-bytes 65536))
|
|
|
|
(let loop ()
|
|
|
|
(define len (read-bytes-avail! buf sock-in))
|
2020-01-30 23:56:17 +00:00
|
|
|
(printf "got ~a bytes from ~a...\n" len peer)
|
2020-01-31 00:51:35 +00:00
|
|
|
(define msg (bytes->msg (subbytes buf 0 len)))
|
|
|
|
(channel-put mail (list peer msg))
|
2020-01-30 23:33:13 +00:00
|
|
|
(loop))))))
|
|
|
|
|
2020-02-02 04:55:14 +00:00
|
|
|
;; IP -> Peer
|
|
|
|
;; Looks up a peer based on their IP
|
2020-02-01 03:35:34 +00:00
|
|
|
(define (ip->peer ip)
|
|
|
|
(findf (λ (peer)
|
|
|
|
(equal? ip (peer-ip peer)))
|
|
|
|
(map peer-conn-info peer-conns)))
|
|
|
|
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Peer -> Peer-Conn
|
|
|
|
;; Looks up a peer connection based on a peer object
|
2020-02-01 03:35:34 +00:00
|
|
|
(define (peer->peer-conn peer)
|
|
|
|
(findf (λ (pc)
|
|
|
|
(equal? peer (peer-conn-info pc)))
|
2020-02-01 02:31:56 +00:00
|
|
|
peer-conns))
|
|
|
|
|
|
|
|
(define router
|
|
|
|
(make-router))
|
|
|
|
|
2020-02-01 03:35:34 +00:00
|
|
|
(let loop ()
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Main router loop
|
|
|
|
;; - Get next message
|
|
|
|
;; - Generate some messages to send out, maybe
|
|
|
|
;; - Send out those messages
|
|
|
|
|
2020-02-02 03:21:25 +00:00
|
|
|
(match-define (list src-peer msg) (channel-get mail))
|
|
|
|
(printf "====\nfrom ~a:\n~s\n" src-peer msg)
|
2020-02-01 02:31:56 +00:00
|
|
|
|
2020-02-01 04:38:48 +00:00
|
|
|
;; [Listof [Cons Peer-Conn Msg]]
|
|
|
|
(define to-send
|
|
|
|
(match msg
|
2020-02-01 02:31:56 +00:00
|
|
|
|
2020-02-01 04:38:48 +00:00
|
|
|
[(msg:update src dst r)
|
|
|
|
(router-add! router
|
|
|
|
r
|
|
|
|
(ip->peer src))
|
|
|
|
(rt-dump router)
|
|
|
|
(for/list ([pc (in-list peer-conns)]
|
2020-02-02 03:21:25 +00:00
|
|
|
#:when (not (eq? (peer-conn-info pc) src-peer)))
|
2020-02-02 03:41:23 +00:00
|
|
|
(cons pc (router-format-update (peer-conn-info pc) r asn)))]
|
2020-02-01 04:38:48 +00:00
|
|
|
|
|
|
|
[(msg:data src dst data)
|
2020-02-01 02:31:56 +00:00
|
|
|
(match (router-find-best router dst)
|
|
|
|
[#f
|
2020-02-02 03:21:25 +00:00
|
|
|
(list (cons (peer->peer-conn src-peer)
|
|
|
|
(msg:no-route (peer-ip->own-ip src)
|
2020-02-01 04:38:48 +00:00
|
|
|
src)))]
|
2020-02-01 03:35:34 +00:00
|
|
|
[dst-peer
|
2020-02-01 04:38:48 +00:00
|
|
|
(list (cons (peer->peer-conn dst-peer)
|
|
|
|
msg))])]
|
2020-02-02 03:21:25 +00:00
|
|
|
[(msg:dump src dst)
|
|
|
|
(list (cons (peer->peer-conn src-peer) (router-dump router src dst)))]
|
2020-02-01 04:38:48 +00:00
|
|
|
[_
|
|
|
|
(printf "----\nignored\n")
|
|
|
|
'()]))
|
|
|
|
|
|
|
|
(for ([dst+msg (in-list to-send)])
|
|
|
|
(match-define (cons dst-peer-conn resp-msg) dst+msg)
|
|
|
|
(printf "----\nwant to send to ~a:\n~a\n"
|
|
|
|
(peer-conn-info dst-peer-conn)
|
|
|
|
resp-msg)
|
|
|
|
(define dst-port
|
|
|
|
(peer-conn-sock-out dst-peer-conn))
|
|
|
|
(write-bytes (msg->bytes resp-msg) dst-port)
|
|
|
|
(flush-output dst-port))
|
|
|
|
|
2020-02-01 03:35:34 +00:00
|
|
|
(loop)))
|
2020-01-29 21:23:07 +00:00
|
|
|
|
2020-02-02 03:41:23 +00:00
|
|
|
;; Int [Listof Peer] ->
|
2020-01-29 21:23:07 +00:00
|
|
|
;; Router main
|
|
|
|
(define (run-router asn peers)
|
|
|
|
(displayln asn)
|
|
|
|
(map displayln peers)
|
2020-01-30 23:56:17 +00:00
|
|
|
(displayln "------------")
|
2020-01-31 00:51:35 +00:00
|
|
|
(with-handlers ([exn:break? (λ (e) (printf "time to die.\n"))])
|
2020-01-30 23:56:17 +00:00
|
|
|
(run-router/conns
|
|
|
|
asn
|
|
|
|
(for/list ([peer (in-list peers)])
|
|
|
|
(define-values [sock-in sock-out]
|
|
|
|
(unix-socket-connect (ip->string (peer-ip peer))
|
|
|
|
'SOCK-SEQPACKET))
|
|
|
|
(peer-conn peer
|
|
|
|
sock-in
|
|
|
|
sock-out)))))
|
2020-01-29 21:23:07 +00:00
|
|
|
|
2020-02-02 04:55:14 +00:00
|
|
|
;; Parse command line arguments and start router
|
2020-01-29 21:23:07 +00:00
|
|
|
(module+ main
|
2020-01-30 23:33:13 +00:00
|
|
|
(command-line
|
|
|
|
#:program "router"
|
|
|
|
#:args
|
|
|
|
(asn . peers)
|
2020-01-30 23:56:17 +00:00
|
|
|
(with-output-to-file "log.txt"
|
|
|
|
#:exists 'replace
|
|
|
|
(λ ()
|
|
|
|
;; Run the router
|
2020-02-02 03:41:23 +00:00
|
|
|
(run-router (string->number asn) (map string->peer peers))))))
|
2020-01-30 23:33:13 +00:00
|
|
|
|
|
|
|
(module+ test
|
|
|
|
|
|
|
|
(define-values [in1 out1] (make-pipe))
|
|
|
|
(define-values [in2 out2] (make-pipe))
|
|
|
|
(define p1 (peer-conn (string->peer "1.2.3.4-cust") in1 out1))
|
|
|
|
(define p2 (peer-conn (string->peer "1.2.3.5-peer") in2 out2))
|
|
|
|
|
2020-01-30 23:56:17 +00:00
|
|
|
; (define abort-router
|
2020-01-30 23:33:13 +00:00
|
|
|
(run-router/conns "123"
|
2020-01-30 23:56:17 +00:00
|
|
|
(list p1 p2))
|
2020-01-30 23:33:13 +00:00
|
|
|
|
|
|
|
(void
|
|
|
|
(write-string "{\"a\": 1, \"b\": [1,2,3]}" out1)))
|