Dr. rer. nat. Rüdiger Martin

2010

1.
Menth, M., Hartmann, M., Martin, R., Cicic, T., Kvalbein, A.: Loop-Free Alternates and Not-Via Addresses: A Proper Combination for IP Fast Reroute?. Computer Networks. 54, 1300–1315 (2010).
[ Abstract ] [ BibTeX ] [ EndNote ] [ Download ]
 
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re-convergence. Several mechanisms are proposed. Loop-free alternates (LFAs) are simple but cannot cover all single link and node failures. Not-via addresses can protect against these failures but are more complex, in particular, they use tunneling techniques to deviate backup traffic. In the IETF it has been proposed to combine both mechanisms to merge their advantages: simplicity and full failure coverage. This work analyzes LFAs and classifies them according to their abilities. We qualitatively compare LFAs and not-via addresses and develop a concept for their combined application to achieve 100% single failure coverage, while using simple LFAs wherever possible. The applicability of existing LFAs depends on the resilience requirements of the network. We study the backup path length and the link utilization for both IP FRR methods and quantify the decapsulation load and the increase of the routing table size caused by not-via addresses. We conclude that the combined usage of both methods has no advantage compared to the application of not-via addresses only.
@article{info3-article-2010-70, abstract = {The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re-convergence. Several mechanisms are proposed. Loop-free alternates (LFAs) are simple but cannot cover all single link and node failures. Not-via addresses can protect against these failures but are more complex, in particular, they use tunneling techniques to deviate backup traffic. In the IETF it has been proposed to combine both mechanisms to merge their advantages: simplicity and full failure coverage. This work analyzes LFAs and classifies them according to their abilities. We qualitatively compare LFAs and not-via addresses and develop a concept for their combined application to achieve 100% single failure coverage, while using simple LFAs wherever possible. The applicability of existing LFAs depends on the resilience requirements of the network. We study the backup path length and the link utilization for both IP FRR methods and quantify the decapsulation load and the increase of the routing table size caused by not-via addresses. We conclude that the combined usage of both methods has no advantage compared to the application of not-via addresses only.}, author = {Menth, Michael and Hartmann, Matthias and Martin, Rüdiger and Cicic, Tarik and Kvalbein, Amund}, journal = {Computer Networks}, keywords = {myown sys:hidden:article}, month = 6, pages = {1300-1315}, title = {Loop-Free Alternates and Not-Via Addresses: A Proper Combination for IP Fast Reroute?}, volume = 54, year = 2010 }
%0 Journal Article %1 info3-article-2010-70 %A Menth, Michael %A Hartmann, Matthias %A Martin, Rüdiger %A Cicic, Tarik %A Kvalbein, Amund %D 2010 %J Computer Networks %P 1300-1315 %T Loop-Free Alternates and Not-Via Addresses: A Proper Combination for IP Fast Reroute? %V 54 %X The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re-convergence. Several mechanisms are proposed. Loop-free alternates (LFAs) are simple but cannot cover all single link and node failures. Not-via addresses can protect against these failures but are more complex, in particular, they use tunneling techniques to deviate backup traffic. In the IETF it has been proposed to combine both mechanisms to merge their advantages: simplicity and full failure coverage. This work analyzes LFAs and classifies them according to their abilities. We qualitatively compare LFAs and not-via addresses and develop a concept for their combined application to achieve 100% single failure coverage, while using simple LFAs wherever possible. The applicability of existing LFAs depends on the resilience requirements of the network. We study the backup path length and the link utilization for both IP FRR methods and quantify the decapsulation load and the increase of the routing table size caused by not-via addresses. We conclude that the combined usage of both methods has no advantage compared to the application of not-via addresses only.
2.
Menth, M., Martin, R., Hartmann, M., Spörlein, U.: Efficiency of Routing and Resilience Mechanisms in Packet-Switched Communication Networks. European Transactions on Telecommunications. 21, 108–120 (2010).
[ Abstract ] [ BibTeX ] [ EndNote ] [ Download ]
 
In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization rS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it leads to a lower maximum link utilization rS. We consider standard and optimized versions of IP routing and rerouting, optimized routing using explicit paths and end-to-end protection switching, as well as standard and optimized versions of MPLS fast reroute. The results show that routing optimization reduces the maximum link utilization significantly both with and without failure protection. The optimization potential for resilient routing is limited by the applied mechanism and depends heavily on the network structure and the set of protected failure scenarios S.
@article{info3-article-2010-66, abstract = {In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization rS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it leads to a lower maximum link utilization rS. We consider standard and optimized versions of IP routing and rerouting, optimized routing using explicit paths and end-to-end protection switching, as well as standard and optimized versions of MPLS fast reroute. The results show that routing optimization reduces the maximum link utilization significantly both with and without failure protection. The optimization potential for resilient routing is limited by the applied mechanism and depends heavily on the network structure and the set of protected failure scenarios S.}, author = {Menth, Michael and Martin, Rüdiger and Hartmann, Matthias and Spörlein, Ulrich}, journal = {European Transactions on Telecommunications}, keywords = {myown sys:hidden:article}, month = 3, pages = {108-120}, title = {Efficiency of Routing and Resilience Mechanisms in Packet-Switched Communication Networks}, volume = 21, year = 2010 }
%0 Journal Article %1 info3-article-2010-66 %A Menth, Michael %A Martin, Rüdiger %A Hartmann, Matthias %A Spörlein, Ulrich %D 2010 %J European Transactions on Telecommunications %P 108-120 %T Efficiency of Routing and Resilience Mechanisms in Packet-Switched Communication Networks %V 21 %X In this work we compare the efficiency of various routing and resilience mechanisms. Their path layout determines the utilization of links in the network under normal operation and in failure scenarios. For the comparison, the performance measure is the maximum utilization rS of all links for a set of protected failures S. A routing mechanism is considered more efficient than another if it leads to a lower maximum link utilization rS. We consider standard and optimized versions of IP routing and rerouting, optimized routing using explicit paths and end-to-end protection switching, as well as standard and optimized versions of MPLS fast reroute. The results show that routing optimization reduces the maximum link utilization significantly both with and without failure protection. The optimization potential for resilient routing is limited by the applied mechanism and depends heavily on the network structure and the set of protected failure scenarios S.

2009

1.
Menth, M., Duelli, M., Martin, R., Milbrandt, J.: Resilience Analysis for Packet-Switched Communication Networks. IEEE/ACM Transactions on Networking. 17, (2009).
[ Abstract ] [ BibTeX ] [ EndNote ] [ Download ]
 
