Change search
Link to record
Permanent link

Direct link
Fransson, Pierre
Publications (8 of 8) Show all publications
Fransson, P. & Carr-Motyckova, L. (2007). Loop-free link-state routing (ed.). In: (Ed.), Proceedings: 16th International Conference on Computer Communications and Networks : Honolulu, Hawaii, 13 - 16 August 2007. Paper presented at International Conference on Computer Communications and Networks : 13/08/2007 - 16/08/2007 (pp. 905-911). Piscataway, NJ: IEEE Communications Society
Open this publication in new window or tab >>Loop-free link-state routing
2007 (English)In: Proceedings: 16th International Conference on Computer Communications and Networks : Honolulu, Hawaii, 13 - 16 August 2007, Piscataway, NJ: IEEE Communications Society, 2007, p. 905-911Conference paper, Published paper (Refereed)
Abstract [en]

Improving the robustness of today's intra-domain link-state networks is of increasing importance. This is because it is becoming commonplace for such networks to carry telephony, on-demand video and other kinds of real-time traffic. Since user requirements on real-time traffic are exacting, it is essential that the network is able to respond rapidly to network errors. A way of reaching fast reaction times in response to network errors is to precompute fail-over paths that can be utilized immediately when an error is detected. The fail-over path is thereafter in use until the network has converged, handling traffic that would otherwise have been lost due to the error. During convergence (when new paths are calculated) there is a caveat that needs to be avoided -the formation of temporary loops. Temporary loops can form naturally during convergence in link-state networks and can unfortunately prevent traffic from reaching a fail-over path. Traffic can therefore be lost even though a fail-over path is in place. We present an algorithm that can be used in conjunction with link-state routing, to ensure that temporary loops do not form during convergence. The algorithm improves on previous loop-free algorithms for link-state routing by reducing the number of state transitions necessary before a router can update its routing table to a new, guaranteed to exist, path for a wide variety of topological configurations.

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Communications Society, 2007
Series
International Conference on Computer Communications and Networks. Proceedings, ISSN 1095-2055
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-31509 (URN)10.1109/ICCCN.2007.4317933 (DOI)2-s2.0-40949164799 (Scopus ID)5b41b780-80bd-11dc-965a-000ea68e967b (Local ID)1-424-41250-1 (ISBN)5b41b780-80bd-11dc-965a-000ea68e967b (Archive number)5b41b780-80bd-11dc-965a-000ea68e967b (OAI)
Conference
International Conference on Computer Communications and Networks : 13/08/2007 - 16/08/2007
Note

Validerad; 2007; 20071022 (ysko)

Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2020-08-26Bibliographically approved
Sehlstedt, M., Leblanc, J., Fransson, P., Jonsson, A., Schelén, O. & Forchheimer, R. (2005). Transparent cross-layer rate adaption of progressive multimedia streams for wired and wireless networks (ed.). Luleå: Luleå tekniska universitet
Open this publication in new window or tab >>Transparent cross-layer rate adaption of progressive multimedia streams for wired and wireless networks
Show others...
2005 (English)Report (Other academic)
Abstract [en]

Real-time multimedia transfer through the Internet becomes more difficult when wireless links are in the path, due to the time varying channel capacity, from interference and multipath fading effects which introduce additional stochastic variations beyond the wireline network traffic effects. These wireless variations create problems for existing end-to-end rate adaption using feedback. This paper introduces a framework for cross-layer solutions to the streaming video problem with a focus on graceful degradation under network congestion and/or wireless fading effects without direct coordination between source coder, channel coder, and physical layer modulator. The solution presented includes network transportation and wireless based optimizations and requires little reliance upon end-to-end rate adaption. The suggested method uses progressively coded, leaky prediction source data and physical layer based rate adaption in concert with error tolerant network protocols.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2005. p. 22
Series
Research report / Luleå University of Technology, ISSN 1402-1528 ; 2005:09
National Category
Signal Processing Computer Sciences
Research subject
Signal Processing; Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-24527 (URN)b5614090-b2a1-11db-bf9d-000ea68e967b (Local ID)b5614090-b2a1-11db-bf9d-000ea68e967b (Archive number)b5614090-b2a1-11db-bf9d-000ea68e967b (OAI)
Note
Godkänd; 2005; 20070202 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2025-10-21Bibliographically approved
Fransson, P. & Carr-Motyckova, L. (2004). An incremental algorithm for calculation of backup-paths in link-state networks: Brief announcement (ed.). In: (Ed.), (Ed.), Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing: . Paper presented at Annual ACM symposium on Principles of distributed computing : 25/07/2004 - 28/07/2004 (pp. 381). : IEEE Communications Society
Open this publication in new window or tab >>An incremental algorithm for calculation of backup-paths in link-state networks: Brief announcement
2004 (English)In: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, IEEE Communications Society, 2004, p. 381-Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
IEEE Communications Society, 2004
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-34428 (URN)10.1145/1011767.1011840 (DOI)8a13f2c0-86b4-11db-8975-000ea68e967b (Local ID)1-58113-802-4 (ISBN)8a13f2c0-86b4-11db-8975-000ea68e967b (Archive number)8a13f2c0-86b4-11db-8975-000ea68e967b (OAI)
Conference
Annual ACM symposium on Principles of distributed computing : 25/07/2004 - 28/07/2004
Note
Godkänd; 2004; 20061127 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2025-10-22Bibliographically approved
Fransson, P. & Jonsson, A. (2004). End-to-end measurements on performance penalties of IPv4 options (ed.). Luleå: Luleå tekniska universitet
Open this publication in new window or tab >>End-to-end measurements on performance penalties of IPv4 options
2004 (English)Report (Other academic)
Abstract [en]

