Sciweavers

2796 search results - page 418 / 560
» The coolest path problem
Sort
View
CCR
2002
86views more  CCR 2002»
15 years 6 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
ASWEC
2006
IEEE
15 years 10 months ago
Requirements Capture and Specification for Enterprise Applications: a UML Based Attempt
We propose a software development method for enterprise applications that combines the use of the structural concepts provided by problem frames, and the use of the UML notation. ...
Christine Choppy, Gianna Reggio
CN
2010
103views more  CN 2010»
15 years 6 months ago
Continuum equilibria and global optimization for routing in dense static ad hoc networks
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...
Alonso Silva, Eitan Altman, Pierre Bernhard, M&eac...
CN
2007
141views more  CN 2007»
15 years 6 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
AINA
2004
IEEE
15 years 10 months ago
Authenticated Autonomous System Traceback
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet making the defense against Distributed Denial of Service attacks one of the ha...
Vamsi Paruchuri, Arjan Durresi, Rajgopal Kannan, S...