In the presence of local network outages, restoration and protection switching mechanisms redirect the traffic over alternative paths to mitigate the effect of failures. However, some failure combinations still lead to loss of ingress-egress connectivity within a network or to severe congestion due to rerouted traffic. Congestion may also be caused by unexpected traffic shifts due to changed user behavior or due to changes of interdomain routing. This paper presents a framework for the analysis of ingress-egress unavailability and congestion due to (1) failures, (2) changes of user behavior, and (3) changed interdomain routing. It proposes algorithms to find the most probable combinations of (1), (2), and (3), and to evaluate the connectivity and the relative link load of the network under these conditions. We have implemented this concept in a software tool and its visualization of the results leads to a comprehensive view of the network’s resilience. It helps to anticipate potential ingress-egress disconnection and congestion before failures and overload occur or before planned modifications (new infrastructure, new routing, new customers) take effect. Thus, it detects weak points in a network, predicts the effectiveness of potential upgrades, and thereby supports careful bandwidth overprovisioning.
@article{info3-article-2009-59, abstract = {In the presence of local network outages, restoration and protection switching mechanisms redirect the traffic over alternative paths to mitigate the effect of failures. However, some failure combinations still lead to loss of ingress-egress connectivity within a network or to severe congestion due to rerouted traffic. Congestion may also be caused by unexpected traffic shifts due to changed user behavior or due to changes of interdomain routing. This paper presents a framework for the analysis of ingress-egress unavailability and congestion due to (1) failures, (2) changes of user behavior, and (3) changed interdomain routing. It proposes algorithms to find the most probable combinations of (1), (2), and (3), and to evaluate the connectivity and the relative link load of the network under these conditions. We have implemented this concept in a software tool and its visualization of the results leads to a comprehensive view of the network’s resilience. It helps to anticipate potential ingress-egress disconnection and congestion before failures and overload occur or before planned modifications (new infrastructure, new routing, new customers) take effect. Thus, it detects weak points in a network, predicts the effectiveness of potential upgrades, and thereby supports careful bandwidth overprovisioning.}, author = {Menth, Michael and Duelli, Michael and Martin, Rüdiger and Milbrandt, Jens}, journal = {IEEE/ACM Transactions on Networking}, keywords = {myown sys:hidden:article}, month = 12, title = {Resilience Analysis for Packet-Switched Communication Networks}, volume = 17, year = 2009 }
%0 Journal Article %1 info3-article-2009-59 %A Menth, Michael %A Duelli, Michael %A Martin, Rüdiger %A Milbrandt, Jens %D 2009 %J IEEE/ACM Transactions on Networking %T Resilience Analysis for Packet-Switched Communication Networks %V 17 %X In the presence of local network outages, restoration and protection switching mechanisms redirect the traffic over alternative paths to mitigate the effect of failures. However, some failure combinations still lead to loss of ingress-egress connectivity within a network or to severe congestion due to rerouted traffic. Congestion may also be caused by unexpected traffic shifts due to changed user behavior or due to changes of interdomain routing. This paper presents a framework for the analysis of ingress-egress unavailability and congestion due to (1) failures, (2) changes of user behavior, and (3) changed interdomain routing. It proposes algorithms to find the most probable combinations of (1), (2), and (3), and to evaluate the connectivity and the relative link load of the network under these conditions. We have implemented this concept in a software tool and its visualization of the results leads to a comprehensive view of the network’s resilience. It helps to anticipate potential ingress-egress disconnection and congestion before failures and overload occur or before planned modifications (new infrastructure, new routing, new customers) take effect. Thus, it detects weak points in a network, predicts the effectiveness of potential upgrades, and thereby supports careful bandwidth overprovisioning.
2.
Cicic, T., Fosselie Hansen, A., Kvalbein, A., Hartmann, M., Martin, R., Menth, M., Gjessing, S., Lysne, O.: Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures. IEEE Transactions on Network and Service Managment. 6, 1–14 (2009).
[ Abstract ] [ BibTeX ] [ EndNote ] [ Download ]
 
Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). The authors have previously proposed an IP FRR scheme based on multi-topology routing called Multiple Routing Configurations (MRC). MRC supports guaranteed, instantaneous recovery from any single link or node failure in biconnected networks as well as from many combined failures, provided sufficient bandwidth on the surviving links. Furthermore, in MRC different failures result in routing over different network topologies, which gives a good control of the traffic distribution in the networks after a failure. In this paper we present two contributions. First we define an enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). Through experiments we demonstrate that rMRC is an improvement over MRC in all important aspects. Resource utilization in the presence of failures is significantly better, both in terms of paths lengths and in terms of load distribution between the links. The requirement to internal state in the routers is reduced as rMRC requires fewer backup topologies to provide the same degree of protection. In addition to this, the preprocessing needed to generate the backup topologies is simplified. The second contribution is an extension of rMRC that can provide fast reroute in the presence of multiple correlated failures. Our evaluations demonstrate only a small penalty in path lengths and in the number of backup topologies required.
@article{info3-article-2009-67, abstract = {Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). The authors have previously proposed an IP FRR scheme based on multi-topology routing called Multiple Routing Configurations (MRC). MRC supports guaranteed, instantaneous recovery from any single link or node failure in biconnected networks as well as from many combined failures, provided sufficient bandwidth on the surviving links. Furthermore, in MRC different failures result in routing over different network topologies, which gives a good control of the traffic distribution in the networks after a failure. In this paper we present two contributions. First we define an enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). Through experiments we demonstrate that rMRC is an improvement over MRC in all important aspects. Resource utilization in the presence of failures is significantly better, both in terms of paths lengths and in terms of load distribution between the links. The requirement to internal state in the routers is reduced as rMRC requires fewer backup topologies to provide the same degree of protection. In addition to this, the preprocessing needed to generate the backup topologies is simplified. The second contribution is an extension of rMRC that can provide fast reroute in the presence of multiple correlated failures. Our evaluations demonstrate only a small penalty in path lengths and in the number of backup topologies required.}, author = {Cicic, Tarik and Fosselie Hansen, Audun and Kvalbein, Amund and Hartmann, Matthias and Martin, Rüdiger and Menth, Michael and Gjessing, Stein and Lysne, Olav}, journal = {IEEE Transactions on Network and Service Managment}, keywords = {myown sys:hidden:article}, month = 3, pages = {1-14}, title = {Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures}, volume = 6, year = 2009 }
%0 Journal Article %1 info3-article-2009-67 %A Cicic, Tarik %A Fosselie Hansen, Audun %A Kvalbein, Amund %A Hartmann, Matthias %A Martin, Rüdiger %A Menth, Michael %A Gjessing, Stein %A Lysne, Olav %D 2009 %J IEEE Transactions on Network and Service Managment %P 1-14 %T Relaxed Multiple Routing Configurations: IP Fast Reroute for Single and Correlated Failures %V 6 %X Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). The authors have previously proposed an IP FRR scheme based on multi-topology routing called Multiple Routing Configurations (MRC). MRC supports guaranteed, instantaneous recovery from any single link or node failure in biconnected networks as well as from many combined failures, provided sufficient bandwidth on the surviving links. Furthermore, in MRC different failures result in routing over different network topologies, which gives a good control of the traffic distribution in the networks after a failure. In this paper we present two contributions. First we define an enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). Through experiments we demonstrate that rMRC is an improvement over MRC in all important aspects. Resource utilization in the presence of failures is significantly better, both in terms of paths lengths and in terms of load distribution between the links. The requirement to internal state in the routers is reduced as rMRC requires fewer backup topologies to provide the same degree of protection. In addition to this, the preprocessing needed to generate the backup topologies is simplified. The second contribution is an extension of rMRC that can provide fast reroute in the presence of multiple correlated failures. Our evaluations demonstrate only a small penalty in path lengths and in the number of backup topologies required.