IP version 4 specifies options that extends the basic IP header and also allow new functions to be added to IP without breaking existing implementations. Since options must always be inspected routers, it is generally believed that routers prioritize ordinary packets over packets carrying options in a way that significantly impacts the performance of options. This article presents an experiment based on end-to-end probing using UDP packets, capturing the performance penalties associated with IPv4 options. Analysis of experiment results quantifies the impact of IPv4 options on forwarding performance in terms of delay, jitter and loss rate. From the analysis it can be concluded that there is a slight increase in delay and jitter and severely increased loss rate.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2004. p. 15
Series
Technical report / Luleå University of Technology, ISSN 1402-1536 ; 2004:03
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-24296 (URN)a6159e60-a4db-11dc-8fee-000ea68e967b (Local ID)a6159e60-a4db-11dc-8fee-000ea68e967b (Archive number)a6159e60-a4db-11dc-8fee-000ea68e967b (OAI)
Note
Godkänd; 2004; 20071207 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2025-10-21Bibliographically approved
Fransson, P. & Jonsson, A. (2004). End-to-end measurements on performance penalties of IPv4 options (ed.). In: (Ed.), 2004 IEEE Global Telecommunications Conference workshops: 29 November - 3 December 2004, Dallas, Texas. Paper presented at IEEE Global Telecommunications Conference : 29/11/2004 - 03/12/2004 (pp. 1441-1447). IEEE Communications Society, Vol. 4
Open this publication in new window or tab >>End-to-end measurements on performance penalties of IPv4 options
2004 (English)In: 2004 IEEE Global Telecommunications Conference workshops: 29 November - 3 December 2004, Dallas, Texas, IEEE Communications Society, 2004, Vol. Vol. 4, p. 1441-1447Conference paper, Published paper (Refereed)
Abstract [en]

IP version 4 specifies options that extend the basic IP header and also allow new functions to be added to IP without breaking existing implementations. Since options must always be inspected at routers, it is generally believed that routers prioritize ordinary packets over packets carrying options in a way that significantly impacts the performance of options. This article presents an experiment based on end-to-end probing using UDP packets, capturing the performance penalties associated with IPv4 options. Analysis of experiment results quantifies the impact of IPv4 options on forwarding performance in terms of delay, jitter and loss rate. From the analysis it can be concluded that there is a slight increase in delay and jitter and a severe increase in loss rate

Place, publisher, year, edition, pages
IEEE Communications Society, 2004
Identifiers
urn:nbn:se:ltu:diva-29343 (URN)10.1109/GLOCOM.2004.1378221 (DOI)000226689900270 ()2-s2.0-18144426039 (Scopus ID)2cb4b860-1d4e-11df-be83-000ea68e967b (Local ID)0-7803-8798-8 (ISBN)2cb4b860-1d4e-11df-be83-000ea68e967b (Archive number)2cb4b860-1d4e-11df-be83-000ea68e967b (OAI)
Conference
IEEE Global Telecommunications Conference : 29/11/2004 - 03/12/2004
Note

