Results 211 to 220 of about 429,649 (267)
Some of the next articles are maybe not open access.

Scheduling transmissions in a network

Journal of Algorithms, 1985
Summary: Consider k stations wishing to transmit messages over a network of channels to a common receiver. The capacity of a channel is the maximum amount of data which can be transmitted in a time unit. In addition to the transmission stations, the network contains switching nodes.
Alon Itai, Michael Rodeh
openaire   +1 more source

Optical Transmission Modules for Intraoffice Transmission Networks

IEEE Journal on Selected Areas in Communications, 1986
This paper considers the requirements of, and proposes technical solutions for, the optical transmission modules used in intraoffice links. A novel crosstalk noise measurement procedure is proposed along with a quantitative evaluation method for crosstalk prevention which is very important in the development of compact modules.
Masatoyo Sumida, Hisao Tsuji
openaire   +1 more source

Gigabit networking on the public transmission network

IEEE Communications Magazine, 1992
The evolution of the public network, from gigabit transmission to gigabit networking, is examined from the perspective of a telephone operating company. The relationship between technology push and service pull and the impact that both have on network architectures are considered. The network transition is discussed to identify ways of cost effectively
openaire   +1 more source

Transmissions in a network with capacities and delays

Networks, 1999
Summary: We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and nonzero propagation delays. In the absence of delays, the problem has been shown to be solvable in polynomial time. In this paper, we show that the general problem is NP-complete.
Dimitrios Kagaris   +3 more
openaire   +3 more sources

Feasibility of DC transmission networks

2011 2nd IEEE PES International Conference and Exhibition on Innovative Smart Grid Technologies, 2011
This paper examines the current status of technology and discusses technical options for developing DC transmission grids. The fast advances in VSC HVDC, the recent offshore VSC projects, the experience with multiterminal HVDC and recent development of fast DC circuit breakers bring large meshed DC grids closer to reality.
Dragan Jovcic   +4 more
openaire   +1 more source

Optimizing Network Data Transmission

Third International Conference on Information Technology: New Generations (ITNG'06), 2006
Theoretically, transmitting compressed data will optimize bandwidth use. Internet traffic is rarely compressed, thus this benefit is not fully realized. Compression algorithms should be increasingly effective as file size increases, up to a maximum determined by the data type and compression algorithm. However, these efficiencies are also not achieved.
E. Earl Eiland, Lorie M. Liebrock
openaire   +1 more source

Renewable Energy and Transmission Networks

2014
info:eu-repo/semantics ...
Olmos Camacho, Luis   +2 more
openaire   +2 more sources

Data transmission in processor networks

1995
We investigate the communication capacity and optimal data transmission schedules for processor networks connected by communication links, for example Transputer clusters. Each link allows the two processors at its endpoints to exchange data with a given fixed transmission rate τd. The communication itself is done in a blocking mode, that means the two
Andreas Jakoby, Rüdiger Reischuk
openaire   +1 more source

Transmission on Networks

2018
The S-language which is the foundation of R was constructed using an “object”-based logic where each object is assigned a “class.” The class, in turn, controls printing, plotting, and summarizing each object.
openaire   +1 more source

On Transmission Scheduling in Wireless Networks

2006 IEEE International Symposium on Information Theory, 2006
In the 1990s Chlamtac and Farago introduced a Transmission Scheduling (TS) algorithm for wireless networks, called the (Proper Robust Scheduling) PRS algorithm, later generalized to ML-PRS by Bozta? to support a set of multi-priority users, each with different transmission characteristics.
openaire   +1 more source

Home - About - Disclaimer - Privacy