2008

1.
Martin, R., Pries, R., Zinner, T.: Zukünftige Zugangsinfrastrukturen. , Datev Trendscout, Nürnberg (2008).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2008-318, address = {Datev Trendscout, Nürnberg}, author = {Martin, Rüdiger and Pries, Rastin and Zinner, Thomas}, keywords = {myown sys:hidden:presentation}, month = 7, title = {Zukünftige Zugangsinfrastrukturen}, year = 2008 }
%0 Generic %1 info3-talk-2008-318 %A Martin, Rüdiger %A Pries, Rastin %A Zinner, Thomas %C Datev Trendscout, Nürnberg %D 2008 %T Zukünftige Zugangsinfrastrukturen
2.
Martin, R.: Resilience, Provisioning, and Control for the Network of the Future, (2008).
[ BibTeX ] [ EndNote ] [ Download ]
 
@phdthesis{info3-dissertation-2008-22, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:dissertation sys:hidden:supervisor:phuoc.tran-gia}, month = 7, school = {University of Wuerzburg}, title = {Resilience, Provisioning, and Control for the Network of the Future}, year = 2008 }
%0 Thesis %1 info3-dissertation-2008-22 %A Martin, Rüdiger %D 2008 %T Resilience, Provisioning, and Control for the Network of the Future
3.
Cicic, T., Fosselie Hansen, A., Kvalbein, A., Hartmann, M., Martin, R., Menth, M.: Relaxed Multiple Routing Configurations for IP Fast Reroute. IEEE/IFIP Network Operations and Management Symposium. , Salvador, Bahia, Brazil (2008).
[ Abstract ] [ BibTeX ] [ EndNote ] [ Download ]
 
Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any link or node failure. Second, different failures result in routing over different network topologies, which augments the parameter space for load distribution optimizations. Multiple Routing Configurations (MRC) is the state-of-the-art IP FRR scheme based on multi-topology routing today. In this paper we present a new, enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. According to our experimental evaluation, rMRC has several benefits compared to MRC. The number of backup topologies required to provide protection against the same set of failures is reduced, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better.
@inproceedings{info3-inproceedings-2008-302, abstract = {Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any link or node failure. Second, different failures result in routing over different network topologies, which augments the parameter space for load distribution optimizations. Multiple Routing Configurations (MRC) is the state-of-the-art IP FRR scheme based on multi-topology routing today. In this paper we present a new, enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. According to our experimental evaluation, rMRC has several benefits compared to MRC. The number of backup topologies required to provide protection against the same set of failures is reduced, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better.}, address = {Salvador, Bahia, Brazil}, author = {Cicic, Tarik and Fosselie Hansen, Audun and Kvalbein, Amund and Hartmann, Matthias and Martin, Rüdiger and Menth, Michael}, booktitle = {IEEE/IFIP Network Operations and Management Symposium}, keywords = {myown sys:hidden:inproceedings}, month = 4, title = {Relaxed Multiple Routing Configurations for IP Fast Reroute}, year = 2008 }
%0 Conference Paper %1 info3-inproceedings-2008-302 %A Cicic, Tarik %A Fosselie Hansen, Audun %A Kvalbein, Amund %A Hartmann, Matthias %A Martin, Rüdiger %A Menth, Michael %B IEEE/IFIP Network Operations and Management Symposium %C Salvador, Bahia, Brazil %D 2008 %T Relaxed Multiple Routing Configurations for IP Fast Reroute %X Multi-topology routing is an increasingly popular IP network management concept that allows transport of different traffic types over disjoint network paths. The concept is of particular interest for implementation of IP fast reroute (IP FRR). First, it can support guaranteed, instantaneous recovery from any link or node failure. Second, different failures result in routing over different network topologies, which augments the parameter space for load distribution optimizations. Multiple Routing Configurations (MRC) is the state-of-the-art IP FRR scheme based on multi-topology routing today. In this paper we present a new, enhanced IP FRR scheme which we call 'relaxed MRC' (rMRC). rMRC simplifies the topology construction and increases the routing flexibility in each topology. According to our experimental evaluation, rMRC has several benefits compared to MRC. The number of backup topologies required to provide protection against the same set of failures is reduced, hence reducing state in routers. In addition, the backup paths are shorter, and the link utilization is significantly better.

2007

