- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 10 of 13 (0.028 seconds)Spelling suggestions: "subject:"datanät"" "subject:"datanän""
| 1 |
Offline constraint-based routing in OSPF networks : a server based studyAli, Murad January 2007 (has links)
<p>Many of the network applications today are demanding QoS guaranteed paths which the best effort routing protocols e.g. OSPF cannot calculate, because these protocols are topology driven, do not address many of the constraints by these applications and only calculate shortest paths. In this thesis offline constraint based routing is studied for Open Shortest Path First (OSPFv2) protocol single area network and an offline server is proposed for QoS guaranteed routing. The server builds traffic engineering (TE) database and calculates QoS guaranteed paths on behalf of all the routers in that area. The client routers only do best effort routing for normal data flows with no requirement for QoS guaranteed paths. The client routers use NETCONF protocol to download QoS routes from the offline server (OS). The offline server besides calculating QoS paths also reduces congestion and helps in efficiently utilizing the network resources, for example bandwidth.</p>
|
| 2 |
Offline constraint-based routing in OSPF networks : a server based studyAli, Murad January 2007 (has links)
Many of the network applications today are demanding QoS guaranteed paths which the best effort routing protocols e.g. OSPF cannot calculate, because these protocols are topology driven, do not address many of the constraints by these applications and only calculate shortest paths. In this thesis offline constraint based routing is studied for Open Shortest Path First (OSPFv2) protocol single area network and an offline server is proposed for QoS guaranteed routing. The server builds traffic engineering (TE) database and calculates QoS guaranteed paths on behalf of all the routers in that area. The client routers only do best effort routing for normal data flows with no requirement for QoS guaranteed paths. The client routers use NETCONF protocol to download QoS routes from the offline server (OS). The offline server besides calculating QoS paths also reduces congestion and helps in efficiently utilizing the network resources, for example bandwidth.
|
| 3 |
Trådlöst nätverk : en attitydstudieNilsson, Daniel, Krafft, Mikael January 2004 (has links)
No description available.
|
| 4 |
Trådlöst nätverk : en attitydstudieNilsson, Daniel, Krafft, Mikael January 2004 (has links)
No description available.
|
| 5 |
Introduktion av IPv6 i en medelstor organisations IPv4 nätverkPalic, Amir, Wikman, Pekka January 2004 (has links)
No description available.
|
| 6 |
Introduktion av IPv6 i en medelstor organisations IPv4 nätverkPalic, Amir, Wikman, Pekka January 2004 (has links)
No description available.
|
| 7 |
Distribution av programvara i en stor organisation : fallstudie från landstinget i ÖstergötlandLjungstedt, Stefan January 2002 (has links)
No description available.
|
| 8 |
Frekvensstörningari IEEE 802.11b nätverkEnvik, Richard, Kullberg, Niclas, Johansson, Martin January 2003 (has links)
No description available.
|
| 9 |
Distribution av programvara i en stor organisation : fallstudie från landstinget i ÖstergötlandLjungstedt, Stefan January 2002 (has links)
No description available.
|
| 10 |
Frekvensstörningari IEEE 802.11b nätverkEnvik, Richard, Kullberg, Niclas, Johansson, Martin January 2003 (has links)
No description available.
|
Page generated in 0.0329 seconds