Communication networks are vulnerable to emergencies both natural and manmade. Deployment of cost-effective, efficient and robust communications network for emergency situations is considered to be a vital problem. In this paper we propose the use of cognitive agents for post-disaster communications (CAP-C). Birth-death lifecycle of these mobile agents is also presented. We also presented a binary hypothesis test for evaluating the output of each cognitive agent.
{"title":"Post-Disaster Communications: A Cognitive Agent Approach","authors":"S. Majid, K. Ahmed","doi":"10.1109/ICN.2008.60","DOIUrl":"https://doi.org/10.1109/ICN.2008.60","url":null,"abstract":"Communication networks are vulnerable to emergencies both natural and manmade. Deployment of cost-effective, efficient and robust communications network for emergency situations is considered to be a vital problem. In this paper we propose the use of cognitive agents for post-disaster communications (CAP-C). Birth-death lifecycle of these mobile agents is also presented. We also presented a binary hypothesis test for evaluating the output of each cognitive agent.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117057320","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}
Securing group communications in resource constrained, infrastructure-less mobile ad hoc networks (MANETs) has become one of the most challenging research directions in the areas of wireless networking and security. MANETs are emerging as the desired environment for an increasing number of commercial and military applications, addressing also an increasing number of users. Security on the other hand, is becoming an indispensable requirement of our modern life for all these applications. The inherent limitations of MANETs impose major difficulties on establishing a suitable secure group communications framework. We contribute to the latter by extending hypercube, an existing key agreement (KA) scheme - all parties contribute equally to the group key - to tolerate multiple member failures with low cost. We achieve this by enhancing hypercube with a novel adaptively proactive algorithm. Members are assumed to be already authenticated via some underlying mechanism and we only focus on the design and analysis of a fault-tolerant scheme. Our algorithm has been evaluated and compared with the existing approach. Through our analysis and simulations we demonstrate its superiority in terms of robustness and efficiency.
{"title":"Fault-Tolerant Extension of Hypercube for Secure and Reliable Group Communications","authors":"M. Striki, J. Baras, K. Manousakis","doi":"10.1109/ICN.2008.95","DOIUrl":"https://doi.org/10.1109/ICN.2008.95","url":null,"abstract":"Securing group communications in resource constrained, infrastructure-less mobile ad hoc networks (MANETs) has become one of the most challenging research directions in the areas of wireless networking and security. MANETs are emerging as the desired environment for an increasing number of commercial and military applications, addressing also an increasing number of users. Security on the other hand, is becoming an indispensable requirement of our modern life for all these applications. The inherent limitations of MANETs impose major difficulties on establishing a suitable secure group communications framework. We contribute to the latter by extending hypercube, an existing key agreement (KA) scheme - all parties contribute equally to the group key - to tolerate multiple member failures with low cost. We achieve this by enhancing hypercube with a novel adaptively proactive algorithm. Members are assumed to be already authenticated via some underlying mechanism and we only focus on the design and analysis of a fault-tolerant scheme. Our algorithm has been evaluated and compared with the existing approach. Through our analysis and simulations we demonstrate its superiority in terms of robustness and efficiency.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116734276","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}
Gerard París, M. Arrufat, P. López, Marc Sánchez Artigas
New collaborative applications relying on a MANET need multicast to perform efficient group communication. Application layer multicast is seen as a good alternative to the traditional network layer routing protocols because of its flexibility and ease of deployment. However, existing application layer multicast protocols for MANETs are not designed for collaborative scenarios. In this paper, we present OMCAST, a new overlay multicast protocol for mobile ad hoc networks that is specifically targeted for collaborative scenarios. OMCAST benefits from the broadcast nature of the wireless medium in order to minimize network delay and congestion. Evaluation shows that OMCAST achieves better network performance than current message delivery approaches.
{"title":"An Application Layer Multicast for Collaborative Scenarios: The OMCAST Protocol","authors":"Gerard París, M. Arrufat, P. López, Marc Sánchez Artigas","doi":"10.1109/ICN.2008.59","DOIUrl":"https://doi.org/10.1109/ICN.2008.59","url":null,"abstract":"New collaborative applications relying on a MANET need multicast to perform efficient group communication. Application layer multicast is seen as a good alternative to the traditional network layer routing protocols because of its flexibility and ease of deployment. However, existing application layer multicast protocols for MANETs are not designed for collaborative scenarios. In this paper, we present OMCAST, a new overlay multicast protocol for mobile ad hoc networks that is specifically targeted for collaborative scenarios. OMCAST benefits from the broadcast nature of the wireless medium in order to minimize network delay and congestion. Evaluation shows that OMCAST achieves better network performance than current message delivery approaches.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114715500","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}
Mobile Internet access in moving entities such as, cars, buses, trains, and airplanes is in great demand. The mobility protocols Mobile IPv6 and NEMO, use a bi-directional tunneling mechanism and all communications pass through this tunnel. If this tunnel provides network mobility transparency to the nodes within the network and to their correspondents, it also introduces high protocol overheads since multiple Internet header are carried on each message. This becomes critical since the tunnel is established over different access technologies such as Wireless LAN and 3G where bandwidth is a scarce resource. Moreover, for each mobile terminal (MN) or mobile router (MR), the mobility protocols create a tunnel with the home agent (HA) which can become a bottleneck when it has to serve thousands of mobiles. ROHC header compression mechanism is known to be able to reduce header size and improve performance in low bandwidth links. Thus, ROHC can be used to reduce the tunnel header overhead and improve the performance of the HA. However, ROHC is a complex mechanism and its use needs to be optimised for this specific usage. In this paper, we present two approaches to optimise the use of ROHC profiles when ROHC compression is used in NEMO networks. In the first approach, we suggest to use a reduced number of ROHC profiles. It is proposed to use only the IP profile of ROHC as IP header is the largest header. Also, header compression is applied per user in order to reduce the number of contexts and thus to reduce the processing load and the memory consumption at HA. The second approach proposes to classify the ROHC profiles into different levels depending on the resources that are used at the MR and HA. Optimising the use of ROHC profiles, although reduces the header compression performance, in return it saves resources. Moreover, the complexity of the ROHC mechanism is reduced. We present a performance evaluation of the header overhead reduction for different types of IP flows under the two approaches when they are applied to mobile networks.
{"title":"Optimising the Use of Robust Header Compression Profiles in NEMO Networks","authors":"Priyanka Rawat, J. Bonnin, A. Minaburo","doi":"10.1109/ICN.2008.35","DOIUrl":"https://doi.org/10.1109/ICN.2008.35","url":null,"abstract":"Mobile Internet access in moving entities such as, cars, buses, trains, and airplanes is in great demand. The mobility protocols Mobile IPv6 and NEMO, use a bi-directional tunneling mechanism and all communications pass through this tunnel. If this tunnel provides network mobility transparency to the nodes within the network and to their correspondents, it also introduces high protocol overheads since multiple Internet header are carried on each message. This becomes critical since the tunnel is established over different access technologies such as Wireless LAN and 3G where bandwidth is a scarce resource. Moreover, for each mobile terminal (MN) or mobile router (MR), the mobility protocols create a tunnel with the home agent (HA) which can become a bottleneck when it has to serve thousands of mobiles. ROHC header compression mechanism is known to be able to reduce header size and improve performance in low bandwidth links. Thus, ROHC can be used to reduce the tunnel header overhead and improve the performance of the HA. However, ROHC is a complex mechanism and its use needs to be optimised for this specific usage. In this paper, we present two approaches to optimise the use of ROHC profiles when ROHC compression is used in NEMO networks. In the first approach, we suggest to use a reduced number of ROHC profiles. It is proposed to use only the IP profile of ROHC as IP header is the largest header. Also, header compression is applied per user in order to reduce the number of contexts and thus to reduce the processing load and the memory consumption at HA. The second approach proposes to classify the ROHC profiles into different levels depending on the resources that are used at the MR and HA. Optimising the use of ROHC profiles, although reduces the header compression performance, in return it saves resources. Moreover, the complexity of the ROHC mechanism is reduced. We present a performance evaluation of the header overhead reduction for different types of IP flows under the two approaches when they are applied to mobile networks.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125412631","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}
We present a new access control model for XML Web-Services that provides users with two kinds of authorities: the authority to delegate their authorities to other users and the authority to create new authorities based on their own authorities. We developed this model by introducing capability- based access control to Web services. A capability consists of an object identifier and the list of permitted operations for that object. We map an authority of a Web-Services object to a capability of the object and express the capability as a description in Web Services Description Language (WSDL). Delegation of an authority corresponds to distribution of a capability, which is done by passing a WSDL description. Creation of a new authority corresponds to generating a restricted capability based on an original capability, which is done by stacking an object on an original object. Stacking objects also makes it possible to add new functions to existing Web-Services objects without modifying the existing objects. We demonstrate the effectiveness of the proposed model using a schedule management application, which enables a project leader to delegate his or her tasks to subordinates by comparing it with Google Calendar. We also show that the execution times of stackable objects are acceptable by comparing them with typical Internet delay.
{"title":"An Access Control Model for Web-Services That Supports Delegation and Creation of Authority","authors":"Mitsuhiro Mabuchi, Yasushi Shinjo, Akira Sato, Kazuhiko Kato","doi":"10.1109/ICN.2008.72","DOIUrl":"https://doi.org/10.1109/ICN.2008.72","url":null,"abstract":"We present a new access control model for XML Web-Services that provides users with two kinds of authorities: the authority to delegate their authorities to other users and the authority to create new authorities based on their own authorities. We developed this model by introducing capability- based access control to Web services. A capability consists of an object identifier and the list of permitted operations for that object. We map an authority of a Web-Services object to a capability of the object and express the capability as a description in Web Services Description Language (WSDL). Delegation of an authority corresponds to distribution of a capability, which is done by passing a WSDL description. Creation of a new authority corresponds to generating a restricted capability based on an original capability, which is done by stacking an object on an original object. Stacking objects also makes it possible to add new functions to existing Web-Services objects without modifying the existing objects. We demonstrate the effectiveness of the proposed model using a schedule management application, which enables a project leader to delegate his or her tasks to subordinates by comparing it with Google Calendar. We also show that the execution times of stackable objects are acceptable by comparing them with typical Internet delay.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126843715","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 development of efficient call admission control schemes for next generation wireless cellular networks remains a challenging and yet unresolved problem, due to the rapidly growing number of multimedia applications and to user mobility. In recent work we have modeled the behavior of H.263 videoconference traces with the use of a discrete autoregressive (DAR(1)) model. Based on this model, we then proposed an efficient CAC scheme for videoconference traffic over cellular networks, which uses precomputed traffic scenarios for its decision-making and which was shown to clearly excel in comparison with well-known existing approaches, in terms of quality of service (QoS) provisioning to users receiving videoconference traffic. In this paper, we continue our work by enhancing and further studying our scheme for the case of "unknown users" attempting to enter the network and for the case of providing call admission control to web users as well as videoconference ones.
{"title":"Highly Efficient Call Admission Control for Wireless Multimedia Traffic","authors":"Stylianos Chatziperis, P. Koutsakis, M. Paterakis","doi":"10.1109/ICN.2008.17","DOIUrl":"https://doi.org/10.1109/ICN.2008.17","url":null,"abstract":"The development of efficient call admission control schemes for next generation wireless cellular networks remains a challenging and yet unresolved problem, due to the rapidly growing number of multimedia applications and to user mobility. In recent work we have modeled the behavior of H.263 videoconference traces with the use of a discrete autoregressive (DAR(1)) model. Based on this model, we then proposed an efficient CAC scheme for videoconference traffic over cellular networks, which uses precomputed traffic scenarios for its decision-making and which was shown to clearly excel in comparison with well-known existing approaches, in terms of quality of service (QoS) provisioning to users receiving videoconference traffic. In this paper, we continue our work by enhancing and further studying our scheme for the case of \"unknown users\" attempting to enter the network and for the case of providing call admission control to web users as well as videoconference ones.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128031380","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 performance of a TCP connection is typically dictated by what the network can provide rather than what the application would like to achieve. In particular, the additive-increase multiplicative-decrease (AIMD) mechanism employed by TCP hinges on its ability to meet specific throughput requirements since it has to respond to congestion signals promptly by decreasing its sending rate. The level and the timing of congestion signals impose strict limitations on the achievable throughput over short time-scales. To that end, this paper presents a new architecture, whereby a set of TCP connections (we refer to them as the Stunts) sacrifice their performance on behalf of another TCP connection (we refer to it as the Free) by picking up a delegated subset of the congestion signals and reacting to them in lieu of the free connection. This gives the Free connection just enough freedom to meet specific throughput requirements as requested by the application, without affecting the level of congestion in the network. We evaluate our architecture via extensive simulation experiments.
{"title":"Liberating TCP: The Free and the Stunts","authors":"Jason Valdez, Mina Guirguis","doi":"10.1109/ICN.2008.109","DOIUrl":"https://doi.org/10.1109/ICN.2008.109","url":null,"abstract":"The performance of a TCP connection is typically dictated by what the network can provide rather than what the application would like to achieve. In particular, the additive-increase multiplicative-decrease (AIMD) mechanism employed by TCP hinges on its ability to meet specific throughput requirements since it has to respond to congestion signals promptly by decreasing its sending rate. The level and the timing of congestion signals impose strict limitations on the achievable throughput over short time-scales. To that end, this paper presents a new architecture, whereby a set of TCP connections (we refer to them as the Stunts) sacrifice their performance on behalf of another TCP connection (we refer to it as the Free) by picking up a delegated subset of the congestion signals and reacting to them in lieu of the free connection. This gives the Free connection just enough freedom to meet specific throughput requirements as requested by the application, without affecting the level of congestion in the network. We evaluate our architecture via extensive simulation experiments.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125892220","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}
This paper deals with an analytic solution of spectrum changes that appear in nonlinear discrete systems without memory whose transfer characteristics can be approximated via piecewise linear function. The paper also deals with relations between the mutual harmonics ratio and the approximation parameters. Furthermore, the dependence of the harmonics ratio on the amplitude of a harmonic input signal is presented for the most common systems whose transfer characteristics are approximated via piecewise linear function.
{"title":"Spectral Characteristics of Nonlinear Systems Approximated by Piecewise Linear Function","authors":"J. Schimmel, I. Koula, J. Misurec, Z. Smékal","doi":"10.1109/ICN.2008.63","DOIUrl":"https://doi.org/10.1109/ICN.2008.63","url":null,"abstract":"This paper deals with an analytic solution of spectrum changes that appear in nonlinear discrete systems without memory whose transfer characteristics can be approximated via piecewise linear function. The paper also deals with relations between the mutual harmonics ratio and the approximation parameters. Furthermore, the dependence of the harmonics ratio on the amplitude of a harmonic input signal is presented for the most common systems whose transfer characteristics are approximated via piecewise linear function.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124988806","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}
Hsiang-Fu Yu, Hung-Chang Yang, Chu-Yi Chien, Yao-Tien Wang
Data broadcasting is independent of client arrival rate, and thus it is very suitable to transmit popular videos that interest many clients at a particular period of time. One broadcasting method (called periodic broadcasting) is to partition a video into segments, which are then simultaneously broadcast on several data channels. Once clients want to watch the video, they download the segments from these channels. Specially, the skyscraper broadcasting (SkB), client-centric approach (CCA), greedy disk-conserving broadcasting (GDB) schemes were proposed to support a client with a small bandwidth. This paper presents a limited-client-capability broadcasting (LCCB) scheme, which achieves small waiting time, bandwidth consumption, and buffer demand on the client side. In comparison with SkB, CCA, and GDB, LCCB gains smaller waiting time. Extensive simulation results indicate that LCCB also requires lower client buffer spaces than SkB, CCA, and GDB.
{"title":"A Limited-Client-Capability Broadcasting Scheme for VoD Applications","authors":"Hsiang-Fu Yu, Hung-Chang Yang, Chu-Yi Chien, Yao-Tien Wang","doi":"10.1109/ICN.2008.18","DOIUrl":"https://doi.org/10.1109/ICN.2008.18","url":null,"abstract":"Data broadcasting is independent of client arrival rate, and thus it is very suitable to transmit popular videos that interest many clients at a particular period of time. One broadcasting method (called periodic broadcasting) is to partition a video into segments, which are then simultaneously broadcast on several data channels. Once clients want to watch the video, they download the segments from these channels. Specially, the skyscraper broadcasting (SkB), client-centric approach (CCA), greedy disk-conserving broadcasting (GDB) schemes were proposed to support a client with a small bandwidth. This paper presents a limited-client-capability broadcasting (LCCB) scheme, which achieves small waiting time, bandwidth consumption, and buffer demand on the client side. In comparison with SkB, CCA, and GDB, LCCB gains smaller waiting time. Extensive simulation results indicate that LCCB also requires lower client buffer spaces than SkB, CCA, and GDB.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122145008","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}
We conducted in this paper an experimental study on BitTorrent (BT) download performance. Although BT has been widely deployed, many important features about it are not clear yet. For example, what parameter configuration is optimal for its download performance and to what extent is its incentive mechanism efficient in preventing free-riding. We focused our study on two aspects in this paper: the impact of maximum concurrent upload number on download speed; the efficiency of BT's incentive mechanism on fairness and download performance in the face of free-riders. Our results reveal that there is not an uniform value for the optimal maximum concurrent upload number, and that BT's incentive mechanism is robust to free-riders at a large scale, however seed's upload capacity should be good engineered and BT's incentive mechanism deserve to be improved in some aspects, e.g., optimistic unchoke.
{"title":"Understanding BitTorrent Download Performance","authors":"Dongliang Guan, Jiangtao Wang, Yue Zhang, Junni Dong","doi":"10.1109/ICN.2008.16","DOIUrl":"https://doi.org/10.1109/ICN.2008.16","url":null,"abstract":"We conducted in this paper an experimental study on BitTorrent (BT) download performance. Although BT has been widely deployed, many important features about it are not clear yet. For example, what parameter configuration is optimal for its download performance and to what extent is its incentive mechanism efficient in preventing free-riding. We focused our study on two aspects in this paper: the impact of maximum concurrent upload number on download speed; the efficiency of BT's incentive mechanism on fairness and download performance in the face of free-riders. Our results reveal that there is not an uniform value for the optimal maximum concurrent upload number, and that BT's incentive mechanism is robust to free-riders at a large scale, however seed's upload capacity should be good engineered and BT's incentive mechanism deserve to be improved in some aspects, e.g., optimistic unchoke.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128204074","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
扫码关注我们
求助内容：
应助结果提醒方式：