1.
Martin, R., Menth, M., Hemmkeppler, M.: Accuracy and Dynamics of Multi-Stage Load Balancing for Multipath Internet Routing. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-213, author = {Martin, Rüdiger and Menth, Michael and Hemmkeppler, Michael}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 4, number = 419, title = {Accuracy and Dynamics of Multi-Stage Load Balancing for Multipath Internet Routing}, year = 2007 }
%0 Report %1 info3-techreport-2007-213 %A Martin, Rüdiger %A Menth, Michael %A Hemmkeppler, Michael %D 2007 %N 419 %T Accuracy and Dynamics of Multi-Stage Load Balancing for Multipath Internet Routing
2.
Menth, M., Martin, R., Spörlein, U.: Failure-Specific Self-Protecting Multipaths: Increased Capacity Savings or Overengineering?. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-214, author = {Menth, Michael and Martin, Rüdiger and Spörlein, Ulrich}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 4, number = 420, title = {Failure-Specific Self-Protecting Multipaths: Increased Capacity Savings or Overengineering?}, year = 2007 }
%0 Report %1 info3-techreport-2007-214 %A Menth, Michael %A Martin, Rüdiger %A Spörlein, Ulrich %D 2007 %N 420 %T Failure-Specific Self-Protecting Multipaths: Increased Capacity Savings or Overengineering?
3.
Menth, M., Martin, R., Spörlein, U.: Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-212, author = {Menth, Michael and Martin, Rüdiger and Spörlein, Ulrich}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 4, number = 418, title = {Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks}, year = 2007 }
%0 Report %1 info3-techreport-2007-212 %A Menth, Michael %A Martin, Rüdiger %A Spörlein, Ulrich %D 2007 %N 418 %T Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks
4.
Menth, M., Martin, R., Spörlein, U.: Failure-Specific Self-Protecting Multipaths: Increased Capacity Savings or Overengineering?. The 6th International Workshop on Design of Reliable Communication Networks (DRCN). , La Rochelle, France (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2007-271, address = {La Rochelle, France}, author = {Menth, Michael and Martin, Rüdiger and Spörlein, Ulrich}, booktitle = {The 6th International Workshop on Design of Reliable Communication Networks (DRCN)}, keywords = {myown sys:hidden:inproceedings}, month = 10, title = {Failure-Specific Self-Protecting Multipaths: Increased Capacity Savings or Overengineering?}, year = 2007 }
%0 Conference Paper %1 info3-inproceedings-2007-271 %A Menth, Michael %A Martin, Rüdiger %A Spörlein, Ulrich %B The 6th International Workshop on Design of Reliable Communication Networks (DRCN) %C La Rochelle, France %D 2007 %T Failure-Specific Self-Protecting Multipaths: Increased Capacity Savings or Overengineering?
5.
Martin, R., Menth, M., Spörlein, U.: Integer SPM: Intelligent Path Selection for Resilient Networks. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-211, author = {Martin, Rüdiger and Menth, Michael and Spörlein, Ulrich}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 4, number = 417, title = {Integer SPM: Intelligent Path Selection for Resilient Networks}, year = 2007 }
%0 Report %1 info3-techreport-2007-211 %A Martin, Rüdiger %A Menth, Michael %A Spörlein, Ulrich %D 2007 %N 417 %T Integer SPM: Intelligent Path Selection for Resilient Networks
6.
Menth, M., Martin, R., Spörlein, U.: Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks. IEEE International Conference on Communications (ICC). , Glasgow, Scotland (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2007-260, address = {Glasgow, Scotland}, author = {Menth, Michael and Martin, Rüdiger and Spörlein, Ulrich}, booktitle = {IEEE International Conference on Communications (ICC)}, keywords = {myown sys:hidden:inproceedings}, month = 6, title = {Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks}, year = 2007 }
%0 Conference Paper %1 info3-inproceedings-2007-260 %A Menth, Michael %A Martin, Rüdiger %A Spörlein, Ulrich %B IEEE International Conference on Communications (ICC) %C Glasgow, Scotland %D 2007 %T Optimization of the Self-Protecting Multipath for Deployment in Legacy Networks
7.
Martin, R., Menth, M., Spörlein, U.: Integer SPM: Intelligent Path Selection for Resilient Networks. 6th IFIP-TC6 Networking Conference (Networking). , Atlanta, GA, USA (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2007-262, address = {Atlanta, GA, USA}, author = {Martin, Rüdiger and Menth, Michael and Spörlein, Ulrich}, booktitle = {6th IFIP-TC6 Networking Conference (Networking)}, keywords = {myown sys:hidden:inproceedings}, month = 5, title = {Integer SPM: Intelligent Path Selection for Resilient Networks}, year = 2007 }
%0 Conference Paper %1 info3-inproceedings-2007-262 %A Martin, Rüdiger %A Menth, Michael %A Spörlein, Ulrich %B 6th IFIP-TC6 Networking Conference (Networking) %C Atlanta, GA, USA %D 2007 %T Integer SPM: Intelligent Path Selection for Resilient Networks
8.
Menth, M., Hartmann, M., Martin, R.: Robust IP Link Costs for Multilayer Resilience. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-220, author = {Menth, Michael and Hartmann, Matthias and Martin, Rüdiger}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 5, number = 427, title = {Robust IP Link Costs for Multilayer Resilience}, year = 2007 }
%0 Report %1 info3-techreport-2007-220 %A Menth, Michael %A Hartmann, Matthias %A Martin, Rüdiger %D 2007 %N 427 %T Robust IP Link Costs for Multilayer Resilience
9.
Menth, M., Martin, R., Koster, A.M., Orlowski, S.: Overview of Resilience Mechanisms Based on Multipath Structures. The 6th International Workshop on Design of Reliable Communication Networks (DRCN). , La Rochelle, France (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2007-270, address = {La Rochelle, France}, author = {Menth, Michael and Martin, Rüdiger and Koster, Arie M.C.A. and Orlowski, Sebastian}, booktitle = {The 6th International Workshop on Design of Reliable Communication Networks (DRCN)}, keywords = {myown sys:hidden:inproceedings}, month = 10, title = {Overview of Resilience Mechanisms Based on Multipath Structures}, year = 2007 }
%0 Conference Paper %1 info3-inproceedings-2007-270 %A Menth, Michael %A Martin, Rüdiger %A Koster, Arie M.C.A. %A Orlowski, Sebastian %B The 6th International Workshop on Design of Reliable Communication Networks (DRCN) %C La Rochelle, France %D 2007 %T Overview of Resilience Mechanisms Based on Multipath Structures
10.
Menth, M., Martin, R., Koster, A.M., Orlowski, S.: Overview of Resilience Mechanisms Based on Multipath Structures. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-215, author = {Menth, Michael and Martin, Rüdiger and Koster, Arie M.C.A. and Orlowski, Sebastian}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 4, number = 421, title = {Overview of Resilience Mechanisms Based on Multipath Structures}, year = 2007 }
%0 Report %1 info3-techreport-2007-215 %A Menth, Michael %A Martin, Rüdiger %A Koster, Arie M.C.A. %A Orlowski, Sebastian %D 2007 %N 421 %T Overview of Resilience Mechanisms Based on Multipath Structures
11.
Martin, R., Menth, M.: Impact of Multi-Failures in Survivable Networks. 8. ITG-Fachtagung Photonische Netze. , Leipzig, Germany (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2007-299, address = {Leipzig, Germany}, author = {Martin, Rüdiger and Menth, Michael}, booktitle = {8. ITG-Fachtagung Photonische Netze}, keywords = {myown sys:hidden:inproceedings}, month = 5, title = {Impact of Multi-Failures in Survivable Networks}, year = 2007 }
%0 Conference Paper %1 info3-inproceedings-2007-299 %A Martin, Rüdiger %A Menth, Michael %B 8. ITG-Fachtagung Photonische Netze %C Leipzig, Germany %D 2007 %T Impact of Multi-Failures in Survivable Networks
12.
Martin, R., Menth, M., Hartmann, M., Cicic, T., Kvalbein, A.: The Effect of Combining Loop-Free Alternates and Not-Via Addresses in IP Fast Reroute. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-226, author = {Martin, Rüdiger and Menth, Michael and Hartmann, Matthias and Cicic, Tarik and Kvalbein, Amund}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 9, number = 432, title = {The Effect of Combining Loop-Free Alternates and Not-Via Addresses in IP Fast Reroute}, year = 2007 }
%0 Report %1 info3-techreport-2007-226 %A Martin, Rüdiger %A Menth, Michael %A Hartmann, Matthias %A Cicic, Tarik %A Kvalbein, Amund %D 2007 %N 432 %T The Effect of Combining Loop-Free Alternates and Not-Via Addresses in IP Fast Reroute
13.
Menth, M., Martin, R., Hartmann, M., Spörlein, U.: Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks. University of Wuerzburg (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2007-225, author = {Menth, Michael and Martin, Rüdiger and Hartmann, Matthias and Spörlein, Ulrich}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 5, number = 425, title = {Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks}, year = 2007 }
%0 Report %1 info3-techreport-2007-225 %A Menth, Michael %A Martin, Rüdiger %A Hartmann, Matthias %A Spörlein, Ulrich %D 2007 %N 425 %T Efficiency of Routing and Resilience Mechanisms in Packet-Switched Networks
14.
Martin, R., Menth, M., Hemmkeppler, M.: Accuracy and Dynamics of Multi-Stage Load Balancing for Multipath Internet Routing. IEEE International Conference on Communications (ICC). , Glasgow, Scotland (2007).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2007-259, address = {Glasgow, Scotland}, author = {Martin, Rüdiger and Menth, Michael and Hemmkeppler, Michael}, booktitle = {IEEE International Conference on Communications (ICC)}, keywords = {myown sys:hidden:inproceedings}, month = 6, title = {Accuracy and Dynamics of Multi-Stage Load Balancing for Multipath Internet Routing}, year = 2007 }
%0 Conference Paper %1 info3-inproceedings-2007-259 %A Martin, Rüdiger %A Menth, Michael %A Hemmkeppler, Michael %B IEEE International Conference on Communications (ICC) %C Glasgow, Scotland %D 2007 %T Accuracy and Dynamics of Multi-Stage Load Balancing for Multipath Internet Routing
15.
Menth, M., Hartmann, M., Martin, R.: Robust IP Link Costs for Multilayer Resilience. 6th IFIP-TC6 Networking Conference (Networking). , Atlanta, GA, USA (2007).
[ Abstract ] [ BibTeX ] [ EndNote ] [ Download ]
 
