'All in' on NFV means going down to the fiber.
'Don't take this for granted:' Open source takes center stage to kick off ONS 2015.
If software developers and network driver writers can make their own packets, can’t you? Ah, right...you’re not a developer. Your coding-fu is weak, as is mine. Still, there’s hope for us in an open source tool called Ostinato. Ostinato calls itself “Wireshark in reverse.” With Ostinato, you can make your own packets, custom crafting them any way you like. Today on the Packet Pushers Priority Queue, we’re talking with one of the Ostinato creators, Srivats P.
The post PQ Show 52 – Using Ostinato To Craft Your Own Packets appeared first on Packet Pushers.
I am glad to announce that Russ White and I have been preparing a CCDE Practical Exam ( Lab Exam ) Scenario. This is the most realistic scenario available anywhere.Because it is not just prepared by a CCDE but one of the founder of the exam involved. Disclosure : This is not asked in the CCDE… Read More »
The post Russ White – Orhan Ergun CCDE Practical Exam Scenario appeared first on Network Design and Architecture.
Learn how to achieve business continuity not matter what the situation is in the Sonus DemoFriday! Sign up now!
If software developers and network driver writers can make their own packets, can’t you? Ah, right...you’re not a developer. Your coding-fu is weak, as is mine. Still, there’s hope for us in an open source tool called Ostinato. Ostinato calls itself “Wireshark in reverse.” With Ostinato, you can make your own packets, custom crafting them any way you like. Today on the Packet Pushers Priority Queue, we’re talking with one of the Ostinato creators, Srivats P.
The post PQ Show 52 – Using Ostinato To Craft Your Own Packets appeared first on Packet Pushers Podcast and was written by Ethan Banks.
Of course, routing on a per application (or a per packet) basis provides more optimization, but it also adds more state in the control plane, and it increases the speed at which that state changes. In my forthcoming book on network complexity, I’m going to work around a model of state/speed/surface, with a side of optimization, to gain an understanding of network complexity and how to manage it.
The post Worth Reading: SD-WAN and Per Application Routing appeared first on 'net work.
Last week during a casual conversation I overheard a colleague saying: "The Linux network stack is slow! You can't expect it to do more than 50 thousand packets per second per core!"
That got me thinking. While I agree that 50kpps per core is probably the limit for any practical application, what is the Linux networking stack capable of? Let's rephrase that to make it more fun:
On Linux, how hard is it to write a program that receives 1 million UDP packets per second?
Hopefully, answering this question will be a good lesson about the design of a modern networking stack.
CC BY-SA 2.0 image by Bob McCaffrey
First, let us assume:
Measuring packets per second (pps) is much more interesting than measuring bytes per second (Bps). You can achieve high Bps by better pipelining and sending longer packets. Improving pps is much harder.
Since we're interested in pps, our experiments will use short UDP messages. To be precise: 32 bytes of UDP payload. That means 74 bytes on the Ethernet layer.
For the experiments we will use two physical servers: "receiver" and "sender".
They both have two six core 2GHz Xeon processors. With hyperthreading (HT) enabled Continue reading