84 search results - page 9 / 17 » Schemes for SR-Tree packing |
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
13 years 12 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...
SIAMDM
1998
13 years 7 months ago
1998
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
ICOIN
2004
Springer
14 years 1 months ago
2004
Springer
For more scalable mobile services, it is important to reduce the signaling cost for location management. In this paper, we propose a cost effective IP paging scheme utilizing expl...
COMCOM
2006
13 years 7 months ago
2006
In Hierarchical Mobile IPv6 (HMIPv6) networks, the mobility anchor point (MAP) is introduced to localize binding update messages destined to the home agent. In a large-scale wirel...
WINET
2010
13 years 6 months ago
2010
By introducing a mobility anchor point (MAP), Hierarchical Mobile IPv6 (HMIPv6) reduces the signaling overhead and handoff latency associated with Mobile IPv6. In this paper, we pr...