Change search
Refine search result
1 - 15 of 15
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Jónsson, Kristjan Valur
    et al.
    Reykjavik University.
    Kreitz, Gunnar
    KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
    Uddin, Misbah
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Secure Multi-Party Sorting and Applications2011Conference paper (Refereed)
  • 2.
    Uddin, Misbah
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Networks.
    A Bottom-Up Approach to Real-Time Search in Large Networks and Clouds2016Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Networked systems, such as telecom networks and cloud infrastructures, generate and hold vast amounts of conguration and operational data. The goal of this work is to make all this data available through a real-time search process named network search , which will enable new real-time management solutions. The thesis contains several contributions towards engineering a network search system. Key elements of our design are a weakly structured information model that includes spatial properties, a query language that supports location- and schema-oblivious search queries, a peer-to-peer architecture, a set of echo protocols for scalable query processing, and an indexing protocol for ecient routing for spatial queries. The data against which network search is performed is maintained in local real-time databases close to the data sources. The design follows a bottom-up approach in the sense that the topology for query routing is constructed from the underlying network topology. We have built a prototype of the system on a cloud testbed and developed applications that use network search functionality. Testbed measurements suggest that it is feasible to engineer a network search system that processes queries at low latency and low overhead and that can scale to 100'000 nodes. Simulation results for spatial queries show that query processing achieves response times and incurs overhead close to an optimal protocol, and that query result remains accurate under signicant churn.

  • 3.
    Uddin, Misbah
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Real-Time Search in Large Networks and Clouds2013Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    Networked systems, such as telecom networks and cloud infrastructures, hold and generate vast amounts of conguration and operational data, only a small portion of which is used today by management applications. The overall goal of this work is to make all this data available through a real-time search process named network search , where queries are invoked, without giving the location or the format of the data, similar to web search. Such a capability will simplify many management applications and enable new classes of realtime management solutions. The fundamental problems in network search relate to search in a vast and dynamic information space and the fact that the information is distributed across a very large system.

    The thesis contains several contributions towards engineering a network search system. We present a weakly-structured information model, which enables representation of heterogeneous network data, a keyword-based search language, which supports location- and schema-oblivious search queries, and a distributed search mechanism, which is based on an echo protocol and supports a range of matching and ranking options. The search is performed in a peer-to-peer fashion in a network of search nodes. Each search node maintains a local real-time database of locally sensed conguration and operational information. Many of the concepts we developed for network search are based on results from the elds of information retrieval, web search, and very large databases. The key feature of our solution is that the search process and the computation of the query results is performed on local data inside the network or the cloud. We have build a prototype of the system on a cloud testbed and developed applications that use network search functionality. The performance measurements suggest that it is feasible to engineer a network search system that processes queries at low latency and low overhead, and that can scale to a very large system in the order of 100,000 nodes.

  • 4.
    Uddin, Misbah
    et al.
    KTH.
    Monir, M. I.
    Iqbal, S.Md.A.
    A QoS aware route selection mechanism using analytic hierarchy process for mobile Ad Hoc network2009In: ICCIT 2009 - Proceedings of 2009 12th International Conference on Computer and Information Technology, 2009, p. 552-557Conference paper (Refereed)
    Abstract [en]

    To truly realize potential of MANET, multimedia services must be provisioned with a minimum level of QoS. To meet the QoS requirement of such services, many attributes need to be considered. To keep the routing process lightweight, standard QoS aware routing protocol in MANET works with one or two such parameters. In this paper, we have proposed an on-demand source routing protocol for MANET that works with six important QoS attributes by varying priority for different category of traffic flow. We have reflected this variation by incorporating Analytic Hierarchy Process in the proposal.

  • 5.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Skinner, Amy
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Clemm, Alexander
    Cisco Systems, San Jose, USA.
    Real-Time Search in Clouds2013In: Proceedings of the 2013 IFIP/IEEE International Symposium on Integrated Network Management, IM 2013, New York: IEEE , 2013, p. 1070-1071Conference paper (Refereed)
    Abstract [en]

    We developed a novel approach for management of networks/networked systems based on network search [4]. Network search provides a simple, uniform interface, through which human administrators and management applications can obtain network information, configuration or operational, without knowing its schema and location. We believe that the capability of network search will spur the development of new tools for human administrators and enable the rapid development of new classes of network control functions and applications.

  • 6.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    A bottom-up approach to real-time search in large networks and clouds2016In: Proceedings of the NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium, IEEE conference proceedings, 2016, p. 985-990Conference paper (Refereed)
    Abstract [en]

    Networked systems, such as telecom networks and cloud infrastructures, generate and hold vast amounts of configuration and operational data. The goal of this work is to make all this data available through a real-time search process named network search, which will enable new real-time management solutions. The thesis contains several contributions towards engineering a network search system. Key elements of our design are a weakly structured information model that includes spatial properties, a query language that supports location- and schema-oblivious search queries, a peer-to-peer architecture, an echo protocols for scalable query processing, and an indexing protocol for efficient routing for spatial queries. The data against which network search is performed is maintained in local real-time databases close to the data sources. The design follows a bottom-up approach in the sense that the topology for query routing is constructed from the underlying network topology. We have built a prototype of the system on a cloud testbed and developed applications that use network search functionality. Testbed measurements suggest that it is feasible to engineer a network search system that processes queries at low latency and low overhead and that can scale to 100'000 nodes. Simulation results for spatial queries show that query processing achieves response times and incurs overhead close to an optimal protocol, and that it remains accurate under significant churn.

  • 7.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Networks.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Networks.
    Clemm, Alexander
    Cisco Systems, Inc..
    A Bottom-Up Design for Spatial Search in Large Networks and Clouds2016Report (Other academic)
    Abstract [en]

    Information in networked systems often has spatial semantics: routers, sensors, or virtual machines have coordinates in a geographical or virtual space, for instance. In this paper, we propose a design for a spatial search system that processes queries against spatial information which is maintained in local databases inside a large networked system. In contrast to previous works in spatial databases and peer-to-peer designs, our design is bottom-up, which makes query routing network-aware and thus efficient, and which facilitates system bootstrapping and adaptation. Key to our design is a protocol that creates and maintains a distributed index of object locations based on information from local databases and the underlying network topology. The index builds upon minimum bounding rectangles (MBRs) to efficiently encode locations. We present a generic search protocol which is based on an echo protocol and uses the index to prune the search space and perform query routing. The response times of search queries increase with the diameter of the network, which is asymptotically optimal. We study the performance of the protocol through simulation in static and dynamic network environments, for different network topologies, and for network sizes upto 100'000 nodes. In all experiments, the overhead incurred by our protocol lies within thirty percent of a hypothetical optimal protocol. In addition, the protocol provides high accuracy under significant churn.

  • 8.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering and Computer Science (EECS), Network and Systems engineering. KTH, School of Electrical Engineering and Computer Science (EECS), Centres, ACCESS Linnaeus Centre.
    Clemm, Alexander
    Huawei USA Futurewei Technol Inc, Santa Clara, CA USA..
    A bottom-up design for spatial search in large networks and clouds2018In: International Journal of Network Management, ISSN 1055-7148, E-ISSN 1099-1190, Vol. 28, no 6, article id e2041Article in journal (Refereed)
    Abstract [en]

    APPENDIX Information in networked systems often has spatial semantics: routers, sensors, or virtual machines have coordinates in a geographical or virtual space, for instance. In this paper, we propose a design for a spatial search system that processes queries against spatial information that is maintained in local databases inside a large networked system. In contrast to previous works in spatial databases and peer-to-peer designs, our design is bottom-up, which makes query routing network aware and thus efficient, and which facilitates system bootstrapping and adaptation. Key to our design is a protocol that creates and maintains a distributed index of object locations based on information from local databases and the underlying network topology. The index builds upon minimum bounding rectangles to efficiently encode locations. We present a generic search protocol that is based on an echo protocol and uses the index to prune the search space and perform query routing. The response times of search queries increase with the diameter of the network, which is asymptotically optimal. We study the performance of the protocol through simulation in static and dynamic network environments, for different network topologies, and for network sizes up to 100 000 nodes. In most experiments, the overhead incurred by our protocol lies well below 30% of a hypothetical optimal protocol. In addition, the protocol provides high accuracy under significant churn.

  • 9.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Clemm, Alexander
    Cisco Systems, Inc..
    A peer-to-peer design for spatial search system2015Report (Other academic)
    Abstract [en]

    Information in networked systems often has spatial semantics: routers, sensors, or virtual machines have coordinates in a geographical or virtual space, for instance. In this paper, we propose a peer-to-peer design for a spatial search system that processes queries, such as range or nearest-neighbor queries, on spatial information cached on nodes inside a networked system. Key to our design is a protocol that creates a distributed index of object locations and adapts it to object and node churn. The index is build around the concept of minimum bounding rectangle to efficiently encode locations. We present a search protocol, which is based on an echo protocol that prunes the search space and performs query routing. Simulations show the efficiency of the protocol in pruning the search space, thereby reducing the protocol overhead. For many queries, the protocol efficiency increases with the network size and approaches that of an optimal protocol for large systems. The protocol overhead depends on the network topology and is lower if neighboring nodes are spatially close. In contrast to recent works in spatial databases, our design is bottom-up, which makes query routing network-aware and thus efficient in networked systems.

  • 10.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Clemm, Alexander
    Cisco Systems Inc. .
    A Query Language for Network Search2013In: Proceedings of the 2013 IFIP/IEEE International Symposium on Integrated Network Management, IM 2013, New York: IEEE conference proceedings, 2013, p. 109-117Conference paper (Refereed)
    Abstract [en]

    Network search makes operational data available in real-time to management applications. In contrast to traditional monitoring, neither the data location nor the data format needs to be known to the invoking process, which simplifies application development, but requires an efficient search plane inside the managed system. This paper presents a query language for network search and discusses how search queries can be executed in a networked system. The search space consists of named objects that are modeled as sets of attribute-value pairs. The data model is more general than the relational model, and the query language is more expressive than relational calculus. The paper shows that distributed query processing can be performed using an echo algorithm and that name resolution can be embedded in query processing. Finally, two use cases for network search are presented, one in networking and one in cloud computing, the latter backed up by a prototype implementation.

  • 11.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Clemm, Alexander
    Management by Network Search2012In: Proceedings of the 2012 IEEE Network Operations and Management Symposium, NOMS 2012, New York: IEEE Communications Society, 2012, p. 146-154Conference paper (Refereed)
    Abstract [en]

    While networked systems hold and generate vast amounts of configuration and operational data, this data is not accessible through a simple, uniform mechanism. Rather, it must be gathered using a range of different protocols and interfaces. Our vision is to make all this data available in a simple format through a realtime search process which runs within the network and aggregates the data into a form needed by applications - a concept we call network search. We believe that such an approach, though challenging, is technically feasible and will enable rapid development of new management applications and advanced network functions. This paper motivates and formulates the concept of network search, compares it to related concepts like web search, outlines a search architecture, describes the design space and research challenges, and reports on a testbed implementation with management applications built for exploratory purposes of this new paradigm.

  • 12.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Clemm, Alexander
    Cisco Systems Inc..
    Management by Network Search2012Report (Other academic)
    Abstract [en]

    While networked systems hold and generate vast amounts of configuration and operational data, this data is not accessible through a simple, uniform mechanism. Rather, it must be gathered using a range of different protocols and interfaces. Our vision is to make all this data available in a simple format through a realtime search process which runs within the network and aggregates the data into a form needed by applications—a concept we call network search. We believe that such an approach, though challenging, is technically feasible and will enable rapid development of new management applications and advanced network functions. The paper motivates and formulates the concept of network search, compares it to related concepts like web search, outlines a search architecture, describes the design space and research challenges, and reports on a testbed implementation with management applications built for exploratory purposes of this new paradigm.

  • 13.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Clemm, Alexander
    Cisco Systems, San Jose, USA.
    Scalable Matching and Ranking for Network Search2013In: 2013 9th International Conference on Network and Service Management (CNSM), IEEE Computer Society, 2013, p. 251-259Conference paper (Refereed)
    Abstract [en]

    Network search makes operational data available in real-time to management applications. In contrast to traditional monitoring, neither the data location nor the data format needs to be known to the invoking process, which simplifies application development, but requires an efficient search plane inside the managed system. The search plane is realized as a network of search nodes that process search queries in a distributed fashion. This paper introduces matching and ranking for network search queries. We are proposing a semantic for matching and ranking, which is configurable to support different types of management applications - from exact matching for database-style queries to loose, approximate matching, which is appropriate for exploratory purposes. We describe an echo protocol for efficient distributed query processing that supports matching and ranking. Further, we present the design of a search node, which maintains a real-time database of operational information and allows for parallel processing of search queries. A prototype implementation on a cloud testbed shows that the network search system, on a 9-node cluster with 24 core servers, executes 200 global search queries/sec with the 75th percetile latency below 100 milliseconds and with a CPU utilization below 5%. The performance measurements, together with our design, suggest that a system of 100,000 servers processing the same load would exhibit the same overhead per server and a query latency of below 1 sec.

  • 14.
    Uddin, Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Networks.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre. KTH, School of Electrical Engineering (EES), Communication Networks.
    Clemm, Alexander
    Cisco.
    Spatial Search in Networked Systems2015In: 2015 11TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM), IEEE conference proceedings, 2015, p. 327-335Conference paper (Refereed)
    Abstract [en]

    Information in networked systems often has spatial properties: routers, sensors, or virtual machines have coordinates. in a geographical or virtual space, for instance. In this paper, we propose a peer-to-peer design for a spatial search system that processes queries, such as range or nearest-neighbor queries, on spatial information cached on nodes inside a networked system. Key to our design is a protocol that creates a distributed index of object locations and adapts to object and node churn. The indexbuilds upon the concept of the minimum bounding rectangle, to efficiently encode a large set of locations. We present a search protocol, which is based on an echo protocol and performs query routing. Simulations show the efficiency of the protocol in pruning the search space, thereby reducing the protocol overhead. For many queries, the protocol efficiency increases with the network size and approaches that of an optimal protocol for large systems. The protocol overhead depends on the network topology and is lower if neighboring nodes are spatially close. As a key difference to works in spatial databases, our design is bottom-up, which makes query routing network-aware and thus efficient in networked systems.

  • 15.
    Uddin, Mohammad Misbah
    et al.
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Stadler, Rolf
    KTH, School of Electrical Engineering (EES), Communication Networks. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
    Miyazawa, M.
    Hayashi, M.
    Graph search for cloud network management2014In: IEEE/IFIP NOMS 2014 - IEEE/IFIP Network Operations and Management Symposium: Management in a Software Defined World, IEEE conference proceedings, 2014Conference paper (Refereed)
    Abstract [en]

    A large part of operational and configuration information in networks and clouds has graph structure, e.g., virtual network topologies, IP flows, communication links of distributed cloud applications. The final objective of this work is to develop a scalable management system that allows real-time management applications, such as network analytics and anomaly detection applications, to search for graph-structured operational information. The paper contains a step towards this objective. The key challenge is to devise an efficient and scalable search process on data that is volatile and distributed across the network infrastructure. Approaches that are currently pursued for distributed graph databases are not applicable in this context. This paper presents design options and possible solutions for engineering a scalable graph search system that supports management applications. It includes a simple information model based on property graphs and a search query language based on keyword search. The architecture of the system centers around a distributed search plane that performs query processing using a network of search nodes. Finally, the paper outlines the design of a search node, which contains a local database that maintains graph partitions.

1 - 15 of 15
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf