Huawei Reports a 40% Revenue Surge in 1H’16
The privately held company doesn't break out specifics.
MIT Research Pushes Latency Limits with Distributed Flash
We are hitting the limits of what can be crammed into DRAM in a number of application areas. As data volumes continue to mount, this limitation will be more keenly felt.
Accordingly, there has been a great deal of work recently to look to flash to create more efficient and capable system that can accelerate deeply data-intensive problems, but few things have gotten enough traction to filter their way into big news items. With that said, there are some potential breakthroughs on this front coming out of MIT where some rather impressive performance improvements have been snagged by taking a …
MIT Research Pushes Latency Limits with Distributed Flash was written by Nicole Hemsoth at The Next Platform.
Hans Vestberg’s Rise and Fall: How Ericsson’s CEO Lost His Shine
Vestberg was considered a visionary in the telecom world.
Network Break 97: Softbank Grabs ARM; ONOS Pitches Open-Source Fabric
On todays Network Break episode we examine Softbanks purchase of ARM Holdings, examine a new open-source data center fabric, discuss a Gartner cloud prediction & more The post Network Break 97: Softbank Grabs ARM; ONOS Pitches Open-Source Fabric appeared first on Packet Pushers.On the ‘net: The Foggy Future of Network Engineering
The post On the ‘net: The Foggy Future of Network Engineering appeared first on 'net work.
Gartner Sees $1 Trillion Shift In IT Spending To Cloud
The shift in IT spending from traditional hardware and software to cloud computing will continue over the next five years.
The Mad Max DGA
This post describes a domain generation algorithm (DGA) used by the “Mad Max” malware family. Mad Max is a targeted trojan, and we plan to post a follow-up article that documents our findings regarding the features of the Mad Max malware itself. But for now we will focus on the reversing of its DGA, since […]SoftLayer’s Founder Aims to Build a Security-as-a-Service Powerhouse
Another startup, but this one claims 30,000 customers.
snaproute Go BGP Code Dive (5): Starting a Peer
Last time we looked at the snaproute BGP code, we discovered the peer bringup process is a finite state machine. With this in mind, let’s try to unravel the state machine into a set of calls, beginning from our original starting point, a debug message that prints on the screen when a new peering relationship is established. The key word in the debug message was ConnEstablished, which led to:
func (fsm *FSM) ConnEstablished() {
fsm.logger.Info(fmt.Sprintln("Neighbor:", fsm.pConf.NeighborAddress, "FSM", fsm.id, "ConnEstablished - start"))
fsm.Manager.fsmEstablished(fsm.id, fsm.peerConn.conn)
fsm.logger.Info(fmt.Sprintln("Neighbor:", fsm.pConf.NeighborAddress, "FSM", fsm.id, "ConnEstablished - end"))
}
From here, we searched for calls to ConnEstablished, and found—
func (fsm *FSM) ChangeState(newState BaseStateIface) {
...
if oldState == BGPFSMEstablished && fsm.State.state() != BGPFSMEstablished {
fsm.ConnBroken()
} else if oldState != BGPFSMEstablished && fsm.State.state() == BGPFSMEstablished {
fsm.ConnEstablished()
}
}
Looking for ChangeState leads us to a lot of different calls, but only one that seems to relate to establishing a new peer, as evidenced by a state that relates to established in some way. This, in turn, leads to—
func (st *OpenConfirmState) processEvent(event BGPFSMEvent, data Continue reading