Godkänd; 2004; 20100219 (andbra)

Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2026-05-27Bibliographically approved
Carr-Motyckova, L. & Fransson, P. (2003). An Incremental Algorithm for Calculation of Backup Routes in Link-State Networks (ed.). In: (Ed.), (Ed.), Swedish National Computer Networking Workshop - Proceedings: SNCNW 2003. Paper presented at Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003. Stockholm
Open this publication in new window or tab >>An Incremental Algorithm for Calculation of Backup Routes in Link-State Networks
2003 (English)In: Swedish National Computer Networking Workshop - Proceedings: SNCNW 2003, Stockholm, 2003Conference paper, Published paper (Other academic)
Place, publisher, year, edition, pages
Stockholm: , 2003
Identifiers
urn:nbn:se:ltu:diva-38793 (URN)d4ba9a90-9810-11dc-8ccb-000ea68e967b (Local ID)d4ba9a90-9810-11dc-8ccb-000ea68e967b (Archive number)d4ba9a90-9810-11dc-8ccb-000ea68e967b (OAI)
Conference
Swedish National Computer Networking Workshop : 01/09/2003 - 02/09/2003
Note
Godkänd; 2003; 20071121 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2025-10-22Bibliographically approved
Fransson, P. (2003). Improving network layer reaction times (ed.). (Licentiate dissertation). Luleå: Luleå tekniska universitet
Open this publication in new window or tab >>Improving network layer reaction times
2003 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis presents two proposals for improving network layer reaction times and an investigation into the consequences of using IPv4 options. The first proposal, the Selective TRuncating Internetworking Protocol (STRIP), is an augmentation of the IP networking layer. The idea behind STRIP is to expose information related to layered media at the networking layer. Media streams that are divided into different layers (where one layer provides the most basic quality and additional layers provide incremental enhancements to the quality of the media) are placed in the same networking layer protocol data unit (PDU) for transport across the network. Each layer in the PDU is implicitly assigned a priority level, indicating its importance to the media stream. Intermediate routers, on the path of the media stream, can use the exposed layering information to drop parts of the PDU (thereby dropping layers) in response to short term congestion, instead of having to discard an entire packet. By enabling routers to take action as soon as congestion is detected, fast reaction times are made possible. Links with variable throughput, e.g., wireless links, are locations where it is especially desirable to be able to react to short term congestion. The proposal also presents how STRIP could be realized in todays Internet by using IPv4 options. The second proposal is an algorithm that is capable of calculating all backup-paths that are available by simply forwarding packets to directly connected neighbors in the case that a directly connected neighbor fails. The algorithm allows backup-paths to be calculated in advance, which can be used as soon as a router failure is detected. Providing that the failure detection mechanism is fast, router failures can be circumvented very rapidly. The algorithm is compared to a brute force approach and shown to be an order of magnitude faster for the most common network topologies. The investigation of IPv4 options focuses on the implications of their use to implement networking proposals. A widely held belief in the Internet community is that the use of IPv4 options can result in increased loss rates, delays and jitter. Because of the severe implications of this supposition and because there did not seem to exist any actual measurements confirming the claim, it was decided that an investigation should be performed. The result of the investigation shows that packets carrying IP options are indeed subjected to an increase in loss rates, delays and jitter, compared to packets without options. The increase in delay and in jitter are, however, probably not so severe as to rule out the use of options. Unfortunately, the increase in loss rates were found to be very high, definitely raising concerns on the appropriateness of using IPv4 options in networking proposals.

Place, publisher, year, edition, pages
Luleå: Luleå tekniska universitet, 2003. p. 70
Series
Licentiate thesis / Luleå University of Technology, ISSN 1402-1757 ; 2003:48
Identifiers
urn:nbn:se:ltu:diva-18620 (URN)97dd3800-bd12-11db-9be7-000ea68e967b (Local ID)97dd3800-bd12-11db-9be7-000ea68e967b (Archive number)97dd3800-bd12-11db-9be7-000ea68e967b (OAI)
Note
Godkänd; 2003; 20070215 (ysko)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2025-10-21Bibliographically approved
Engan, M., Fransson, P. & Schelén, O. (2000). Selective truncating internetwork protocol: experiments with explicit framing (ed.). In: (Ed.), Ton Engbersen (Ed.), Proceedings: Ninth International Conference on Computer Communications and Networks : 16 - 18 October 2000, Las Vegas, Nevada. Paper presented at International Conference on Computer Communications and Networks : 16/10/2000 - 18/10/2000 (pp. 220-224). Piscataway, NJ: IEEE Communications Society
Open this publication in new window or tab >>Selective truncating internetwork protocol: experiments with explicit framing
2000 (English)In: Proceedings: Ninth International Conference on Computer Communications and Networks : 16 - 18 October 2000, Las Vegas, Nevada / [ed] Ton Engbersen, Piscataway, NJ: IEEE Communications Society, 2000, p. 220-224Conference paper, Published paper (Refereed)
Abstract [en]

Many emerging real-time applications generate layered data streams, which can be used effectively to adapt multicast real-time transmissions to heterogeneous bandwidth environments. However, these applications have not changed with regard to being sensitive to transient congestion and cannot wait a full round-trip time for sender-initiated adaptation. In this paper we propose the selective truncating internetwork protocol (STRIP) supporting layered data transfer, and capable of handling congestion at a finer level of granularity by truncating packets, i.e., stripping off less important data. STRIP inter-operates with the traditional IP infrastructure and can be introduced in a step-by-step fashion, starting where the benefits are obvious, for example with routers which are connected to bandwidth constrained links and which have a surplus of processing capacity. We describe the design and architecture of STRIP and compare it with solutions for differentiated forwarding on a per-packet basis. STRIP provides a simple mechanism that can meet the demands for real-time flows effectively by supporting low delay forwarding, avoiding data-unit reordering, and supporting various drop priorities at the same time

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Communications Society, 2000
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
urn:nbn:se:ltu:diva-40616 (URN)10.1109/ICCCN.2000.885494 (DOI)000166793500033 ()2-s2.0-84908352154 (Scopus ID)fce80a90-fbff-11dc-a946-000ea68e967b (Local ID)0-7803-6494-5 (ISBN)fce80a90-fbff-11dc-a946-000ea68e967b (Archive number)fce80a90-fbff-11dc-a946-000ea68e967b (OAI)
Conference
International Conference on Computer Communications and Networks : 16/10/2000 - 18/10/2000
Note
Godkänd; 2000; 20080327 (ysko)Available from: 2016-10-03 Created: 2016-10-03 Last updated: 2025-10-22Bibliographically approved
Organisations

Search in DiVA

Show all publications