1974 ◽  
Vol 5 (12) ◽  
pp. 1107-1118 ◽  
Author(s):  
K.R. KRISHNAN ◽  
R. MUKUNDAN ◽  
D.A. PERREAULT ◽  
R.H. BITTEL ◽  
H. HELM

2020 ◽  
Vol 19 (2) ◽  
pp. 412-445 ◽  
Author(s):  
Sergej Andreev ◽  
Roman Tregubov ◽  
Alexander Mironov

The paper proposes a solution to the problem of selecting the bandwidth capabilities of digital communication channels of a transport communication network taking into account the imbalance of data traffic by priorities. The algorithm for selecting bandwidth guarantees the minimum costs associated with renting digital communication channels with optimal bandwidth, provided that the requirements for quality of service of protocol data blocks of the first, second, and k-th priority in an unbalanced in terms of priorities transport communication network are met. At the first stage of solving the problem, using the method of Lagrange multipliers, an algorithm for selecting the capacities of digital communication channels for a balanced in terms of priorities transport network was developed. High performance of this algorithm was ensured by applying algebraic operations on matrices (addition, multiplication, etc.). At the second stage of solving the problem, using the generalized Lagrange multipliers method, we compared the conditional extrema of the cost function for renting digital communication channels for single active quality of service requirements for protocol data blocks, for all possible pairs of active quality of service requirements for protocol data blocks, for all possible triples of active requirements for the quality of service of protocol data units, and so on up to the case when all the requirements for quality of service maintenance of protocol data units are active simultaniously. At the third stage of solving the problem, an example of selecting the bandwidth capabilities of digital communication channels of the unbalanced by priorities transport network consisting of eight routers serving protocol data blocks of three priorities was considered. At the fourth stage of the solution of the problem of the choice of carrying capacities the estimation of efficiency of the developed algorithm by a method of simulation modeling was carried out. To this end, in the environment of the network simulator OMNet ++, the unbalanced in terms of priority transport communication network consisting of eight routers connected by twelve digital communication channels with optimal bandwidth was investigated.


Cryptography ◽  
2020 ◽  
pp. 556-573
Author(s):  
Jayanta Mondal ◽  
Debabala Swain

Images unduly assist digital communication in this aeon of multimedia. During times a person transmits confidential images over a flabby communication network, sheer protection is an accost contention to preserve the privacy of images. Encryption is one of the practice to clutch the reticence of images. Image encryption contributes a preeminent bite to charter security for secure sight data communication over the internet. Our work illustrates a survey on image encryption in different domains providing concise exordium to cryptography, moreover, furnishing the review of sundry image encryption techniques.


2008 ◽  
Vol 41 (2) ◽  
pp. 10776-10781
Author(s):  
Hongwang Yu ◽  
Yufan Zheng ◽  
Cuiping Leng ◽  
Xiaomei Zhang

Author(s):  
Jayanta Mondal ◽  
Debabala Swain

Images unduly assist digital communication in this aeon of multimedia. During times a person transmits confidential images over a flabby communication network, sheer protection is an accost contention to preserve the privacy of images. Encryption is one of the practice to clutch the reticence of images. Image encryption contributes a preeminent bite to charter security for secure sight data communication over the internet. Our work illustrates a survey on image encryption in different domains providing concise exordium to cryptography, moreover, furnishing the review of sundry image encryption techniques.


Author(s):  
D. W. Davies ◽  
K. A. Bartlett ◽  
R. A. Scantlebury ◽  
P. T. Wilkinson

1981 ◽  
Vol 16 (4) ◽  
pp. 356-362
Author(s):  
N. Ohwada ◽  
T. Kimura ◽  
R. Kasai ◽  
H. Fukuda ◽  
M. Ishikawa ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document