The paper presents several new algorithms concerning the third (network) and the fourth (transport) layer of ISO/OSI network model. For the third layer two classes of the shortest paths algorithms – label correcting and auction algorithms – are proposed. For the fourth layer an application of price decomposition to network optimization and Internet congestion control is suggested
This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (I...
This thesis concerns the problem of designing distributed algorithms for achieving efficient and fai...
The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using b...
The paper reviews current algorithms for distributed, asynchronous control of networks when the cust...
Abstract: Routing in computer network is an essential functionality, which influence both the networ...
International Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los An...
[[abstract]]Open shortest path first (OSPF) is the most widely used intra-domain Internet routing pr...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
Discrete optimization algorithms exist for analysis of network optimization of flow problems. Comput...
This thesis examines traffic control options available in two existing routing solutions in packet-s...
The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct su...
Data flowing through the internet continues to grow every year. Increase in traffic demands increase...
The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct su...
A mathematical model is presented for the problem of jointly assigning routes to the communicating p...
Two of the most commonly used intra-domain Internet routing protocols are Open Shortest Path First (...
This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (I...
This thesis concerns the problem of designing distributed algorithms for achieving efficient and fai...
The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using b...
The paper reviews current algorithms for distributed, asynchronous control of networks when the cust...
Abstract: Routing in computer network is an essential functionality, which influence both the networ...
International Telemetering Conference Proceedings / November 14-16, 1978 / Hyatt House Hotel, Los An...
[[abstract]]Open shortest path first (OSPF) is the most widely used intra-domain Internet routing pr...
Shortest path problems are fundamental network optimization problems arising in many contexts and ha...
Discrete optimization algorithms exist for analysis of network optimization of flow problems. Comput...
This thesis examines traffic control options available in two existing routing solutions in packet-s...
The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct su...
Data flowing through the internet continues to grow every year. Increase in traffic demands increase...
The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct su...
A mathematical model is presented for the problem of jointly assigning routes to the communicating p...
Two of the most commonly used intra-domain Internet routing protocols are Open Shortest Path First (...
This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (I...
This thesis concerns the problem of designing distributed algorithms for achieving efficient and fai...
The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using b...