In this work we optimize administrative link costs of IP networks in such a way that the maximum utilization of all links is as low as possible for a set of considered failure scenarios (e.g., all single link failures). To that aim, we present the new 'hill hopping' heuristic with three different variants and compare their computation times and the quality of their results. We adapt the objective function of the heuristic to make the link cost settings robust to single link failures, single node failures, and single link or node failures, and compare the results. In particular, we optimize the routing for multilayer networks where unused backup capacity of the link layer can be reused to redirect traffic on the network layer in case of an IP node failure.
@inproceedings{info3-inproceedings-2007-284, abstract = {In this work we optimize administrative link costs of IP networks in such a way that the maximum utilization of all links is as low as possible for a set of considered failure scenarios (e.g., all single link failures). To that aim, we present the new 'hill hopping' heuristic with three different variants and compare their computation times and the quality of their results. We adapt the objective function of the heuristic to make the link cost settings robust to single link failures, single node failures, and single link or node failures, and compare the results. In particular, we optimize the routing for multilayer networks where unused backup capacity of the link layer can be reused to redirect traffic on the network layer in case of an IP node failure.}, address = {Atlanta, GA, USA}, author = {Menth, Michael and Hartmann, Matthias and Martin, Rüdiger}, booktitle = {6th IFIP-TC6 Networking Conference (Networking)}, keywords = {myown sys:hidden:inproceedings}, month = 5, title = {Robust IP Link Costs for Multilayer Resilience}, year = 2007 }
%0 Conference Paper %1 info3-inproceedings-2007-284 %A Menth, Michael %A Hartmann, Matthias %A Martin, Rüdiger %B 6th IFIP-TC6 Networking Conference (Networking) %C Atlanta, GA, USA %D 2007 %T Robust IP Link Costs for Multilayer Resilience %X In this work we optimize administrative link costs of IP networks in such a way that the maximum utilization of all links is as low as possible for a set of considered failure scenarios (e.g., all single link failures). To that aim, we present the new 'hill hopping' heuristic with three different variants and compare their computation times and the quality of their results. We adapt the objective function of the heuristic to make the link cost settings robust to single link failures, single node failures, and single link or node failures, and compare the results. In particular, we optimize the routing for multilayer networks where unused backup capacity of the link layer can be reused to redirect traffic on the network layer in case of an IP node failure.

2006

