53 search results - page 9 / 11 » infocom 1998 |
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
13 years 9 months ago
-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...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by ...
INFOCOM
1998
IEEE
13 years 9 months ago
1998
IEEE
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
INFOCOM
1998
IEEE
13 years 9 months ago
1998
IEEE
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
INFOCOM
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper suggests that, to match an ideal Internet gateway which rigorously enforces fair sharing among competing TCP connections, an ideal TCP sender should possess two propert...