Sciweavers

3319 search results - page 375 / 664
» The topology of dark networks
Sort
View
CONEXT
2005
ACM
15 years 8 months ago
TIE breaking: tunable interdomain egress selection
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...
NETWORKING
2010
15 years 8 months ago
Efficient Recovery from False State in Distributed Routing Algorithms
Abstract--Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. ...
Daniel Gyllstrom, Sudarshan Vasudevan, Jim Kurose,...
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
15 years 5 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
ASC
2011
15 years 1 months ago
Quality of Service constrained routing optimization using Evolutionary Computation
In this work, a novel optimization framework is proposed that allows the improvement of Quality of Service levels in TCP/IP based networks, by configuring the routing weights of ...
Miguel Rocha, Pedro Sousa, Paulo Cortez, Miguel Ri...
TOCS
2011
111views more  TOCS 2011»
15 years 1 months ago
SEATTLE: A Scalable Ethernet Architecture for Large Enterprises
IP networks today require massive effort to configure and manage. Ethernet is vastly simpler to manage, but does not scale beyond small local area networks. This paper describes ...
Changhoon Kim, Matthew Caesar, Jennifer Rexford