1.
Menth, M., Martin, R., Spörlein, U.: Impact of Unprotected Multi-Failures in Resilient SPM-Networks: a Capacity Dimensioning Approach. IEEE Globecom. , San Francisco, CA, USA (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-240, address = {San Francisco, CA, USA}, author = {Menth, Michael and Martin, Rüdiger and Spörlein, Ulrich}, booktitle = {IEEE Globecom}, keywords = {myown sys:hidden:inproceedings}, month = 11, title = {Impact of Unprotected Multi-Failures in Resilient SPM-Networks: a Capacity Dimensioning Approach}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-240 %A Menth, Michael %A Martin, Rüdiger %A Spörlein, Ulrich %B IEEE Globecom %C San Francisco, CA, USA %D 2006 %T Impact of Unprotected Multi-Failures in Resilient SPM-Networks: a Capacity Dimensioning Approach
2.
Menth, M., Martin, R., Spörlein, U.: Network Dimensioning for the Self-Protecting Multipath: A Performance Study. IEEE International Conference on Communications (ICC). , Istanbul, Turkey (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-229, address = {Istanbul, Turkey}, author = {Menth, Michael and Martin, Rüdiger and Spörlein, Ulrich}, booktitle = {IEEE International Conference on Communications (ICC)}, keywords = {myown sys:hidden:inproceedings}, month = 6, title = {Network Dimensioning for the Self-Protecting Multipath: A Performance Study}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-229 %A Menth, Michael %A Martin, Rüdiger %A Spörlein, Ulrich %B IEEE International Conference on Communications (ICC) %C Istanbul, Turkey %D 2006 %T Network Dimensioning for the Self-Protecting Multipath: A Performance Study
3.
Martin, R., Menth, M., Hemmkeppler, M.: Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing. IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS). , San Jose, California, USA (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-227, address = {San Jose, California, USA}, author = {Martin, Rüdiger and Menth, Michael and Hemmkeppler, Michael}, booktitle = {IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS)}, keywords = {myown sys:hidden:inproceedings}, month = 10, title = {Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-227 %A Martin, Rüdiger %A Menth, Michael %A Hemmkeppler, Michael %B IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS) %C San Jose, California, USA %D 2006 %T Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing
4.
Menth, M., Martin, R., Charzinski, J.: Capacity Overprovisioning for Networks with Resilience Requirements. ACM Sigcomm. , Pisa, Italy (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-228, address = {Pisa, Italy}, author = {Menth, Michael and Martin, Rüdiger and Charzinski, Joachim}, booktitle = {ACM Sigcomm}, keywords = {myown sys:hidden:inproceedings}, month = 9, title = {Capacity Overprovisioning for Networks with Resilience Requirements}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-228 %A Menth, Michael %A Martin, Rüdiger %A Charzinski, Joachim %B ACM Sigcomm %C Pisa, Italy %D 2006 %T Capacity Overprovisioning for Networks with Resilience Requirements
5.
Martin, R., Menth, M.: Backup Capacity Requirements for MPLS Fast Reroute. 7. ITG Fachtagung Photonische Netze (VDE). , Leipzig, Germany (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-226, address = {Leipzig, Germany}, author = {Martin, Rüdiger and Menth, Michael}, booktitle = {7. ITG Fachtagung Photonische Netze (VDE)}, keywords = {myown sys:hidden:inproceedings}, month = 4, title = {Backup Capacity Requirements for MPLS Fast Reroute}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-226 %A Martin, Rüdiger %A Menth, Michael %B 7. ITG Fachtagung Photonische Netze (VDE) %C Leipzig, Germany %D 2006 %T Backup Capacity Requirements for MPLS Fast Reroute
6.
Martin, R., Menth, M., Canbolat, K.: Requirements for the One-to-One Backup Option in MPLS Fast Reroute. IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS). , San Jose, California, USA (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-225, address = {San Jose, California, USA}, author = {Martin, Rüdiger and Menth, Michael and Canbolat, Korhan}, booktitle = {IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS)}, keywords = {myown sys:hidden:inproceedings}, month = 10, title = {Requirements for the One-to-One Backup Option in MPLS Fast Reroute}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-225 %A Martin, Rüdiger %A Menth, Michael %A Canbolat, Korhan %B IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS) %C San Jose, California, USA %D 2006 %T Requirements for the One-to-One Backup Option in MPLS Fast Reroute
7.
Martin, R., Menth, M., Canbolat, K.: Requirements for the Facility Backup Option in MPLS Fast Reroute. IEEE High Performance Switching and Routing (HPSR). , Poznań, Poland (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-224, address = {PoznaÅ„, Poland}, author = {Martin, Rüdiger and Menth, Michael and Canbolat, Korhan}, booktitle = {IEEE High Performance Switching and Routing (HPSR)}, keywords = {myown sys:hidden:inproceedings}, month = 6, title = {Requirements for the Facility Backup Option in MPLS Fast Reroute}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-224 %A Martin, Rüdiger %A Menth, Michael %A Canbolat, Korhan %B IEEE High Performance Switching and Routing (HPSR) %C PoznaÅ„, Poland %D 2006 %T Requirements for the Facility Backup Option in MPLS Fast Reroute
8.
Menth, M., Martin, R., Charzinski, J.: Capacity Overprovisioning for Networks with Resilience Requirements. ACM SIGCOMM Computer Communication Review (CCR). 36(4), (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@article{info3-article-2006-48, author = {Menth, Michael and Martin, Rüdiger and Charzinski, Joachim}, journal = {ACM SIGCOMM Computer Communication Review (CCR)}, keywords = {myown sys:hidden:article}, month = 10, title = {Capacity Overprovisioning for Networks with Resilience Requirements}, volume = {36(4)}, year = 2006 }
%0 Journal Article %1 info3-article-2006-48 %A Menth, Michael %A Martin, Rüdiger %A Charzinski, Joachim %D 2006 %J ACM SIGCOMM Computer Communication Review (CCR) %T Capacity Overprovisioning for Networks with Resilience Requirements %V 36(4)
9.
Milbrandt, J., Martin, R., Menth, M., Höhn, F.: Risk Assessment of End-to-End Disconnection in IP Networks due to Network Failures. 6th IEEE International Workshop on IP Operations and Management (IPOM). , Dublin, Ireland (2006).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2006-247, address = {Dublin, Ireland}, author = {Milbrandt, Jens and Martin, Rüdiger and Menth, Michael and Höhn, Florian}, booktitle = {6th IEEE International Workshop on IP Operations and Management (IPOM)}, keywords = {myown sys:hidden:inproceedings}, month = 10, title = {Risk Assessment of End-to-End Disconnection in IP Networks due to Network Failures}, year = 2006 }
%0 Conference Paper %1 info3-inproceedings-2006-247 %A Milbrandt, Jens %A Martin, Rüdiger %A Menth, Michael %A Höhn, Florian %B 6th IEEE International Workshop on IP Operations and Management (IPOM) %C Dublin, Ireland %D 2006 %T Risk Assessment of End-to-End Disconnection in IP Networks due to Network Failures
10.
Menth, M., Martin, R.: Service differentiation with MEDF scheduling in TCP/IP networks. Computer Communications Journal. Volume 29, Issue 7, (2006).
[ BibTeX ] [ EndNote ]
 
@article{info3-article-2006-38, author = {Menth, Michael and Martin, Rüdiger}, journal = {Computer Communications Journal}, keywords = {myown sys:hidden:article}, month = 4, title = {Service differentiation with MEDF scheduling in TCP/IP networks}, volume = {Volume 29, Issue 7}, year = 2006 }
%0 Journal Article %1 info3-article-2006-38 %A Menth, Michael %A Martin, Rüdiger %D 2006 %J Computer Communications Journal %T Service differentiation with MEDF scheduling in TCP/IP networks %V Volume 29, Issue 7
11.
Tran-Gia, P., Martin, R., Hoßfeld, T.: Visions of Future Internet. , Datev Trendscout, Nürnberg (2006).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2006-220, address = {Datev Trendscout, Nürnberg}, author = {Tran-Gia, Phuoc and Martin, Rüdiger and Hoßfeld, Tobias}, keywords = {myown sys:hidden:presentation}, month = 7, title = {Visions of Future Internet}, year = 2006 }
%0 Generic %1 info3-talk-2006-220 %A Tran-Gia, Phuoc %A Martin, Rüdiger %A Hoßfeld, Tobias %C Datev Trendscout, Nürnberg %D 2006 %T Visions of Future Internet
12.
Martin, R.: Requirements for the Facility Backup Option in MPLS Fast Reroute. , IEEE High Performance Switching and Routing (HPSR), Poznań, Poland (2006).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2006-206, address = {IEEE High Performance Switching and Routing (HPSR), PoznaÅ„, Poland}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 6, title = {Requirements for the Facility Backup Option in MPLS Fast Reroute}, year = 2006 }
%0 Generic %1 info3-talk-2006-206 %A Martin, Rüdiger %C IEEE High Performance Switching and Routing (HPSR), PoznaÅ„, Poland %D 2006 %T Requirements for the Facility Backup Option in MPLS Fast Reroute
13.
Martin, R.: Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing. , IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS), San Jose, California, USA (2006).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2006-208, address = {IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS), San Jose, California, USA}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 10, title = {Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing}, year = 2006 }
%0 Generic %1 info3-talk-2006-208 %A Martin, Rüdiger %C IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS), San Jose, California, USA %D 2006 %T Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing
14.
Martin, R.: Requirements for the One-to-One Backup Option in MPLS Fast Reroute. , IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS), San Jose, California, USA (2006).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2006-211, address = {IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS), San Jose, California, USA}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 10, title = {Requirements for the One-to-One Backup Option in MPLS Fast Reroute}, year = 2006 }
%0 Generic %1 info3-talk-2006-211 %A Martin, Rüdiger %C IEEE International Conference on Broadband Communication, Networks, and Systems (BROADNETS), San Jose, California, USA %D 2006 %T Requirements for the One-to-One Backup Option in MPLS Fast Reroute
15.
Martin, R.: Network Dimensioning for the Self-Protecting Multipath: A Performance Study. , IEEE International Conference on Communications (ICC), Istanbul, Turkey (2006).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2006-205, address = {IEEE International Conference on Communications (ICC), Istanbul, Turkey}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 6, title = {Network Dimensioning for the Self-Protecting Multipath: A Performance Study}, year = 2006 }
%0 Generic %1 info3-talk-2006-205 %A Martin, Rüdiger %C IEEE International Conference on Communications (ICC), Istanbul, Turkey %D 2006 %T Network Dimensioning for the Self-Protecting Multipath: A Performance Study

