Sciweavers

2421 search results - page 172 / 485
» Approximate Flow-Aware Networking
Sort
View
157
Voted
ATMOS
2010
183views Optimization» more  ATMOS 2010»
15 years 2 months ago
The Complexity of Integrating Routing Decisions in Public Transportation Models
To model and solve optimization problems arising in public transportation, data about the passengers is necessary and has to be included in the models in any phase of the planning...
Marie Schmidt, Anita Schöbel
SIGMETRICS
2011
ACM
191views Hardware» more  SIGMETRICS 2011»
14 years 6 months ago
Stability analysis of QCN: the averaging principle
Data Center Networks have recently caused much excitement in the industry and in the research community. They represent the convergence of networking, storage, computing and virtu...
Mohammad Alizadeh, Abdul Kabbani, Berk Atikoglu, B...
141
Voted
SENSYS
2003
ACM
15 years 8 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
144
Voted
COMCOM
2006
168views more  COMCOM 2006»
15 years 3 months ago
Relay node placement in large scale wireless sensor networks
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
Jian Tang, Bin Hao, Arunabha Sen
163
Voted
SPAA
1999
ACM
15 years 7 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...