Sciweavers

329 search results - page 9 / 66
» Source Routing and Scheduling in Packet Networks
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
ISCC
2003
IEEE
122views Communications» more  ISCC 2003»
14 years 20 days ago
TCP-aware Source Routing in Mobile Ad Hoc Networks
— Temporary link failures and route changes occur frequently in mobile ad hoc networks. Since TCP assumes that all packet losses are due to network congestion, TCP does not show ...
Jin-Hee Choi, Chuck Yoo
FCCM
2006
IEEE
131views VLSI» more  FCCM 2006»
14 years 1 months ago
Packet Switched vs. Time Multiplexed FPGA Overlay Networks
— Dedicated, spatially configured FPGA interconnect is efficient for applications that require high throughput connections between processing elements (PEs) but with a limited ...
Nachiket Kapre, Nikil Mehta, Michael DeLorimier, R...
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests
Reactive routing protocols like Ad-hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing in Ad-Hoc Wireless Networks (DSR) which are used in Mobile and Ad-hoc Ne...
Jayesh Kataria, P. S. Dhekne, Sugata Sanyal
RTSS
2007
IEEE
14 years 1 months ago
Distributed Minimal Time Convergecast Scheduling for Small or Sparse Data Sources
— Many applications of sensor networks require the base station to collect all the data generated by sensor nodes. As a consequence many-to-one communication pattern, referred to...
Ying Zhang, Shashidhar Gandham, Qingfeng Huang