2005

1.
Martin, R., Menth, M., Charzinski, J.: Comparison of Link-by-Link Admission Control and Capacity Overprovisioning. University of Wuerzburg (2005).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2005-233, author = {Martin, Rüdiger and Menth, Michael and Charzinski, Joachim}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 5, number = 360, title = {Comparison of Link-by-Link Admission Control and Capacity Overprovisioning}, year = 2005 }
%0 Report %1 info3-techreport-2005-233 %A Martin, Rüdiger %A Menth, Michael %A Charzinski, Joachim %D 2005 %N 360 %T Comparison of Link-by-Link Admission Control and Capacity Overprovisioning
2.
Menth, M., Martin, R.: Network Resilience through Multi-Topology Routing. The 5th International Workshop on Design of Reliable Communication Networks (DRCN). , Ischia, Italy (2005).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2005-203, address = {Ischia, Italy}, author = {Menth, Michael and Martin, Rüdiger}, booktitle = {The 5th International Workshop on Design of Reliable Communication Networks (DRCN)}, keywords = {myown sys:hidden:inproceedings}, month = 10, title = {Network Resilience through Multi-Topology Routing}, year = 2005 }
%0 Conference Paper %1 info3-inproceedings-2005-203 %A Menth, Michael %A Martin, Rüdiger %B The 5th International Workshop on Design of Reliable Communication Networks (DRCN) %C Ischia, Italy %D 2005 %T Network Resilience through Multi-Topology Routing
3.
Martin, R.: Comparison of Link-by-Link Admission Control and Capacity Overprovisioning. , 19th International Teletraffic Congress (ITC19), Beijing, China (2005).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2005-203, address = {19th International Teletraffic Congress (ITC19), Beijing, China}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 8, title = {Comparison of Link-by-Link Admission Control and Capacity Overprovisioning}, year = 2005 }
%0 Generic %1 info3-talk-2005-203 %A Martin, Rüdiger %C 19th International Teletraffic Congress (ITC19), Beijing, China %D 2005 %T Comparison of Link-by-Link Admission Control and Capacity Overprovisioning
4.
Martin, R., Menth, M., Charzinski, J.: Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning. University of Wuerzburg (2005).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2005-232, author = {Martin, Rüdiger and Menth, Michael and Charzinski, Joachim}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 5, number = 359, title = {Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning}, year = 2005 }
%0 Report %1 info3-techreport-2005-232 %A Martin, Rüdiger %A Menth, Michael %A Charzinski, Joachim %D 2005 %N 359 %T Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning
5.
Martin, R.: Network Resilience through Multi-Topology Routing. , The 5th International Workshop on Design of Reliable Communication Networks (DRCN), Ischia, Italy (2005).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2005-204, address = {The 5th International Workshop on Design of Reliable Communication Networks (DRCN), Ischia, Italy}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 10, title = {Network Resilience through Multi-Topology Routing}, year = 2005 }
%0 Generic %1 info3-talk-2005-204 %A Martin, Rüdiger %C The 5th International Workshop on Design of Reliable Communication Networks (DRCN), Ischia, Italy %D 2005 %T Network Resilience through Multi-Topology Routing
6.
Martin, R., Menth, M., Charzinski, J.: Comparison of Link-by-Link Admission Control and Capacity Overprovisioning. 19th International Teletraffic Congress (ITC19). , Beijing, China (2005).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2005-190, address = {Beijing, China}, author = {Martin, Rüdiger and Menth, Michael and Charzinski, Joachim}, booktitle = {19th International Teletraffic Congress (ITC19)}, keywords = {myown sys:hidden:inproceedings}, month = 8, title = {Comparison of Link-by-Link Admission Control and Capacity Overprovisioning}, year = 2005 }
%0 Conference Paper %1 info3-inproceedings-2005-190 %A Martin, Rüdiger %A Menth, Michael %A Charzinski, Joachim %B 19th International Teletraffic Congress (ITC19) %C Beijing, China %D 2005 %T Comparison of Link-by-Link Admission Control and Capacity Overprovisioning
7.
Martin, R., Menth, M., Charzinski, J.: Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning. 4th International IFIP-TC6 Networking Conference. pp. 1056–1068. , Waterloo, Canada (2005).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2005-189, address = {Waterloo, Canada}, author = {Martin, Rüdiger and Menth, Michael and Charzinski, Joachim}, booktitle = {4th International IFIP-TC6 Networking Conference}, keywords = {myown sys:hidden:inproceedings}, month = 5, pages = {1056-1068}, title = {Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning}, year = 2005 }
%0 Conference Paper %1 info3-inproceedings-2005-189 %A Martin, Rüdiger %A Menth, Michael %A Charzinski, Joachim %B 4th International IFIP-TC6 Networking Conference %C Waterloo, Canada %D 2005 %P 1056-1068 %T Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning
8.
Martin, R.: Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning. , 4th International IFIP-TC6 Networking Conference, Waterloo, Canada (2005).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2005-202, address = {4th International IFIP-TC6 Networking Conference, Waterloo, Canada}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 5, title = {Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning}, year = 2005 }
%0 Generic %1 info3-talk-2005-202 %A Martin, Rüdiger %C 4th International IFIP-TC6 Networking Conference, Waterloo, Canada %D 2005 %T Comparison of Border-to-Border Budget Based Network Admission Control and Capacity Overprovisioning

2004

1.
Martin, R., Menth, M., Phan-Gia, V.: Performance of TCP/IP with MEDF Scheduling. University of Wuerzburg (2004).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2004-150, author = {Martin, Rüdiger and Menth, Michael and Phan-Gia, Vu}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 2, number = 323, title = {Performance of TCP/IP with MEDF Scheduling}, year = 2004 }
%0 Report %1 info3-techreport-2004-150 %A Martin, Rüdiger %A Menth, Michael %A Phan-Gia, Vu %D 2004 %N 323 %T Performance of TCP/IP with MEDF Scheduling
2.
Martin, R.: Improving the Timeliness of Rate Measurements. , 12th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB) together with 3rd Polish-German Teletraffic Symposium (PGTS), Dresden, Germany (2004).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2004-175, address = {12th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB) together with 3rd Polish-German Teletraffic Symposium (PGTS), Dresden, Germany}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 9, title = {Improving the Timeliness of Rate Measurements}, year = 2004 }
%0 Generic %1 info3-talk-2004-175 %A Martin, Rüdiger %C 12th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB) together with 3rd Polish-German Teletraffic Symposium (PGTS), Dresden, Germany %D 2004 %T Improving the Timeliness of Rate Measurements
3.
Martin, R., Tutschku, K.: Web Site Performance Analysis: Analytical Models, (2004).
[ BibTeX ] [ EndNote ]
 
