The Experts below are selected from a list of 1368 Experts worldwide ranked by ideXlab platform

Jens-peter Dittrich - One of the best experts on this subject based on the ideXlab platform.

  • www.dbis.ethz.ch
    2014
    Co-Authors: Jens-peter Dittrich, Peter M. Fischer, Donald Kossmann
    Abstract:

    Information filtering has become a key technology for modern Information systems. The goal of an Information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out Stateful Information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small. 1

  • Agile: Adaptive indexing for context-aware Information filters
    2005
    Co-Authors: Jens-peter Dittrich, Peter M. Fischer, Donald Kossmann
    Abstract:

    www.dbis.ethz.ch Information filtering has become a key technology for mo-dern Information systems. The goal of an Information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out Stateful Information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small. 1

  • Agile: Adaptive indexing for context-aware Information filters
    2005
    Co-Authors: Jens-peter Dittrich
    Abstract:

    Information filtering has become a key technology for modern Information systems. The goal of an Information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out Stateful Information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small. 1

Donald Kossmann - One of the best experts on this subject based on the ideXlab platform.

  • www.dbis.ethz.ch
    2014
    Co-Authors: Jens-peter Dittrich, Peter M. Fischer, Donald Kossmann
    Abstract:

    Information filtering has become a key technology for modern Information systems. The goal of an Information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out Stateful Information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small. 1

  • Agile: Adaptive indexing for context-aware Information filters
    2005
    Co-Authors: Jens-peter Dittrich, Peter M. Fischer, Donald Kossmann
    Abstract:

    www.dbis.ethz.ch Information filtering has become a key technology for mo-dern Information systems. The goal of an Information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out Stateful Information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small. 1

Peter M. Fischer - One of the best experts on this subject based on the ideXlab platform.

  • www.dbis.ethz.ch
    2014
    Co-Authors: Jens-peter Dittrich, Peter M. Fischer, Donald Kossmann
    Abstract:

    Information filtering has become a key technology for modern Information systems. The goal of an Information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out Stateful Information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small. 1

  • Agile: Adaptive indexing for context-aware Information filters
    2005
    Co-Authors: Jens-peter Dittrich, Peter M. Fischer, Donald Kossmann
    Abstract:

    www.dbis.ethz.ch Information filtering has become a key technology for mo-dern Information systems. The goal of an Information filter is to route messages to the right recipients (possibly none) according to declarative rules called profiles. In order to deal with high volumes of messages, several index structures have been proposed in the past. The challenge addressed in this paper is to carry out Stateful Information filtering in which profiles refer to values in a database or to previous messages. The difficulty is that database update streams need to be processed in addition to messages. This paper presents AGILE, a way to extend existing index structures so that the indexes adapt to the message/update workload and show good performance in all situations. Performance experiments show that AGILE is overall the clear winner as compared to the best existing approaches. In extreme situations in which it is not the winner, the overheads are small. 1

Ehoud Ahronovitz - One of the best experts on this subject based on the ideXlab platform.

  • Dynamic detection and resolution of BGP oscillations
    2015
    Co-Authors: Ehoud Ahronovitz, Jean-claude K ¨onig
    Abstract:

    Autonomous Systems (AS) in the Internet use different protocols for internal and external routing. BGP is the only external protocol. It allows ASes to define their own routing policy independently. Many papers cited in reference deal with a divergence behavior due to this flexibility. In fact, when routing policies are not conflicting, BGP is self-stabilising, which means that whatever network config-uration, BGP converges to a stable solution. Unfortunately, as experienced on the Internet, AS routing policies may be uncoherent, thus generating oscillations. In this paper we propose a distributed dy-namic method for detecting and solving oscillations of BGP. It respects private policy choices and requires only a few low level constraints in order to converge to a stable solution. Essentially, a router has to maintain only local path Stateful Information to detect instabilities. In this case, it generates and launches a token linked to a route. Each router makes the decision to forward or not the token accord-ing to local data and local policy. If the originating router receives back the token, then it marks the route as barred. Nevertheless, routes may furtherly be unmarked. Finally, we express and define what coherence between routing policies means.

  • A Distributed Method for Dynamic Resolution of BGP Oscillations
    2006
    Co-Authors: Ehoud Ahronovitz, Jean-claude König, Clément Saad
    Abstract:

    Autonomous Systems (AS) in the Internet use different protocols for internal and external routing. BGP is the only external protocol. It allows ASes to define their own routing policy independently. Many papers cited in reference deal with a divergence behavior due to this flexibility. In fact, when routing policies are not conflicting, BGP is self-stabilising, which means that whatever the network configuration, BGP converges to a stable solution. Unfortunately, as experienced on the Internet, AS routing policies may be uncoherent, thus generating oscillations. In this paper we propose a distributed dynamic method for detecting and solving oscillations of BGP. It respects private policy choices and requires only a few low level constraints in order to converge to a stable solution. Essentially, a router has to maintain only local path Stateful Information to detect instabilities. In this case, it generates and launches a token linked to a route. Each router makes the decision to forward or not the token according to local data and local policy. If the originating router receives back the token, then it marks the route as barred. Nevertheless, routes may furtherly be unmarked. Finally, we express and define what coherence between routing policies means.

Jean-claude K ¨onig - One of the best experts on this subject based on the ideXlab platform.

  • Dynamic detection and resolution of BGP oscillations
    2015
    Co-Authors: Ehoud Ahronovitz, Jean-claude K ¨onig
    Abstract:

    Autonomous Systems (AS) in the Internet use different protocols for internal and external routing. BGP is the only external protocol. It allows ASes to define their own routing policy independently. Many papers cited in reference deal with a divergence behavior due to this flexibility. In fact, when routing policies are not conflicting, BGP is self-stabilising, which means that whatever network config-uration, BGP converges to a stable solution. Unfortunately, as experienced on the Internet, AS routing policies may be uncoherent, thus generating oscillations. In this paper we propose a distributed dy-namic method for detecting and solving oscillations of BGP. It respects private policy choices and requires only a few low level constraints in order to converge to a stable solution. Essentially, a router has to maintain only local path Stateful Information to detect instabilities. In this case, it generates and launches a token linked to a route. Each router makes the decision to forward or not the token accord-ing to local data and local policy. If the originating router receives back the token, then it marks the route as barred. Nevertheless, routes may furtherly be unmarked. Finally, we express and define what coherence between routing policies means.