| |||||||||||||||
ConCom 2009 : The First International Workshop on Concurrent Communication | |||||||||||||||
Link: http://infonet.cse.kyutech.ac.jp/conf/saint09/ | |||||||||||||||
| |||||||||||||||
Call For Papers | |||||||||||||||
Call for Papers of SAINT2009 Workshop(6) - ConCom 2009
The First International Workshop on Concurrent Communication (ConCom 2009) In Conjunction with SAINT 2009 Seattle, USA July 20 - 24, 2009 http://infonet.cse.kyutech.ac.jp/conf/saint09/ CALL FOR PAPER * THEME OF THE WORKSHOP Communication pathways of the next generation networks will whiteness two prevalent relaxations of singularity and persistence. The relaxation of pathway singularity is related to the parallelism, which allows data flows to be streamed concurrently. Through concurrency, the performance contemporary file sharing systems, automatic backup systems and content distribution networks will achieve exponential growth. Moreover, concurrency will play a key role in future bandwidth-intensive applications that involve the transfer of massive data posing capacity demands reaching Gigabytes and yet Terabytes per day. Such bandwidth-intensive applications include scientific experimentations, High-Definition (HD) media distribution,real-time distance learning, and telemedicine. Pathway persistence is a fundamental principle, which mandates all node/link hops to be active and available concurrently during the data flow transfer.On the other hand, pathway intermittency is relaxation of this principle,which does not mandate such concurrency. However, data flow reachability must be guaranteed. Link and Hop intermittency is now frequently appearing in a number of emergent communication domains. Link intermittency is a physical characteristic of space communication networks due to orbital rotation and occlusions. Hop intermittency is also appearing to be intrinsic to vehicular and aero-networks. It is believed that it is becoming an important issue in emerging personal area networks (PAN) well. Intermittency is also present in peer-to-peer domains. A fundamental feature of P2P is that bulk of the clients are not logically connected 24/7. Thus, systems need to provision for online/offline communication. In large volume content distribution at the macroscopic level, pathways are logically intermittent, but physically persistent. Such macroscopic intermittency has been encountered in content distribution networks (CDN). Large scale media distribution, cooperative backup and large scale physics/science data distribution applications face such logical intermittency. Efficient route scheduling under concurrency and intermittency forms an interesting research challenge. Classically, route can be computed with various levels of knowledge. Interestingly, there is a strong trend towards routing with knowledge about network resources and circuit demand- especially in high performance and scientific experimentation network domain. Internet2's Dynamic Circuit Network (DCN) is one example where large volume connections can be planned even at optical layer for scheduled massive data transfers. Furthermore, space communication network and science networks (such as ESNet) are experimenting with advance scheduling for efficient and quality assured data transfer. This workshop will address the key research issues related to architectural and protocol design of concurrent computation exploiting pathway concurrency and intermittency at the physical and logical levels. Furthermore, this works also has special interest in on-demand scheduling-based communication in this type of networks. Topics of Interest: Concurrent Communication Network Architectures * Distributed Parallel Communication Networks * Multi-stream transport Networks On-Demands Scheduling-based Communication in Concurrent Communication Networks * On-demand Scheduling-based Communication Networks Architectures * On-demand Scheduling-based Communication Protocol Architectures * On-demand Scheduling-based Routing Algorithms * On-demand Scheduling-based Routing Protocols * On-demand Scheduling-based Data Transport Algorithms * On-demand Scheduling-based Data Transport Protocols * On-demand Scheduling-based Application Protocols Intermittent Communication Network Architectures * Space Communication Networks * Disruption/Delay Tolerant Networks (DTNs) * Intermittently Connected Mobile Ad Hoc Networks (ICMAN) * Vehicular Networks (VNets) * Aerospace Networks (AeroNets) * Personal Area Networks (PANs) * Wireless Sensor Forwarding Networks * Peer-to-Peer Content Distribution Networks CDN's * Dynamic Circuit Networks (DCNs) On-Demand Scheduling-based Communication in Intermittent Networks * On-demand Scheduling-based Communication Networks Architectures * On-demand Scheduling-based Communication Protocol Architectures * On-demand Scheduling-based Routing Algorithms * On-demand Scheduling-based Routing Protocols * On-demand Scheduling-based Data Transport Algorithms * On-demand Scheduling-based Data Transport Protocols * On-demand Scheduling-based Application Protocols * PAPERS AND AUTHOR'S KIT Workshop papers should be within 4 pages, no extra page is allowed.The Proceedings of the Symposium and the Workshops will be published, in separated volumes, by the IEEE Computer Society Press. Please follow the instruction on the web below where authors can find Page Form and appropriate pointers for LaTeX Macros. Please visit SAINT 2009 Website (http://infonet.cse.kyutech.ac.jp/conf/saint09/) and select ) Information for Authors * PAPER SUBMISSION Papers should be submitted on-line through my e-mail address otahboub[atmark]cs.kent.edu or otahboub[atmark]kent.edu no later than February 28, 2009. After a review process by Organizers and Program Committeeof the Workshop, authors of accepted papers will be requested to send its final manuscript to IEEE-CS press no later than April 30, 2009. So, authors are kindly requested to submit papers as early as possible to facilitate a review process. * IMPORTANT DATES Workshop Paper Submission: Feburary 28, 2009 Workshop Paper Notification: March 31, 2009 Workshop Final Manuscript: April 30, 2009 Author registration due: TBD Workshop: July 20 - 24, 2009 (exact date is TBD) * REGISTRATION It is the IEEE policy that accepted papers can be published only when IEEE recognized that at least ONE author has completed FULL registration for presentation. So, authors will be requested to register along with the final manuscript. SAINT Conference Registration fees include a copy of the Conference proceedings, a copy of the Workshop proceedings, and admission to the Conference/Workshop sessions. * NOTE The date and length (a full or half day) of the Workshop will be decided by SAINT2009 Organizing Committee taking account of the number submitted of papers, and be notified on the SAINT2009 web. Please also note that, according to the SAINT2009 Organizing Committee, the Workshop is subject to cancellation when the number submitted of papers will not be enough. * ORGANIZER * Omar Y. Tahboub, Kent State University (otahboub[atmark]cs.kent.edu) * PROGRAM COMMITTEE FOR PAPER REVIEW * Ala Al-Fuqaha, West Michigan University Kalamazoo, USA * Ali Abu-EI Humos, Jackson State University, USA * Graciela Perera, Youngstown State University, USA * Javed I. Khan, Kent State University, Kent, OH, USA * Jinhua Guo, University of Michigan - Dearborn * Kathy J. Liszka, University of Akron, OH, USA * Dr. Muhammad Anan, Purdue University Calumet, USA, * Min Sik Kim, Washington State University, USA * Paolo Giaccone, Politecnico di Torino, Italy |
|