@misc{info3-poster-2004-3, author = {Martin, Rüdiger and Tutschku, Kurt}, booktitle = {DATEV}, keywords = {myown sys:hidden:poster}, title = {Web Site Performance Analysis: Analytical Models}, year = 2004 }
%0 Generic %1 info3-poster-2004-3 %A Martin, Rüdiger %A Tutschku, Kurt %B DATEV %D 2004 %T Web Site Performance Analysis: Analytical Models
4.
Martin, R., Menth, M., Phan-Gia, V.: Performance of TCP/IP with MEDF Scheduling. Fifth International Workshop on Quality of Future Internet Services. , Barcelona, Spain (2004).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2004-149, address = {Barcelona, Spain}, author = {Martin, Rüdiger and Menth, Michael and Phan-Gia, Vu}, booktitle = {Fifth International Workshop on Quality of Future Internet Services}, keywords = {myown sys:hidden:inproceedings}, month = 9, title = {Performance of TCP/IP with MEDF Scheduling}, year = 2004 }
%0 Conference Paper %1 info3-inproceedings-2004-149 %A Martin, Rüdiger %A Menth, Michael %A Phan-Gia, Vu %B Fifth International Workshop on Quality of Future Internet Services %C Barcelona, Spain %D 2004 %T Performance of TCP/IP with MEDF Scheduling
5.
Martin, R., Menth, M.: Improving the Timeliness of Rate Measurements. 12th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB) together with 3rd Polish-German Teletraffic Symposium (PGTS). , Dresden, Germany (2004).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2004-145, address = {Dresden, Germany}, author = {Martin, Rüdiger and Menth, Michael}, booktitle = {12th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB) together with 3rd Polish-German Teletraffic Symposium (PGTS)}, keywords = {myown sys:hidden:inproceedings}, month = 9, title = {Improving the Timeliness of Rate Measurements}, year = 2004 }
%0 Conference Paper %1 info3-inproceedings-2004-145 %A Martin, Rüdiger %A Menth, Michael %B 12th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems (MMB) together with 3rd Polish-German Teletraffic Symposium (PGTS) %C Dresden, Germany %D 2004 %T Improving the Timeliness of Rate Measurements
6.
Martin, R.: Performance of TCP/IP with MEDF Scheduling. , Fifth International Workshop on Quality of Future Internet Services, Barcelona, Spain (2004).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2004-174, address = {Fifth International Workshop on Quality of Future Internet Services, Barcelona, Spain}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 9, title = {Performance of TCP/IP with MEDF Scheduling}, year = 2004 }
%0 Generic %1 info3-talk-2004-174 %A Martin, Rüdiger %C Fifth International Workshop on Quality of Future Internet Services, Barcelona, Spain %D 2004 %T Performance of TCP/IP with MEDF Scheduling
7.
Martin, R.: Web Site Performance Analysis: Analytical Models and Applications. , ITG FG521 Workshop Hamburg, Germany (2004).
[ BibTeX ] [ EndNote ]
 
@presentation{info3-talk-2004-5, address = {ITG FG521 Workshop Hamburg, Germany}, author = {Martin, Rüdiger}, keywords = {myown sys:hidden:presentation}, month = 2, title = {Web Site Performance Analysis: Analytical Models and Applications}, year = 2004 }
%0 Generic %1 info3-talk-2004-5 %A Martin, Rüdiger %C ITG FG521 Workshop Hamburg, Germany %D 2004 %T Web Site Performance Analysis: Analytical Models and Applications
8.
Menth, M., Martin, R.: Network Resilience through Multi-Topology Routing. University of Wuerzburg (2004).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2004-159, author = {Menth, Michael and Martin, Rüdiger}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 5, number = 335, title = {Network Resilience through Multi-Topology Routing}, year = 2004 }
%0 Report %1 info3-techreport-2004-159 %A Menth, Michael %A Martin, Rüdiger %D 2004 %N 335 %T Network Resilience through Multi-Topology Routing
9.
Martin, R., Menth, M.: Improving the Timeliness of Rate Measurements. University of Wuerzburg (2004).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2004-154, author = {Martin, Rüdiger and Menth, Michael}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 4, number = 331, title = {Improving the Timeliness of Rate Measurements}, year = 2004 }
%0 Report %1 info3-techreport-2004-154 %A Martin, Rüdiger %A Menth, Michael %D 2004 %N 331 %T Improving the Timeliness of Rate Measurements
10.
Menth, M., Martin, R., Schmid, M.: Modified Earliest Deadline First (MEDF): A Simple Scheduling Algorithm for Different Priority Classes, (2004).
[ BibTeX ] [ EndNote ]
 
@misc{info3-poster-2004-12, author = {Menth, Michael and Martin, Rüdiger and Schmid, Matthias}, booktitle = {KING}, keywords = {myown sys:hidden:poster}, title = {Modified Earliest Deadline First (MEDF): A Simple Scheduling Algorithm for Different Priority Classes}, year = 2004 }
%0 Generic %1 info3-poster-2004-12 %A Menth, Michael %A Martin, Rüdiger %A Schmid, Matthias %B KING %D 2004 %T Modified Earliest Deadline First (MEDF): A Simple Scheduling Algorithm for Different Priority Classes

2002

1.
Menth, M., Martin, R.: Performance Evaluation of the Extensions for Control Message Retransmissions in RSVP. 7th International Workshop on Protocols For High-Speed Networks (PfHSN 2002). pp. 35–49. , Berlin, Germany (2002).
[ BibTeX ] [ EndNote ] [ Download ]
 
@inproceedings{info3-inproceedings-2002-51, address = {Berlin, Germany}, author = {Menth, Michael and Martin, Rüdiger}, booktitle = {7th International Workshop on Protocols For High-Speed Networks (PfHSN 2002)}, keywords = {myown sys:hidden:inproceedings}, pages = {35 - 49}, title = {Performance Evaluation of the Extensions for Control Message Retransmissions in RSVP}, year = 2002 }
%0 Conference Paper %1 info3-inproceedings-2002-51 %A Menth, Michael %A Martin, Rüdiger %B 7th International Workshop on Protocols For High-Speed Networks (PfHSN 2002) %C Berlin, Germany %D 2002 %P 35 - 49 %T Performance Evaluation of the Extensions for Control Message Retransmissions in RSVP

2001

1.
Martin, R., Menth, M.: Performance Evaluation of the Extensions for Control Message Retransmissions in RSVP. University of Wuerzburg (2001).
[ BibTeX ] [ EndNote ] [ Download ]
 
@techreport{info3-techreport-2001-51, author = {Martin, Rüdiger and Menth, Michael}, institution = {University of Wuerzburg}, keywords = {myown sys:hidden:techreport}, month = 11, number = 288, title = {Performance Evaluation of the Extensions for Control Message Retransmissions in RSVP}, year = 2001 }
%0 Report %1 info3-techreport-2001-51 %A Martin, Rüdiger %A Menth, Michael %D 2001 %N 288 %T Performance Evaluation of the Extensions for Control Message Retransmissions in RSVP