{"title":"A Dynamic Composition Algorithm of Semantic Web Service Based on QoS","authors":"Yan Lu, Zhaozi Gao, Kai Chen","doi":"10.1109/ICFN.2010.27","DOIUrl":"https://doi.org/10.1109/ICFN.2010.27","url":null,"abstract":"Web service composition is an important technology in domain of Web service. It provides an effective solution to complex Web application. In this paper, a new composition algorithm of semantic Web service based on QoS is proposed, which is concerned with the effect of some non-functional factors of service composite quality and the satisfaction with service composition. Experiments are carried out to compare the new algorithm with some other web service composition algorithms and the result shows that the new algorithm can not only ensure the service quality bur also reduce service composite time.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115644768","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}
{"title":"NevML: A Markup Language for Network Topology Visualization","authors":"Haoxiang Wang","doi":"10.1109/ICFN.2010.85","DOIUrl":"https://doi.org/10.1109/ICFN.2010.85","url":null,"abstract":"This paper represents a markup language for describing network topologies, and how these descriptions can be visualized as topology maps. The designed language, NevML, is an XML-based language. Network devices and connections between them can be depicted in NevML and visualized by different types of visualization tools. As a proof-of-concept prototype, SVG is chosen to visualize NevML description in this paper. It is experimented how NevML can be automatically converted into SVG format files by using XSLT stylesheet.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123224757","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}
{"title":"Research on Reliability Model of Practical Software","authors":"Xiao-Bo Bai, J. Ou, Chuan Jiang","doi":"10.1109/ICFN.2010.44","DOIUrl":"https://doi.org/10.1109/ICFN.2010.44","url":null,"abstract":"The modeling technology of software reliability is analyzed in detail in the paper. According to practical software development, the evaluation standard of reliability model of practical software will be explored. The methods of constructing reliability model of practical software is discussed from the point of view of practical application.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125830000","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}
{"title":"Power Control Based on Routing Protocol in Wireless Sensor Networks","authors":"D. Gao, Lulu Liang, Guanghong Xu, Sidong Zhang","doi":"10.1109/ICFN.2010.9","DOIUrl":"https://doi.org/10.1109/ICFN.2010.9","url":null,"abstract":"Power control technology in wireless sensor network (WSN) is of great significance to ensure the network coverage, reduce the power consumption of the nodes, and optimize network performance. In this paper, a new power control based on routing protocol (PCBRP) in the MAC layer is proposed. It operates with the help of routing protocol and calculates optimal transmission power according to the distance between neighbor nodes. A mapping table including optimal transmission power and node’s address is established during the route building procedure. The transmission power can be gotten through searching the table with the address of next hop in latter data transmission. Finally, we implement the PCBRP scheme in a real system and set up a test-bed to illustrate its operations.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127729076","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}
{"title":"Quantum Codes of Minimum Distance Three Constructed from Binary Codes of Odd Length","authors":"Ruihu Li, Gang Chen","doi":"10.1109/ICFN.2010.20","DOIUrl":"https://doi.org/10.1109/ICFN.2010.20","url":null,"abstract":"We give elementary recursive constructions of a pair of nested binary self-orthogonal codes with dual distance two and three for all odd .Consequently, good quantum codes of minimum distance three for such length are obtained via Steane’s construction. Such quantum codes were explicitly constructed before only for a sparse set of lengths.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126462903","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}
{"title":"The Addition of Data Aggregation to SPEED Routing Algorithm While Keeping the Functionality of Available Techniques","authors":"Rassoul Roustaei, F. Y. Fakhr, A. Movaghar","doi":"10.1109/ICFN.2010.65","DOIUrl":"https://doi.org/10.1109/ICFN.2010.65","url":null,"abstract":"Data aggregation is a technique that is used to decrease extra and repetitive data in cluster based routing protocols. As we know SPEED routing algorithm is based on service quality and dose not perform data aggregation. In this article, we try to add an data aggregation technique to the available techniques without interfering with the functions of previous ones. The idea involves virtual configuration of sensors and specification of an individual ID to the created data by the sensors in each region, then data aggregation in relay node is done by this ID, resulting in less energy consumption, lower traffic and repeated data, an increase in network lifetime and better quality of service.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125639002","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}
{"title":"Cryptanalysis and Improvement of a Proxy-protected Signature Scheme","authors":"Xiaoming Hu, Zhe Zhang, Tong Wang","doi":"10.1109/ICFN.2010.63","DOIUrl":"https://doi.org/10.1109/ICFN.2010.63","url":null,"abstract":"Recently, Liu et al. (Liu YC, Wen HA, Lin CL, Hwang T. Proxy-protected signature secure against the undelegated proxy signature attack. Computers and Electrical Engineering 2007; 33: 177-85) proposed one proxy signature scheme that is the improvement of Zhou et al.'s (Zhou Y, Cao Z, Lu R. Provably secure proxy-protected signature schemes based on factoring. Appl Math Comput2005; 164(1):83-98) proxy signature scheme based on the hard problem of integer factorization. In this paper, however,we show that Liu et al.’s scheme and Zhou et al.’s scheme are insecure against the replaced warrant attack: the original signer can prepare a new warrant and then remove the original warrant from the proxy signature to forge a new and valid proxy signature with the new warrant. To avoid the problem, an improved proxy signature scheme is proposed and its security is analyzed.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114350896","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}
{"title":"Management Strategies of Network Users Oriented to the Whole World","authors":"Xue Geng, Fan Xiumei, Liao Lejian","doi":"10.1109/ICFN.2010.12","DOIUrl":"https://doi.org/10.1109/ICFN.2010.12","url":null,"abstract":"The hierarchical network structure based on geographical regionalism realizes the unified division of global computer networks. According to this, if we set data center management server in a proper administrative area, and adopt the globally available network account, then we can design a new uniform Internet user-privilege management system which is more convenient, secure and effective.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132380451","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}
{"title":"A Gated VCO for 10Gb/s PON Systems in 0.18µm CMOS","authors":"Gaowei Gu, En Zhu, Ye Lin","doi":"10.1109/ICFN.2010.94","DOIUrl":"https://doi.org/10.1109/ICFN.2010.94","url":null,"abstract":"A 5GHz Gated VCO for burst-mode operation in 10Gbps GPON and EPON systems is presented. The GVCO consists of four stages of XNOR/XOR cell with voltage-controlled delays, and aligns output clock to burst data within 2 bits time. The GVCO has a tuning range from 4.4GHz to 6.2GHz. The phase noise of the GVCO in steady state circuit is -105dBc/Hz at 5MHz offset. The circuit is implemented in SMIC 0.18µm CMOS process, occupies an area of 425*480µm 2. The power consumption is 35mW (with I/O buffers).","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131850318","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}
{"title":"Congestion Control in TCP/IP Networks with Classical Control Algorithms for Multi Router","authors":"Elahe Moradi","doi":"10.1109/ICFN.2010.87","DOIUrl":"https://doi.org/10.1109/ICFN.2010.87","url":null,"abstract":"The objective of this paper is study the small signal stability of congested TCP networks. The starting point for this analysis is a fluid model describing the interaction of TCP-controlled traffic with congested routers. Assuming integral action in the active queue management scheme, we compute the network’s equilibrium point about which we determine the network’s small –signal dynamics. Some variations on a linear model of Active Queue Management supporting Transmission Control Protocol flows are used to design classical controllers. Specializing to networks comprised of m link and n sources, we study closed loop stability, and we compare queue length in PID controller and PI controller and RED controller for n sources and m routers. The simulation results show that the integrated performance of the PID controller is obviously superior to that of the PI and RED controller.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128698327","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}