Results 1 to 10 of about 287,204 (299)
PACKET TRANSPORT ON SCALE-FREE NETWORKS [PDF]
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major kinetic properties of the transport as a function of the network geometry, the packet input rate and the buffer size.
Tadic, B, Rodgers, GJ
openaire +7 more sources
Power consumption in packet radio networks
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Danny Krizanc+3 more
openaire +3 more sources
Packet delay in models of data networks [PDF]
We investigate individual packet delay in a model of data networks with table-free, partial table and full table routing. We present analytical estimation for the average packet delay in a network with small partial routing table. Dependence of the delay on the size of the network and on the size of the partial routing table is examined numerically ...
Volkov, S, Lawniczak, A, Fuks, H
openaire +6 more sources
Deadlock in Packet Switching Networks [PDF]
A deadlock in a packet switching network is a state in which one or more messages have not yet reached their target, yet cannot progress any further. We formalize three different notions of deadlock in the context of packet switching networks, to which we refer as global, local and weak deadlock. We establish the precise relations between these notions,
Anna Stramaglia+2 more
openaire +4 more sources
Benes networks are constructed with simple switch modules and have many advantages, including small latency and requiring only an almost linear number of switch modules. As circuit-switches, Benes networks are rearrangeably non-blocking, which implies that they are full-throughput as packet switches, with suitable routing. Routing in Benes networks can
Longbo Huang, Jean Walrand
openaire +2 more sources
Packetization and Packet Curves in Network Calculus [PDF]
Arrival and service curves are core functions in the Network Calculus framework. Based on those curves, we present in this talk a new formalism for data packetization in Network Calculus, the packet curves. Indeed, a more precise knowledge of the packet characteristics can be efficiently exploited to get tighter performance bounds, for example for ...
Bouillard, Anne+2 more
openaire +3 more sources
Subset Codes for Packet Networks [PDF]
In this paper, we present a coding-theoretic framework for message transmission over packet-switched networks. Network is modeled as a channel which can induce packet errors, deletions, insertions, and out of order delivery of packets. The proposed approach can be viewed as an extension of the one introduced by Koetter and Kschischang for networks ...
Mladen Kovacevic, Dejan Vukobratovic
openaire +3 more sources
Packet reordering, high speed networks and transport protocol performance [PDF]
We performed end-to-end measurements of UDP/IP flows across an Internet backbone network. Using this data, we characterized the packet reordering processes seen in the network.
Gharai, L., Lehman, T., Perkins, C.S.
core +3 more sources
A Protocol for Packet Network Intercommunication [PDF]
A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process-to-process connections.
Robert E. Kahn, Vinton G. Cerf
openaire +3 more sources
Packet Satellite Networks [PDF]
Packet satellite networks combine the advantages of packet switching for channel sharing with those of satellites for long-haul broadcast capability. This paper describes the packet satellite technology as developed by DARPA and demonstrated in two systems based on channels provided by INTELSAT and WESTAR satellites, respectively.
openaire +2 more sources