[图书][B] Fractal teletraffic modeling and delay bounds in computer communications

M Li - 2022 - taylorfrancis.com
By deploying time series analysis, Fourier transform, functional analysis, min-plus
convolution, and fractional order systems and noise, this book proposes fractal traffic …

An efficient method for determining economical configurations of elementary packet-switched networks

K Kamimura, H Nishimo - IEEE Transactions on …, 1991 - ieeexplore.ieee.org
The packet-switched network design problem can be formulated as a capacity and flow
assignment (CFA) problem. The CFA problem is investigated for an elementary network …

Quasi cut-through: New hybrid switching technique for computer communication networks

M Ilyas, HT Mouftah - IEE Proceedings E (Computers and Digital Techniques …, 1984 - IET
A novel hybrid switching technique for computer networks is proposed and analysed in this
paper. This hybrid switching technique combines packet switching and cut-through …

Mean waiting time evaluation of packet switches for centrally controlled PBX's

HS Bradlow, HF Byrd - Performance Evaluation, 1987 - Elsevier
The performance analysis of packet switched networks usually does not account for the loss
of transmission bandwidth caused by the switch processing time. In wide area networks …

Delay analysis of a modified cut-through switching for multipacket messages

M Ilyas, HT Mouftah - IEE Proceedings E (Computers and Digital Techniques …, 1985 - IET
A new switching technique called 'virtual cut-through'has been recently proposed for
computer communication networks. The paper presents the analysis of 'virtual cut …

Packet‐switched network design with constraints on the circuit discreteness

K Kamimura - Electronics and Communications in Japan (Part I …, 1989 - Wiley Online Library
The packet‐switched network design problem can be formulated as a capacity and flow
assignment problem (CFAP). The CFAP of an elementary network consisting of one tandem …

[PDF][PDF] An iteration algorithm for optimal network flows.

CJ Woong - 1983 - core.ac.uk
ABSTRACT A packet switching network hasthe desirable feature of rapidly handling short
(bursty) messages of the typeoften found in computer communication systems. In evaluating …

Learning routing applied to large scale packet–switched communication networks

SI Kuribayashi, T Nakamura… - … and Communications in …, 1980 - Wiley Online Library
Learning routing is introduced to large‐scale communication network to compensate the
lack of a priori information on the network behavior. Learning routing consists of learning …

[引用][C] Performance evaluation of computer communications networks

M Ilyas, H Mouftah - IEEE Communications Magazine, 1985 - ieeexplore.ieee.org
OMPUTER COMMUNlCATION networks have evolved very rapidly during the last decade.
Recently, as a part of continuing advancement in networking technology, several impressive …

[引用][C] Communication control in computer networks

J Puzman, R Porizek - 1981 - dl.acm.org
Communication Control in Computer Networks | Guide books skip to main content ACM Digital
Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …