Sciweavers

173 search results - page 28 / 35
» A packet-level characterization of network traffic
Sort
View
INFOCOM
1998
IEEE
13 years 11 months ago
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...
Philip A. Whiting, Sem C. Borst
COMCOM
2004
118views more  COMCOM 2004»
13 years 7 months ago
The next frontier for communications networks: power management
Storage, memory, processor, and communications bandwidth are all relatively plentiful and inexpensive. However, a growing expense in the operation of computer networks is electric...
Kenneth J. Christensen, Chamara Gunaratne, Bruce N...
RTSS
2006
IEEE
14 years 1 months ago
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
Anis Koubaa, Mário Alves, Eduardo Tovar
CN
2006
107views more  CN 2006»
13 years 7 months ago
BGP session lifetime modeling in congested networks
The reliable Border Gateway Protocol (BGP) is essential for supporting high quality Internet data communication. In present Internet, due to the lack of differentiation mechanism ...
Li Xiao, Guanghui He, Klara Nahrstedt
SP
2008
IEEE
13 years 7 months ago
Predictable Design of Network-Based Covert Communication Systems
This paper presents a predictable and quantifiable approach to designing a covert communication system capable of effectively exploiting covert channels found in the various layer...
Ronald William Smith, George Scott Knight