About Us
Since our inception, ShortestPathFirst continues to transform the way our clients do business. As a Federally Recognized Veteran-Owned Business, we deliver high-performance IT solutions and services based on our unique advantage of holding elite-level partnerships with today’s most innovative technology manufacturers. We combine these impressive product portfolios with our extraordinary engineering, design and professional services expertise to craft a complete, end-to-end technology solution unique to our clients’ needs. Some of the innovative solutions and services we offer enable Cyber Security, Data Center & Cloud Architectures, Enterprise Networks, and Mobility.
We believe that delivering exceptional products and services through cost effective platforms gives our clients more time to focus on what matters to them most- driving the innovation and performance they need to reduce cost and maximize their ROI.
VALUES
Disruptive innovation is one of the core values we hold as a company. We’ve introduced many effective innovations from our best-of-breed technology partners that have transformed the way our customers do business.
High integrity is another one of our core values. We respect our customers, technology partners, and employees, and show that respect with transparency and the way we handle trust. We inspire trust and live up to that trust. We work collaboratively and strive to promote our customers’ successful execution of their business goals.
Our diverse and inclusive workforce strengthens our business. We’ve always contributed to our community, and as we grow larger, we contribute more and have a wider community to contribute to. This premise of giving back, and doing good in the world, is a key tenet of our business model.
Site Origins
The name for this site comes from Dijkstra’s algorithm, otherwise known as the “Shortest Path First” algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959. The Dijkstra algorithm is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing protocols such as OSPF and IS-IS, and modified forms of it are used in other applications, such as MPLS Traffic Engineering.