Cisco data center engineer recognized for work on scaling router performance

A Cisco data center engineer has been recognized for his work on scaling router performance. Technology

Review Magazine has recognized Sundar Iyer as an outstanding innovator under the age of 35 for the work that he first began exploring while a doctoral candidate at Stanford University. His work aims to solve the problem of a router’s memory being unable to support the speeds required of leading edge applications, such as hi-def images, great sound quality, and so on, reports Cisco’s Doug Gourlay in his blog.

“Sundar’s work has allowed fast routers to overcome this memory performance problem using commodity memory. As a consequence the router can provide a high-level of guarantee on the performance of end-user applications,” Gourlay explains.

Iyer’s so-called network memory algorithms combine load balancing and caching algorithms on commodity memory. Load balancing distributes the load over slower memories, and guarantee that memory is available when data needs to be accessed; caching guarantees that data is available in cache memory 100% of the time, reports Network World’s Jim Duffy in his story. Applications for network memory include buffering, NetFlow accounting and quality-of-service (QoS).

Network memory techniques are currently being designed in Cisco’s next generation port speeds of 10G and 40Gbps, Ethernet switches and enterprise routers, Iyer says. They are also being designed into the company’s next generation 100Gbps router line cards, he says.

More from Cisco Subnet: * Five steps to deleting VoIP expletivesWhy Jimmy Ray gives Solar Winds’ toolbox the thumbs upLondon Stock Exchange down for the day: Even the people running the LSE cannot get it rightGoogle’s Chrome raises security concerns and tastes like chicken feetScripting and Customization in JUNOS* In depth series: Cisco Unified Communications Manager call routing Cisco Subnet for more Cisco news, blogs, discussion forums, security alerts, book giveaways, and more. 

*

* 

* 

*

Go to