It has been proposed that the LAPD data-link protocol be used for packetized data transfer on the bearer channels of ISDNs.
Named Data Networking (NDN) has emerged as a promising candidate for shifting Internet communication model from host-centric to content-centric.
To better evaluate handover decision algorithms, an analytical model which considers dynamic network conditions and mobile user¡¯s requirements is proposed.
An emerging communication service with significant potential is delivery of personalized content. Such a service typically is provided through either live or time-shifted program multicast.
This paper presents an analytical model for the constrained stochastic gradient (CSG) algorithm.
We derive an analytical expression for the mean load at each node of an arbitrary undirected graph for the non-uniform multicommodity flow problem under weighted random routing.
Using reciprocity we find that a compact range can in principle measure the same return from a target as would be measured by an antenna irrespective of whether either the antenna or the target lie
The frequency analyzers described in this paper and in the paper immediately following, demonstrate in an unusual manner how a single fundamental principle may be employed to accomplish quite dissi
This work presents a simple mobility scheme for IP-based networks, termed the ``anchor chain{''} scheme. The scheme combines pointer forwarding and caching methods.
A review of the field of lightness perception from Helmholtz to the present shows the most adequate theories of lightness perception to be the intrinsic image models.
