SMCRoute is a daemon and command line tool to manipulate the multicast routes of the Linux kernel. It can be used as an alternative to dynamic multicast routers like 'mrouted' in situations where (only) static multicast routes should be maintained and/or no proper IGMP signaling exists.
VyOS is a Linux distribution for routers and firewalls which features a unified commandline interface and a single configuration file, with an API for extending it. It includes BGP, OSPF, and RIP routing protocols, policy-based routing, a DHCP and caching DNS server, a Web proxy, and more. It runs on x86 physical machines and a variety of hypervisors, including KVM, Xen, VMWare, and Hyper-V. VyOS is forked from Vyatta and based on VC6.6 source code.
qpimd aims to implement a PIM (Protocol Independent Multicast) daemon for the Quagga Routing Suite. Initially, it targets only PIM SSM (Source-Specific Multicast) mode as defined in section 4.8.2 (PIM-SSM-Only Routers) of RFC 4601. In order to deliver end-to-end multicast routing control plane, qpimd includes the router-side of IGMPv3 (RFC 3376).
The Dynamic Router Lite II project is a router project by the Dutch national police agency that allows Web-based client-control over the next-hop router for the client. A Dynamic Router Lite II system is placed as a default gateway between one or more client networks and a router network with multiple gateway-routers on it. The Dynamic Router Lite II system does policy-based routing with policy-based DNS to match the routing policy. By default a client will have no active gateway, and any attempted HTTP traffic to any domain will lead the user to the router's Web interface, where the user can then pick an appropriate next-hop router. Once picked, all traffic for the client including DNS will be forwarded to the next-hop router the user picked.
PHP Clarke and Wright Algorithm is a class that can solve a truck routing problem with the Clarke and Wright algorithm. It attempts to solve the problem of determining the routes by which a given number of trucks with different weight and volume capacity will be dispatching deliveries to a certain number of clients distributed geographically within certain time windows. The class takes as parameters the nodes of positions of each client, the demands of each client, a matrix of distance between nodes, and the capacity of each truck. It computes the route for each truck, as well the time and distance to drive to each customer and the volume and weight to transport.