We introduce a Write-Once Read-Many (WORM) storage system providing strong assurances of data retention and compliant migration, by leveraging trusted secure hardware in close data proximity. This is important because existing compliance storage products and research prototypes are fundamentally vulnerable to faulty or malicious behavior, as they rely on simple enforcement primitives ill-suited for their threat model. This is hard because tamper-proof processing elements are significantly constrained in both computation ability and memory capacity - as heat dissipation concerns under tamper-resistant requirements limit their maximum allowable spatial gate-density. We achieve efficiency by (i) ensuring the secure hardware is accessed sparsely, minimizing the associated overhead for expected transaction loads, and (ii) using adaptive overhead-amortized constructs to enforce WORM semantics at the throughput rate of the storage servers ordinary processors during burst periods. With a single secure co-processor, on single-CPU commodity x86 hardware, our architecture can support over 2500 transactions per second.
{"title":"Strong WORM","authors":"R. Sion","doi":"10.1109/ICDCS.2008.20","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.20","url":null,"abstract":"We introduce a Write-Once Read-Many (WORM) storage system providing strong assurances of data retention and compliant migration, by leveraging trusted secure hardware in close data proximity. This is important because existing compliance storage products and research prototypes are fundamentally vulnerable to faulty or malicious behavior, as they rely on simple enforcement primitives ill-suited for their threat model. This is hard because tamper-proof processing elements are significantly constrained in both computation ability and memory capacity - as heat dissipation concerns under tamper-resistant requirements limit their maximum allowable spatial gate-density. We achieve efficiency by (i) ensuring the secure hardware is accessed sparsely, minimizing the associated overhead for expected transaction loads, and (ii) using adaptive overhead-amortized constructs to enforce WORM semantics at the throughput rate of the storage servers ordinary processors during burst periods. With a single secure co-processor, on single-CPU commodity x86 hardware, our architecture can support over 2500 transactions per second.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126618374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In his seminal work, Jon Kleinberg considers a small-world network model consisting of a k-dimensional lattice augmented with shortcuts. Under the assumption that the probability of a shortcut being present between two nodes u and v decays as a power, d(u,v) -alpha, of the distance d(u,v) between them, Kleinberg shows that decentralized routing scheme such as greedy geographic routing is efficient if alpha=k and that there is no efficient decentralized routing algorithm if alphaneq k. The results are extended to a continuum model recently, wherein the nodes are distributed as a homogeneous Poisson point process by Franceschetti and Meester, Draief and Ganesh. In our work, we extend the result further to a more realistic model constructed from a nonhomogeneous Poisson point process, wherein each node is connected to all its neighbors within some fixed radius, as well as possessing random shortcuts to more distant nodes. More importantly, we show that in nonhomogeneous cases, the necessary and sufficient condition for greedy geographic routing to be efficient is that the probability of a shortcut being present from node u to v should be inversely proportional to the number of nodes which are closer to u than v is. We also demonstrate some applications of our results to wireless networks.
{"title":"Decentralized Routing in Nonhomogeneous Poisson Networks","authors":"Chi Zhang, Pan Li, Yuguang Fang, P. Khargonekar","doi":"10.1109/ICDCS.2008.83","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.83","url":null,"abstract":"In his seminal work, Jon Kleinberg considers a small-world network model consisting of a k-dimensional lattice augmented with shortcuts. Under the assumption that the probability of a shortcut being present between two nodes u and v decays as a power, d(u,v) -alpha, of the distance d(u,v) between them, Kleinberg shows that decentralized routing scheme such as greedy geographic routing is efficient if alpha=k and that there is no efficient decentralized routing algorithm if alphaneq k. The results are extended to a continuum model recently, wherein the nodes are distributed as a homogeneous Poisson point process by Franceschetti and Meester, Draief and Ganesh. In our work, we extend the result further to a more realistic model constructed from a nonhomogeneous Poisson point process, wherein each node is connected to all its neighbors within some fixed radius, as well as possessing random shortcuts to more distant nodes. More importantly, we show that in nonhomogeneous cases, the necessary and sufficient condition for greedy geographic routing to be efficient is that the probability of a shortcut being present from node u to v should be inversely proportional to the number of nodes which are closer to u than v is. We also demonstrate some applications of our results to wireless networks.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116591917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Different distributed cyber-physical systems must handle a periodic and periodic events with diverse requirements. While existing real-time middleware such as real-time CORBA has shown promise as a platform for distributed systems with time constraints, it lacks flexible configuration mechanisms needed to manage end-to-end timing easily for a wide range of different cyber-physical systems with both aperiodic and periodic events. The primary contribution of this work is the design, implementation and performance evaluation of the first configurable component middleware services for admission control and load balancing of a periodic and periodic event handling in distributed cyber-physical systems. Empirical results demonstrate the need for, and the effectiveness of, our configurable component middleware approach in supporting different applications with a periodic and periodic events, and providing a flexible software platform for distributed cyber-physical systems with end-to-end timing constraints.
{"title":"Reconfigurable Real-Time Middleware for Distributed Cyber-Physical Systems with Aperiodic Events","authors":"Yuanfang Zhang, C. Gill, Chenyang Lu","doi":"10.1109/ICDCS.2008.96","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.96","url":null,"abstract":"Different distributed cyber-physical systems must handle a periodic and periodic events with diverse requirements. While existing real-time middleware such as real-time CORBA has shown promise as a platform for distributed systems with time constraints, it lacks flexible configuration mechanisms needed to manage end-to-end timing easily for a wide range of different cyber-physical systems with both aperiodic and periodic events. The primary contribution of this work is the design, implementation and performance evaluation of the first configurable component middleware services for admission control and load balancing of a periodic and periodic event handling in distributed cyber-physical systems. Empirical results demonstrate the need for, and the effectiveness of, our configurable component middleware approach in supporting different applications with a periodic and periodic events, and providing a flexible software platform for distributed cyber-physical systems with end-to-end timing constraints.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124612905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Most proposed DHTs have their unique maintenance mechanisms specific to the static graphs on which they are based. In this paper we propose distributed line graphs (DLG), a universal framework for building DHTs based on arbitrary constant-degree graphs. We prove that in a DLG-enabled, N-node DHT, the out-degree is d, the in-degree is between 1 and 2d, and the diameter is less than 2(logdN-logdN0+D0+1), where d, D0 and N0 represent the degree, diameter and number of nodes of the initial graph, respectively. The maintenance cost of DLG-enabled DHTs is O(logdN). We show the power of DLG technique by applying it to Kautz graphs to propose a new DHT scheme.
大多数建议的dht都有其独特的维护机制，特定于它们所基于的静态图。本文提出了一种基于任意等度图构建dht的通用框架——分布式线形图(distributed line graphs, DLG)。我们证明了在支持dlg的n节点DHT中，输出度为d，输入度在1 ~ 2d之间，直径小于2(logdN-logdN0+D0+1)，其中d、D0和N0分别表示初始图的度、直径和节点数。支持dlg的dht的维护成本为0 (logdN)。我们通过将DLG技术应用于Kautz图来展示其强大的功能，并提出了一种新的DHT方案。
{"title":"Distributed Line Graphs: A Universal Framework for Building DHTs Based on Arbitrary Constant-Degree Graphs","authors":"Yiming Zhang, Ling Liu, Dongsheng Li, Xicheng Lu","doi":"10.1109/ICDCS.2008.35","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.35","url":null,"abstract":"Most proposed DHTs have their unique maintenance mechanisms specific to the static graphs on which they are based. In this paper we propose distributed line graphs (DLG), a universal framework for building DHTs based on arbitrary constant-degree graphs. We prove that in a DLG-enabled, N-node DHT, the out-degree is d, the in-degree is between 1 and 2d, and the diameter is less than 2(log<sub>d</sub>N-log<sub>d</sub>N<sub>0</sub>+D<sub>0</sub>+1), where d, D<sub>0</sub> and N<sub>0</sub> represent the degree, diameter and number of nodes of the initial graph, respectively. The maintenance cost of DLG-enabled DHTs is O(log<sub>d</sub>N). We show the power of DLG technique by applying it to Kautz graphs to propose a new DHT scheme.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"620 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116205576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
For queries in wireless sensor networks, empty sets may be returned as query results which could confuse users a lot and users obtain no useful information about the monitored objects from the empty sets. To solve the problem, this paper proposes methods to provide users with approximate answer sets in the case where no sensing data satisfies the query conditions. The approximate answer sets can be used not only to answer the query approximately but also to guide users to modify their queries for further probing the monitored objects. The distance between sensing data and a query and the dominating relationship between sensing data are first defined. Then, three algorithms for processing probing queries are proposed, which compute the best approximate answer sets that consist of the sensing data with the smallest distance from given queries. All the algorithms utilize the dominating relationship to reduce the amount of data transmitted in sensor networks by filtering out the unnecessary data. Experimental results on real and synthetic data sets show that the proposed algorithms have high performance and energy efficiency.
{"title":"Probing Queries in Wireless Sensor Networks","authors":"Liqiang Pan, Ji-zhou Luo, Jianzhong Li","doi":"10.1109/ICDCS.2008.28","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.28","url":null,"abstract":"For queries in wireless sensor networks, empty sets may be returned as query results which could confuse users a lot and users obtain no useful information about the monitored objects from the empty sets. To solve the problem, this paper proposes methods to provide users with approximate answer sets in the case where no sensing data satisfies the query conditions. The approximate answer sets can be used not only to answer the query approximately but also to guide users to modify their queries for further probing the monitored objects. The distance between sensing data and a query and the dominating relationship between sensing data are first defined. Then, three algorithms for processing probing queries are proposed, which compute the best approximate answer sets that consist of the sensing data with the smallest distance from given queries. All the algorithms utilize the dominating relationship to reduce the amount of data transmitted in sensor networks by filtering out the unnecessary data. Experimental results on real and synthetic data sets show that the proposed algorithms have high performance and energy efficiency.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114709238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary form only given. The development situation of telecom services is firstly reviewed in this presentation. The evolution trends of network services with IP, broadband, streaming, P2P (peer to peer) and mobility features are described. The presentation introduces the evolution direction and prospect of networks technologies especially NGI (next generation Internet) and NGN (next generation network) as well as broadband mobile IP network. The presentation also gives a brief overview of representative projects within research activities on NGI including the CNGI (China's next Internet demonstration project). Finally, the challenges that network development faced are discussed such as scalability, QoS, pervasive computing and ubiquitous networking, security issue and shortage of frequency spectrum as well as dilemma whether to do evolution or revolution strategy of network development.
{"title":"Prospect and Challenges for Network Development","authors":"Hequan Wu","doi":"10.1109/ICDCS.2008.114","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.114","url":null,"abstract":"Summary form only given. The development situation of telecom services is firstly reviewed in this presentation. The evolution trends of network services with IP, broadband, streaming, P2P (peer to peer) and mobility features are described. The presentation introduces the evolution direction and prospect of networks technologies especially NGI (next generation Internet) and NGN (next generation network) as well as broadband mobile IP network. The presentation also gives a brief overview of representative projects within research activities on NGI including the CNGI (China's next Internet demonstration project). Finally, the challenges that network development faced are discussed such as scalability, QoS, pervasive computing and ubiquitous networking, security issue and shortage of frequency spectrum as well as dilemma whether to do evolution or revolution strategy of network development.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"405 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124314462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The possibility of using purely text stream (keyboard-enterable) as carrier of malware is under-researched and often under estimated. A text attack can happen at multiple levels, from code-injection attacks at the top level to host-compromising text-based machine code at the lowest level. Since a large number of protocols are text-based, at times the servers based on those protocols use ASCII filters to allow text input only. However, simply applying ASCII filters to weed out the binary data is not enough from the security viewpoint since the assumption that malware are always binary is false. We show that although text is a subset of binary, binary malware detectors cannot always detect text malware. We analyze the MEL (maximum executable length)-based detection schemes, and make two contributions by this analysis. First, although the concept of MEL has been used in various detection schemes earlier, we are the first to provide its underlying mathematical foundation. We show that the threshold value can be calculated from the input character frequencies and that it can be tuned to control the detection sensitivity. Second, we demonstrate the effectiveness of a MEL-based text malware detector by exploiting the specific properties of text streams.
{"title":"Analysis of Maximum Executable Length for Detecting Text-Based Malware","authors":"P. K. Manna, S. Ranka, Shigang Chen","doi":"10.1109/ICDCS.2008.70","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.70","url":null,"abstract":"The possibility of using purely text stream (keyboard-enterable) as carrier of malware is under-researched and often under estimated. A text attack can happen at multiple levels, from code-injection attacks at the top level to host-compromising text-based machine code at the lowest level. Since a large number of protocols are text-based, at times the servers based on those protocols use ASCII filters to allow text input only. However, simply applying ASCII filters to weed out the binary data is not enough from the security viewpoint since the assumption that malware are always binary is false. We show that although text is a subset of binary, binary malware detectors cannot always detect text malware. We analyze the MEL (maximum executable length)-based detection schemes, and make two contributions by this analysis. First, although the concept of MEL has been used in various detection schemes earlier, we are the first to provide its underlying mathematical foundation. We show that the threshold value can be calculated from the input character frequencies and that it can be tuned to control the detection sensitivity. Second, we demonstrate the effectiveness of a MEL-based text malware detector by exploiting the specific properties of text streams.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127685906","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Balasubramaniyan, A. Acharya, M. Ahamad, M. Srivatsa, Italo Dacosta, Charles P. Wright
A growing class of applications, including VoIP, IM and presence, are enabled by the session initiation protocol (SIP). Requests in SIP typically traverse through multiple proxies. The availability of multiple proxies offers the flexibility to distribute proxy functionality across several nodes. In particular, after experimentally demonstrating that the resource consumption of maintaining state is significant, we define the problem of state distribution across multiple nodes when the goal is to increase overall call throughput. We first formulate this as an optimization problem and then derive a distributed algorithm from it. This distributed algorithm leads to the design and evaluation of SERvartuka, a more scalable SIP server that dynamically determines the number of SIP requests for which the server is stateful while delegating state maintenance for the remainder of the requests to a server further downstream. This design is in contrast to existing SIP servers that are statically configured to either be stateless or stateful and therefore result in sub-optimal call throughput. We implement SERvartuka on top of OpenSER, a commercial SIP proxy server and measure performance benefits of different server configurations. An example of our results is a 20% percent increase in call throughput when using our algorithm for a configuration of two servers in series.
{"title":"SERvartuka: Dynamic Distribution of State to Improve SIP Server Scalability","authors":"V. Balasubramaniyan, A. Acharya, M. Ahamad, M. Srivatsa, Italo Dacosta, Charles P. Wright","doi":"10.1109/ICDCS.2008.42","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.42","url":null,"abstract":"A growing class of applications, including VoIP, IM and presence, are enabled by the session initiation protocol (SIP). Requests in SIP typically traverse through multiple proxies. The availability of multiple proxies offers the flexibility to distribute proxy functionality across several nodes. In particular, after experimentally demonstrating that the resource consumption of maintaining state is significant, we define the problem of state distribution across multiple nodes when the goal is to increase overall call throughput. We first formulate this as an optimization problem and then derive a distributed algorithm from it. This distributed algorithm leads to the design and evaluation of SERvartuka, a more scalable SIP server that dynamically determines the number of SIP requests for which the server is stateful while delegating state maintenance for the remainder of the requests to a server further downstream. This design is in contrast to existing SIP servers that are statically configured to either be stateless or stateful and therefore result in sub-optimal call throughput. We implement SERvartuka on top of OpenSER, a commercial SIP proxy server and measure performance benefits of different server configurations. An example of our results is a 20% percent increase in call throughput when using our algorithm for a configuration of two servers in series.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132060480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Michio Honda, J. Nakazawa, Y. Nishida, M. Kozuka, H. Tokuda
Migration between different wireless access networks often involves disconnected period, which is caused by passing an area of bad wireless coverage and potential overhead to switch the network on the network interface to connect to. The disconnected period can cause extra transmission delay due to the timer-driven retransmission behavior in the transport protocols, such as TCP and SCTP. We propose a new retransmission scheme to achieve better migration performance in SCTP, which is a newer connection-oriented and reliable transport protocol that is becoming popular. Our scheme minimizes the extra transmission delay by leveraging address reconfiguration operation in SCTP without involving other layers. It decreases the delay more than 5 seconds compared to the original SCTP when migration involves approximately ten-second disconnected period. The implementation of our scheme is already imported in FreeBSD.
{"title":"A Connectivity-Driven Retransmission Scheme Based On Transport Layer Readdressing","authors":"Michio Honda, J. Nakazawa, Y. Nishida, M. Kozuka, H. Tokuda","doi":"10.1109/ICDCS.2008.101","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.101","url":null,"abstract":"Migration between different wireless access networks often involves disconnected period, which is caused by passing an area of bad wireless coverage and potential overhead to switch the network on the network interface to connect to. The disconnected period can cause extra transmission delay due to the timer-driven retransmission behavior in the transport protocols, such as TCP and SCTP. We propose a new retransmission scheme to achieve better migration performance in SCTP, which is a newer connection-oriented and reliable transport protocol that is becoming popular. Our scheme minimizes the extra transmission delay by leveraging address reconfiguration operation in SCTP without involving other layers. It decreases the delay more than 5 seconds compared to the original SCTP when migration involves approximately ten-second disconnected period. The implementation of our scheme is already imported in FreeBSD.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134329088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Summary form only given. Advances in networking and wireless technologies, coupled with integration of information networks and social applications, bring about unprecedented challenges, technical and non-technical, underscoring the need for insight into the capabilities of our complex distributed and networked systems. As critical as these physical and cyber infrastructures are to our lives and diverse sectors of our society, we have little rigorous knowledge for understanding their structure and dynamics. The talk will discuss challenges and future directions in how to effectively design robust and secure large-scale complex systems, so that we can engineer them to have predictable behaviors.
{"title":"Challenges and Future Research Directions in Large-Scale Complex Systems","authors":"T. Znati","doi":"10.1109/ICDCS.2008.116","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.116","url":null,"abstract":"Summary form only given. Advances in networking and wireless technologies, coupled with integration of information networks and social applications, bring about unprecedented challenges, technical and non-technical, underscoring the need for insight into the capabilities of our complex distributed and networked systems. As critical as these physical and cyber infrastructures are to our lives and diverse sectors of our society, we have little rigorous knowledge for understanding their structure and dynamics. The talk will discuss challenges and future directions in how to effectively design robust and secure large-scale complex systems, so that we can engineer them to have predictable behaviors.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"30 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：