Deutsche Telekom

About: Deutsche Telekom is a company organization based out in Welwyn Garden City, United Kingdom. It is known for research contribution in the topics: Telecommunications network & Signal. The organization has 3473 authors who have published 5208 publications receiving 65429 citations. The organization is also known as: DTAG & German Telecom.

BFTW3: why? when? where? workshop on the theory and practice of byzantine fault tolerance

Abstract: The first BFTW3 workshop took place in Elche, Spain, on the 22nd of September, just before the 23rd International Symposium on Distributed Computing (DISC).The workshop gathered researchers from both the theory and systems communities and aimed at discussing recent advances and understanding why the impressive research activity in the area of Byzantine fault-tolerance is not yet instantiated in practice. Has the moment for a wide deployment of BFT systems arrived, and if so, where BFT systems should be deployed in the first place?

Antenna management system and program for optimization of broadcast characteristics of an antenna and method for determining physical parameters of an antenna

Abstract: A method for determining physical parameters of an antenna of a mobile network base station includes providing, using the antenna, a mobile radio cell of a mobile network. Cellular parameters of the mobile radio cell are measured using at least one of user equipments and further mobile network base stations. The cellular parameters are transmitted from the at least one of user equipments and further mobile network base stations to an antenna controller. Using the antenna controller, at least one of the physical parameters of the antenna is determined based on the cellular parameters and at least one of a history of the cellular parameters, as measured by the user equipments, and a history of physical parameters of the antenna.

On set consensus numbers

Abstract: It is conjectured that the only way a failure detector (FD) can help solving n-process tasks is by providing k-set consensus for some $${k\in\{1,\ldots,n\}}$$ among all the processes. It was recently shown by Zielinski that any FD that allows for solving a given n-process task that is unsolvable read-write wait-free, also solves (n − 1)-set consensus. In this paper, we provide a generalization of Zielinski’s result. We show that any FD that solves a colorless task that cannot be solved read-write k-resiliently, also solves k-set consensus. More generally, we show that every colorless task $${\mathcal{T}}$$ can be characterized by its set consensus number: the largest $${k\in\{1,\ldots,n\}}$$ such that $${\mathcal{T}}$$ is solvable (k − 1)-resiliently. A task $${\mathcal{T}}$$ with set consensus number k is, in the failure detector sense, equivalent to k-set consensus, i.e., a FD solves $${\mathcal{T}}$$ if and only if it solves k-set consensus. As a corollary, we determine the weakest FD for solving k-set consensus in every environment, i.e., for all assumptions on when and where failures might occur.

Price-aware neighborhood selection for peer-to-peer networks

Abstract: A method and apparatus for peer-to-peer file sharing is provided. In some embodiments, the method includes receiving a request for a list of neighbor peers, where the request is made by a requesting peer device, and where the requesting peer device has a local internet service provider (ISP). The method may also include employing a server device to rank each neighbor peer in a plurality of neighbor peers based on whether the respective neighbor peer is external to the local ISP, and if the respective neighbor peer is external to the ISP, further based on a cost metric associated with a next ISP hop from the requesting peer device to the respective neighbor peer. The method may also include generating the list of neighbor peers based on the ranking of the neighbor peers, and enabling transmission of the list of neighbor peers to the requesting peer device.

Method for increasing the data transfer rate while ensuring real time mode

Abstract: The inventive method provides a solution ensuring data transfer in real time mode for individual user/client even when a maximum number user/clients are simultaneously accessing the data network. The inventive solution provides that, if necessary, an ISDN data connection, through which data transfer can be carried out in real time mode, is connected in addition to the existing standard data transfer path between the interactive IVS server system of the on-line system and a user/client ISDN data device. The invention can be used especially in the area of on-demand services such as audio on demand, music on demand, books on demand, clips on demand, news on demand, still pictures on demand, video on demand via ISDN, on-demand services via wide band communications networks and on-demand services via special networks.