From mhasabet at gmail.com Tue Jan 3 00:02:46 2017 From: mhasabet at gmail.com (Muhammad Hosain Abdollahi Sabet) Date: Tue, 3 Jan 2017 11:32:46 +0330 Subject: [Ndn-interest] Fwd: [ndnSIM] Question about sending link state information only to neigbors Message-ID: Mahsa, Nlsr uses ChronoSync mechanism for this purpose in its communication module . To the best of my knowledge, you may find communication module, which handles sync logic, in /src/communication/ and nsync (a copy of Chronosync for nlsr) in /nsync -- Sabet ????? ????? ?? ???? On Tue, Jan 3, 2017 at 9:57 AM, Mahsa Aghajani wrote: > Dear ndnSIM users > > I have a question about broadcasting messages in NLSR. > As I have figured out broadcasting link state information means that a > router sends LSAs to > all of its neighbors and each neighbor receiving this LAS, sends it to all > of its own neighbors too. > if I have figured it correctly could you help me where is the > implementation of this part > in NLSR source code? > > Thanks for your attention and help. > > -- > > Mahsa Aghajani > M.Sc. Student > Department of Computer Engineering > Sharif University of Technology > > > _______________________________________________ > ndnSIM mailing list > ndnSIM at lists.cs.ucla.edu > http://www.lists.cs.ucla.edu/mailman/listinfo/ndnsim > > -------------- next part -------------- An HTML attachment was scrubbed... URL: From mahsa.aghajani at gmail.com Tue Jan 3 09:23:12 2017 From: mahsa.aghajani at gmail.com (Mahsa Aghajani) Date: Tue, 3 Jan 2017 20:53:12 +0330 Subject: [Ndn-interest] [ndnSIM] Question about sending link state information only to neigbors In-Reply-To: References: Message-ID: Thanks for your answer Mr.Abdollahi Sabet Therefore my interpretation of broadcasting is correct? Does ChronoSync also support sending LSAs only to straight neighbors and not flooding them through the whole network? On Tue, Jan 3, 2017 at 11:32 AM, Muhammad Hosain Abdollahi Sabet < mhasabet at gmail.com> wrote: > Mahsa, > > Nlsr uses ChronoSync > mechanism for this purpose in its communication module > . > To the best of my knowledge, you may find communication module, which > handles sync logic, in > /src/communication/ > and nsync (a copy of Chronosync for nlsr) in > /nsync > > -- > Sabet > > ????? ????? > ?? ???? > > On Tue, Jan 3, 2017 at 9:57 AM, Mahsa Aghajani > wrote: > >> Dear ndnSIM users >> >> I have a question about broadcasting messages in NLSR. >> As I have figured out broadcasting link state information means that a >> router sends LSAs to >> all of its neighbors and each neighbor receiving this LAS, sends it to >> all >> of its own neighbors too. >> if I have figured it correctly could you help me where is the >> implementation of this part >> in NLSR source code? >> >> Thanks for your attention and help. >> >> -- >> >> Mahsa Aghajani >> M.Sc. Student >> Department of Computer Engineering >> Sharif University of Technology >> >> >> _______________________________________________ >> ndnSIM mailing list >> ndnSIM at lists.cs.ucla.edu >> http://www.lists.cs.ucla.edu/mailman/listinfo/ndnsim >> >> > -- Mahsa Aghajani M.Sc. Student Department of Computer Engineering Sharif University of Technology -------------- next part -------------- An HTML attachment was scrubbed... URL: From mayutan.arumaithurai at gmail.com Wed Jan 4 03:43:55 2017 From: mayutan.arumaithurai at gmail.com (Mayutan A.) Date: Wed, 4 Jan 2017 12:43:55 +0100 Subject: [Ndn-interest] [CFP] ACM SIGCOMM 2017 (Registration Deadline: 20 January 2017) Message-ID: ==================================================== CALL FOR PAPERS: Standard Track, Experience Track ACM SIGCOMM 2017 UCLA, Los Angeles, CA, USA on August 21-25, 2017 http://conferences.sigcomm.org/sigcomm/2017/cfp.html ==================================================== The ACM SIGCOMM 2017 conference seeks papers describing significant research contributions to the field of computer and data communication networks. We invite submissions on a wide range of networking research, including, but not limited to: - Network architectures and algorithms - Distributed systems design, implementation & application - Enterprise, datacenter, and storage area networks - SDN, NFV, and network programming - Experimental results from operational networks or network applications - Measurement of and statistics methods/machine learning/dat mining applied to networks - Network monitoring and diagnosis - Formal methods and network verification - Economic aspects of the Internet - Energy-aware communication - Network management and operations - Network security and privacy, censorship, transparency - Network, transport, and application-layer protocols - Fault-tolerance, reliability, and troubleshooting - Operating system and host support for networking - Novel physical layer technologies - Networking hardware (Router/switch/NIC) design - P2P and content (including video) distribution networks - Cloud and wide-area networking systems & infrastructure - Resource management, QoS, and signaling - Routing, traffic engineering, switching, and addressing - Wireless, mobile, and sensor networks - Edge, access, and home networks - Innovative uses of network data beyond communication In addition to the main conference, SIGCOMM 2017 will have a series of co-located workshops, tutorials, poster and demo sessions, a travel grant program, and conference best paper(s) and SIGCOMM awards. For the criteria for the selection of the conference best paper award(s), see Best Paper Award Guidelines. SUBMISSIONS SIGCOMM is a highly selective conference where full papers typically report novel results firmly substantiated by experimentation, deployment, simulation, or analysis. Submissions should be in two-column, 10-point format, and can be up to 12 pages in length with as many additional pages as necessary for references. Detailed submission instructions can be found on the conference web site. EXPERIENCE TRACK In addition to submissions considered for the standard track, SIGCOMM 2017 will also include a submission category for experience papers on the design, analysis, and evaluation of techniques in commercial (or otherwise widespread) deployment. Authors must explicitly indicate whether a submission is to be considered for this track or the standard track. (Further information in the detailed submission instructions.) ETHICAL CONCERNS Authors must as part of the submission process attest that their work complies with all applicable ethical standards of their home institution(s), including, but not limited to privacy policies and policies on experiments involving humans. Note that submitting research for approval by one's institution's ethics review body is necessary, but not sufficient ? in cases where the PC has concerns about the ethics of the work in a submission, the PC will have its own discussion of the ethics of that work. The PC takes a broad view of what constitutes an ethical concern, and authors agree to be available at any time during the review process to rapidly respond to queries from the PC chairs regarding ethical standards. ==================================================== IMPORTANT DATES Paper Registration Deadline: January 20, 2017 (5:00pm PST) Paper Submission Deadline: January 27, 2017 (5:00pm PST) Acceptance Notification: May 5, 2017 Conference dates: August 21-25, 2017 ==================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From lanwang at memphis.edu Mon Jan 9 04:59:50 2017 From: lanwang at memphis.edu (Lan Wang (lanwang)) Date: Mon, 9 Jan 2017 12:59:50 +0000 Subject: [Ndn-interest] Named Data Networking Community Meeting (NDNcomm) 2017 (Deadline: 1/23/17) Message-ID: <70A000E9-D577-4D90-BA50-E2CED3111323@memphis.edu> Call for Contributions Named Data Networking Community Meeting (NDNcomm) 2017 March 23-24, 2017 Memphis, TN, USA http://www.caida.org/workshops/ndn/1703/ Submission deadline: 23:59 EST, Monday, Jan. 23, 2017 The organizing committee invites you to contribute to NDNComm 2017 to be held at the University of Memphis, Memphis, TN, USA on March 23-24, 2017. NDNComm is an annual event that brings together a large community of researchers, users and other parties interested in Named Data Networking (NDN). NDN is an instance of Information Centric Networking (ICN), which allows named content to be accessed directly rather than through network hosts resulting in a network service model that is much better aligned with application requirements. Named content offers many advantages, such as reliability, security, scalability and robustness in communication. In addition, NDN is also highly suitable for newly emerging IoT applications. NDNcomm provides a community forum to discuss the state of the NDN software platform and testbed, and guide the evolution of the NDN architecture. As the NSF NDN-NP project concludes its final project year, NDNcomm 2017 will highlight the research results from this project team, in particular the IoT and multimedia applications developed by the project. Moreover, we invite submissions from the broader NDN community for presentations, posters, demos and panels on topics including but not limited to: ? NDN applications, such as scientific data, education, entertainment, tactical edge, smart cities and transportation; ? NDN support for IoT, mobile, and ad hoc environments; ? Security and privacy at different layers of the architecture; ? Management of NDN networks; ? Experience with NDN experimentation; ? Strategies to stimulate NDN development, both from research and commercial perspectives. Submission Instructions Submissions should be one page in PDF format containing a title, authors and an abstract. The title should start with ?Presentation:?, ?Poster:?, ?Demo:? or ?Panel:?. Please submit your abstract using http://ndncomm2017.named-data.net/. Deadlines ? Abstracts for presentations, posters, demos and panels: 23:59 EST, Monday, Jan. 23, 2017 ? Notifications: 23:59 EST, Friday, Feb. 10, 2017 Abstract submission is not required for participation in NDNcomm 2017. Interested parties can register for NDNcomm 2017 at http://www.caida.org/workshops/ndn/1703/register.xml and the 4th NDN hackathon on March 25-26, 2017 at http://4th-ndn-hackathon.named-data.net. The community meeting will be webcast. Please visit the NDN website (www.named-data.net) closer to the meeting for instructions. Lan ************************************************ Lan Wang Professor & Chair Department of Computer Science University of Memphis Memphis, TN 38152 Phone: 901-678-1643 URL: http://www.cs.memphis.edu/~lanwang *********************************************** From susmit at cs.colostate.edu Mon Jan 9 14:51:30 2017 From: susmit at cs.colostate.edu (Susmit) Date: Mon, 9 Jan 2017 15:51:30 -0700 Subject: [Ndn-interest] 4th NDN Hackathon - Call for Hacks Message-ID: ====================================== CALL FOR HACKS The 4th Named Data Networking (NDN) Hackathon University of Memphis, TN ====================================== ------------------------------------------ IMPORTANT DATES ------------------------------------------ Submission deadline: March 1, 2017 Acceptance notification: March 7, 2017 Team Formation: March 24th, 2017 Hackathon: March 25th, 26th, 2017 ------------------------------------------ WEBSITE AND PROGRAM ------------------------------------------ http://4th-ndn-hackathon.named-data.net http://4th-ndn-hackathon.named-data.net/program.html ------------------------------------------ REGISTRATION LINK ------------------------------------------ https://www.eventbrite.com/e/4th-ndn-hackathon-tickets-29700938306 ------------------------------------------ CALL FOR HACKS ------------------------------------------ The NDN team is organizing the 4th NDN Hackathon on March 25th and March 26th at University of Memphis, TN. We solicit hackathon proposals that advance the state of NDN. Participants will have approximately **12 hours** to work on their projects. We encourage projects that: - directly address NDN research needs, - create new NDN tools or modify existing tools, - create or improve documentation and how-to guides. ------------------------------------------ SUBMISSION GUIDELINES ------------------------------------------ Proposals should be submitted via email to <4th-ndn-hackathon at named-data.net>. The submissions should include: - 1 page description PDF that includes the following: -- Contact information of submitter -- Problem statement -- Planned tasks to accomplish -- Knowledge requirements, and -- Expected outcome by the end of the hackathon. - 1 PPTx/PDF slide, listing the project leader(s) and summarizing the problem, contribution, tasks, required knowledge, and expected outcome. All submitted proposals will be reviewed by the hacking Committee. If accepted, the project leader is expected to give a 5 minute ?pitch? presentation at the beginning of the Hackathon, soliciting participation from attendees. We hope that this hackathon will be a fun event for everyone and that projects will lead to collaborations extending beyond the hackathon. We look forward to your participation in the hackathon. From Matteo.Bertolino at eurecom.fr Tue Jan 10 08:30:39 2017 From: Matteo.Bertolino at eurecom.fr (Matteo Bertolino) Date: Tue, 10 Jan 2017 17:30:39 +0100 Subject: [Ndn-interest] About Must Be Fresh Message-ID: <20170110173039.r8jfc0wqh44k848c@webmail.eurecom.fr> On the packet specification section of the website (here: http://named-data.net/doc/ndn-tlv/interest.html#mustbefresh), there is written: The FreshnessPeriod carried in each Data packet (Data Section) is set by the original producer. It starts counting down when the Data packet arrives at a node. Consequently if a node is N hops away from the original producer, it may not consider the Data stale until N X FreshnessPeriod after the Data is produced. Then, I do not completely agree with the last sentence. I would write [...] it may not consider the Data stale until N x T after the Data is produced, where T is the average time requested to send the requested Data packet between two nodes on the path producer-consumer. What do you think about it? ------------------------------------------------------------------------------- This message was sent using EURECOM Webmail: http://webmail.eurecom.fr From lixia at CS.UCLA.EDU Tue Jan 10 08:52:41 2017 From: lixia at CS.UCLA.EDU (Lixia Zhang) Date: Tue, 10 Jan 2017 08:52:41 -0800 Subject: [Ndn-interest] About Must Be Fresh In-Reply-To: <20170110173039.r8jfc0wqh44k848c@webmail.eurecom.fr> References: <20170110173039.r8jfc0wqh44k848c@webmail.eurecom.fr> Message-ID: <9C8B3EFF-CB07-4C37-B79B-AB780D32FE7E@cs.ucla.edu> > On Jan 10, 2017, at 8:30 AM, Matteo Bertolino wrote: > > On the packet specification section of the website (here: http://named-data.net/doc/ndn-tlv/interest.html#mustbefresh), there is written: > > The FreshnessPeriod carried in each Data packet (Data Section) is set by the original producer. It starts counting down when the Data packet arrives at a node. Consequently if a node is N hops away from the original producer, it may not consider the Data stale until N X FreshnessPeriod after the Data is produced. this is the theoretical upper bound. > Then, I do not completely agree with the last sentence. I would write [...] it may not consider the Data stale until N x T after the Data is produced, where T is the average time requested to send the requested Data packet between two nodes on the path producer-consumer. this is the expected period. > > What do you think about it? > > ------------------------------------------------------------------------------- > This message was sent using EURECOM Webmail: http://webmail.eurecom.fr > > _______________________________________________ > Ndn-interest mailing list > Ndn-interest at lists.cs.ucla.edu > http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest From mayutan.arumaithurai at gmail.com Wed Jan 11 00:38:04 2017 From: mayutan.arumaithurai at gmail.com (Mayutan A.) Date: Wed, 11 Jan 2017 09:38:04 +0100 Subject: [Ndn-interest] ACM SIGCOMM 2017: Call for TUTORIALS (Deadline: February 17, 2017) Message-ID: ==================================================== Call for Tutorials ACM SIGCOMM 2017 UCLA, Los Angeles, CA, USA on August 21-25, 2017 http://conferences.sigcomm.org/sigcomm/2017/cf-tutorials.html ==================================================== We seek to extend the SIGCOMM experience by tutorials on selected topics given by renowned scientists and practitioners in their fields. We therefore solicit proposals for full-day or half-day tutorials on topics relevant to the SIGCOMM community. Tutorials must cover advanced topics that fit the scope of SIGCOMM and are of current interest to the SIGCOMM community. Tutorials may be lectures, interactive workshops, hands-on training, or any combination of the above. Exploring diverse ways of interacting with the audience and cross disciplinary topics are welcome. WHERE TO SUBMIT Tutorial proposals should be submitted in PDF format, should not exceed three (3) pages in total, and be sent to tutorialchairs17 at sigcomm.org. PROPOSALS MUST INCLUDE - A motivation for the tutorial (why this, why now, why at SIGCOMM?) - An outline of the tutorial content, including its tentative schedule (over a half-day or full-day) - The type of tutorial (e.g., lecture vs. hands-on) - References to previous iterations of the tutorial (if applicable) including their date, venue, topics and number of participants and the motivation for the new proposal - Venue requirements for the tutorial room (please note that our capabilities in fulfilling unusual requests are limited) - Requirements for the attendees (e.g., must bring own laptop or other hardware, familiarity with certain technologies or topics, etc.) - Any restrictions (e.g., number of participants) IMPORTANT NOTES -It is recommended that there are up to three speakers for a full-day tutorial and up to two speakers for a half-day tutorial. - Tutorials will likely be held in parallel with the workshops, i.e., Monday and/or Friday of the SIGCOMM week. - Upon acceptance of a tutorial proposal, either the tutorial co-chair or the tutorial speakers can request a cancellation of the tutorial if there is clear evidence indicating low attendance of the tutorial by the early registration deadline. ==================================================== IMPORTANT DATES Proposals due: February 17, 2017 Notification of Acceptance: February 24, 2017 ==================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From mayutan.arumaithurai at gmail.com Wed Jan 11 01:13:07 2017 From: mayutan.arumaithurai at gmail.com (Mayutan A.) Date: Wed, 11 Jan 2017 10:13:07 +0100 Subject: [Ndn-interest] ACM SIGCOMM 2017: Call for (9) WORKSHOPS Message-ID: ==================================================== Call for (9) Workshops ACM SIGCOMM 2017 UCLA, Los Angeles, CA, USA on August 21-25, 2017 ==================================================== We are pleased to inform that ACM SIGCOMM 2017 will have the following 9 workshops: 1) ACM SIGCOMM 2017 Workshop on Mobile Edge Communications (MECOMM?2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-mecomm.html 2) ACM SIGCOMM 2017 Workshop on Mobility in the Evolving Internet Architecture (MobiArch?2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-mobiarch.html 3) ACM SIGCOMM 2017 Workshop on Kernel-Bypass Networks (KBNets?17) http://conferences.sigcomm.org/sigcomm/2017/workshop-kbnets.html 4) ACM SIGCOMM 2017 Workshop on Big Data Analytics and Machine Learning for Data Communication Networks (Big-DAMA 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-big-dama.html 5)ACM SIGCOMM 2017 2nd Workshop on QoE-based Analysis and Management of Data Communication Networks (Internet-QoE 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-internet-qoe.html 6) ACM SIGCOMM 2017 1st International Workshop on Hot Topics in Container Networking and Networked Systems (HotConNet?17) http://conferences.sigcomm.org/sigcomm/2017/workshop-hotconnet.html 7) ACM SIGCOMM 2017 Reproducibility Workshop (Reproducibility?17) http://conferences.sigcomm.org/sigcomm/2017/workshop-reproducibility.html 8)ACM SIGCOMM 2017 Workshop on Virtual Reality and Augmented Reality Network (VR/AR Network 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-vrar-network.html 9)ACM SIGCOMM 2017 The Third Workshop on Networking and Programming Languages (NetPL 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-netpl.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From aa at CS.UCLA.EDU Wed Jan 11 08:37:45 2017 From: aa at CS.UCLA.EDU (Alex Afanasyev) Date: Wed, 11 Jan 2017 08:37:45 -0800 Subject: [Ndn-interest] [CFP] 4th INFOCOM 2017 NOM Workshop Message-ID: ** Deadline extended until January 17, 2017 ** ========================================================= CALL FOR PAPERS The fourth INFOCOM 2017 Workshop on Name-Oriented Mobility: Architecture, Algorithms and Applications (INFOCOM 2017 NOM Workshop) Atlanta, GA, U.S.A. on May 1, 2017 http://infocom2017.ieee-infocom.org/workshop/nom ========================================================= The organizing committee is delighted to invite you to the fourth INFOCOM 2017 Workshop on Name-Oriented Mobility: Architecture, Algorithms and Applications (INFOCOM 2017 NOM Workshop) in Atlanta, GA, U.S.A. on May 1, 2017. Mobility support facing unprecedented challenges due to ever increasing number of mobile devices at global scale, ever increasing ranges of diversity of these devices, and ever increasing demand of both data volumes and security requirements by these devices; these challenges demand a new exploration of supporting architecture. Information-Centric Networking (ICN) is a promising direction to transition towards the data-oriented communication with one of the research focus targeting specifically mobile and wireless environments. In recent years, ICN is attracting a widespread interest from academia and industry, with involvements from industry forums, and consortiums. Instead of host-to-host communication model, as in the current Internet architecture, named-oriented networking shifts communication towards a data-centric model that focuses on retrieving named and secured data, instead of host-to-host connections. ICN secures named data directly, giving it an advantage over current Internet solutions that only secure the communication channels between hosts, a mismatch for wireless and mobile networks. Furthermore, ICN?s data-centricity (i.e., independence of specific attachment points in the underlying networks) makes it a promising direction for 5G networks which aim to utilizes multiple radios nodes with connectivity across multiple radio technologies Name-oriented networking offers a new mobility network paradigm to meet mobile device characters and mobile data routing, processing, storage, and retrieval. Thanks to its native design based on data naming (request for data forwarded based on data?s names and data is returned using the reverse path of the request), name-oriented networking enables user and devices mobility across multiple radio technologies and is a good candidate for mobile/wireless networks, including 5G networks. In addition, ICN technology is promising in offering a scalable networking layer for IoT applications, including massive sensor devices that suffer from the lack of mobility management in the IP architecture and the lack an efficient storage, security, and sharing means. ========================================================= IMPORTANT DATES Submission Deadline: January 17, 2017 11:59pm EDT (extended) Acceptance Notification: March 1, 2017 Workshop date: May 1st, 2017 ========================================================= Sincerely, Jun Bi (Tsinghua University, China), Bertrand Mathieu (Orange, France), and Alex Afanasyev (UCLA, USA) INFOCOM 2017 NOM Workshop Workshop Co-Chairs From lanwang at memphis.edu Wed Jan 18 05:32:37 2017 From: lanwang at memphis.edu (Lan Wang (lanwang)) Date: Wed, 18 Jan 2017 13:32:37 +0000 Subject: [Ndn-interest] Named Data Networking Community Meeting (NDNcomm) 2017 (Deadline: 1/23/17) Message-ID: <30FF2B47-0992-486E-9DF8-F3E4BBC70679@memphis.edu> Deadline: 1/23/17 Call for Contributions Named Data Networking Community Meeting (NDNcomm) 2017 March 23-24, 2017 Memphis, TN, USA http://www.caida.org/workshops/ndn/1703/ Submission deadline: 23:59 EST, Monday, Jan. 23, 2017 The organizing committee invites you to contribute to NDNComm 2017 to be held at the University of Memphis, Memphis, TN, USA on March 23-24, 2017. NDNComm is an annual event that brings together a large community of researchers, users and other parties interested in Named Data Networking (NDN). NDN is an instance of Information Centric Networking (ICN), which allows named content to be accessed directly rather than through network hosts resulting in a network service model that is much better aligned with application requirements. Named content offers many advantages, such as reliability, security, scalability and robustness in communication. In addition, NDN is also highly suitable for newly emerging IoT applications. NDNcomm provides a community forum to discuss the state of the NDN software platform and testbed, and guide the evolution of the NDN architecture. As the NSF NDN-NP project concludes its final project year, NDNcomm 2017 will highlight the research results from this project team, in particular the IoT and multimedia applications developed by the project. Moreover, we invite submissions from the broader NDN community for presentations, posters, demos and panels on topics including but not limited to: ? NDN applications, such as scientific data, education, entertainment, tactical edge, smart cities and transportation; ? NDN support for IoT, mobile, and ad hoc environments; ? Security and privacy at different layers of the architecture; ? Management of NDN networks; ? Experience with NDN experimentation; ? Strategies to stimulate NDN development, both from research and commercial perspectives. Submission Instructions Submissions should be one page in PDF format containing a title, authors and an abstract. The title should start with ?Presentation:?, ?Poster:?, ?Demo:? or ?Panel:?. Please submit your abstract using http://ndncomm2017.named-data.net/. Deadlines ? Abstracts for presentations, posters, demos and panels: 23:59 EST, Monday, Jan. 23, 2017 ? Notifications: 23:59 EST, Friday, Feb. 10, 2017 Abstract submission is not required for participation in NDNcomm 2017. Interested parties can register for NDNcomm 2017 at http://www.caida.org/workshops/ndn/1703/register.xml and the 4th NDN hackathon on March 25-26, 2017 at http://4th-ndn-hackathon.named-data.net. The community meeting will be webcast. Please visit the NDN website (www.named-data.net) closer to the meeting for instructions. Lan ************************************************ Lan Wang Professor & Chair Department of Computer Science University of Memphis Memphis, TN 38152 Phone: 901-678-1643 URL: http://www.cs.memphis.edu/~lanwang *********************************************** Lan Lan Lan From s.h.ahmed at ieee.org Sun Jan 22 17:42:30 2017 From: s.h.ahmed at ieee.org (Syed Hassan Ahmed) Date: Mon, 23 Jan 2017 10:42:30 +0900 Subject: [Ndn-interest] IEEE VTC Spring 2017: 2nd RAFNET Workshop [02 Weeks in Submission] Message-ID: [Please accept our apologies if you have received multiple copies] --------------------------------- Call For Papers [RAFNET Workshop] --------------------------------- 2nd International Workshop on Research Advancements in Future Networking Technologies URL: http://rafnetworkshop.wixsite.com/2017 To be held in conjunction with the IEEE 85th Vehicular Technology Conference: VTC2017-Spring, 4?7 June 2017, Sydney, Australia. Main Conference website: http://ieeevtc.org/vtc2017spring/ --------------------- Accepted Papers will be included in IEEE VTC Main Conference Proceedings and published to IEEE Xplore. Also, good quality papers from RAFNET will be selected for the following special issues, where authors have to follow the extended version ethics to avoid copyright issues: ? 1. "Special Issue on Role of Big Data Analytics in a Sustainable Smart City" Sustainable Cities and Society (Elsevier, IF: 1.0) 2. "Special Issue on Towards Secure, Privacy-Preserving, and Reliable Smart Cities and Society" Sustainable Cities and Society (Elsevier, IF: 1.0) 3. "Special Issue on Future Networking Research Plethora for Smart Cities" Future Generation Computer Systems (Elsevier, IF: 2.4) --------------------- Scope: RAFNET aims to bring together researchers, academics, individuals working on selected areas of future internet architectures along with 5G implications and share their new ideas, latest findings and results in the following topics but not limited to: - Future Internet in Wireless Sensor Networks - Future Internet in Vehicular Ad Hoc Networks - Future Internet in Internet of Things - Future Internet in Smart Grid - Future Internet in Machine to Machine - Future Internet in Big Data - Future Internet and 5G architectural designs - 5G advancements in VANETs - Interest/Data Forwarding in Content Centric Networks - Interest/Data Forwarding in Named Data Networks - Analysis of Content-Centric Networking in current network paradigms - Analysis of Named Data Networking in current network paradigms - Transport layer issues in Future Internet architectures - Real-time Test Beds and experimental Results - Cellular Networking and its emergence with Future Internet - Multimedia Applications and Feasibility with Future Internet architectures - Smart and Wireless Cities and Future Internet cohesion Important Dates: Paper Submission Due: February 05, 2017 Notifications Due Date: March 01, 2017 Camera-Ready Version: April 1, 2017 RAFNET Chairing Committee: Syed Hassan Ahmed, Kyungpook National University, Daegu, Republic of Korea. Waleed Ejaz, Ryerson University, Toronto, Canada. Safdar Hussain Bouk, Kyungpook National University, Daegu, Republic of Korea. Tanveer Zia, Charles Sturt University, Australia. Danda B. Rawat, Howard University, Washington D.C., USA. Submission Link: https://vtc2017s-rr-wks.trackchair.com/track/1582 For submission guidelines, please follow instructions on the IEEE VTC website. For any queries, please contact RAFNET chairs. Best Regards, Syed Hassan Ahmed Kyungpook National University, Korea. https://sites.google.com/site/shahmedknu/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From nmgordon at memphis.edu Tue Jan 24 13:35:36 2017 From: nmgordon at memphis.edu (Nick Gordon) Date: Tue, 24 Jan 2017 15:35:36 -0600 Subject: [Ndn-interest] NLSR 0.3.1 release Message-ID: <3c6ad960-c281-f945-bd21-7a185c026212@memphis.edu> Everyone, We are happy to announce the release of version 0.3.1 of Named-data Link State Routing Protocol (NLSR). Detailed release notes can be found at: http://named-data.net/doc/NLSR/0.3.1/RELEASE-NOTES.html More information about NLSR, tutorials, installation and configuration guides, and other useful information can be found at: http://named-data.net/doc/NLSR/0.3.1/ * * * NLSR Developers and Contributors: Vince Lehman, A K M Mahmudul Hoque, Adam Alyyan, Syed Obaid Amin, Muktadir Chowdhury, Ashlesh Gawande, Minsheng Zhang, Nicholas Gordon, Laqin Fan, Lan Wang, Alexander Afanasyev, Spyridon Mastorakis, Jiewen Tan, Yingdi Yu, Lixia Zhang, Junxiao Shi, Eric Newberry, Beichuan Zhang Thanks, Nicholas Gordon From i.psaras at ucl.ac.uk Wed Jan 25 04:09:59 2017 From: i.psaras at ucl.ac.uk (Psaras, Ioannis) Date: Wed, 25 Jan 2017 12:09:59 +0000 Subject: [Ndn-interest] CFP: Workshop on Information-Centric Fog Computing (ICFC) at IFIP Networking 2017 Message-ID: <48920E1B-7705-4784-9F9B-4D9A042E221B@live.ucl.ac.uk> Dear colleagues, please see the CFP below, which should be of interest to people in this group. Apologies for cross-posting. Best regards, Yiannis. ====== Call For Papers ====== Workshop on Information-Centric Fog Computing (ICFC) (in conjunction with IFIP Networking 2017) 12-16 June 2017, Stockholm, Sweden Web: http://networking.ifip.org/2017/index.php/workshops/workshop-on-information-centric-fog-computing-icfc === Overview === Fog Computing aims to support the Internet of Things (IoT) through ultra low latency, ultra fast data processing, high security and reliability and highly efficient resource utilisation. However, the current approaches to Fog/Edge Computing have raised some concerns with respect to privacy; for example, extending CDN DNS redirection and private key delegation models to numerous applications increases the likelihood of exposing the edge to further attacks. There is also the challenge of supporting hierarchical and/or multi-access scenarios that go beyond traditional telco-controlled access provision. Furthermore, providing compute resources at the VM-level of granularity may not be suitable for some lightweight and short-lived functions, especially for IoT. These challenges call for alternative networking models that can support higher fluidity in distributing in-network functions, in addition to allowing fast and scalable processing and exchange of information. Over the recent years, Information-centric Networking (ICN) has emerged as a networking paradigm that places information exchange, for the purpose of its processing, in the foreground. ICN brings advantages related to the security, management and dissemination of information, through flexible and information-based routing policies; combining these advantages with the ability to temporarily and spatially decouple communication entities, ICN seems well suited for the Fog Computing paradigm, since computation can happen at the right place any time by virtue of publishing and subscribing to it. This workshop aims at stimulating research focused on the networking models, communication frameworks and security solutions required to facilitate Fog Computing. The research directions will focus on accommodating the requirements of data processing and information networking within emerging, information-focused, networking paradigms such as ICN. This is reflected in a number of aspects, including: enabling short-term content caching, fluid distribution of in-network functions, high-speed data analysis, programmable control and management planes, resiliency and security of fog networks, Machine-to-Machine (M2M) communications, coordinated management, resource consumption, privacy and orchestration of data processing and information production. The outcomes of the workshop should levitate communication frameworks that have the ability to accommodate the immense expansion of business models, applications and services, within future Fog networks. The workshop solicits papers that address aspects of the above areas with a main focus on facilitating networking solutions that enable dynamic and flexible fog networking through joining concepts of softwarisation and virtualisation paradigms for better management and dissemination of information. We encourage papers that address cross-?layer research issues in any combination of these areas, bridging the gaps between IoT, Fog/edge Computing, ICN, Network Function Virtualisation (NFV) and SDN. === Topics of Interest === The list of topics include (but are not limited to): ? Information-Centric Fog models ? Content and service distribution models in Fog computing ? Caching, replication and relaying models in Information-centric Fog networks ? Dynamic in-network computation, e.g., Named Function Networking ? Implementation insights of Fog & Information-?centric Networking architectures ? Virtualisation in Fog systems and Information?-centric Networking ? Security and privacy challenges in Fog computing ? Novel compensation models, such as utilising block-chains ? Computation and communication abstractions ? Orchestration across computation, storage and communication resources for Fog networks ? IoT data storage, analysis and networking in cloud-based ICN ? Programmability in Fog networks ? Fog computing in constrained networks ? Testing and evaluation tools ? Self-?organisation/configuration of Fog resources using Information-?centric approaches ? Traffic models for Information?-centric Fog networks ? Theoretical and experimental evaluation of information-?centric networks used for Fog computing === Important Dates === ? Submission deadline: March 1, 2017 ? Acceptance notification: April 10, 2017 ? Program available online: April 19, 2017 ? Camera ready deadline: April 27, 2017 === Submission Guidelines === All submissions should be written in the English language, with a maximum length limit of 6 printed pages (IEEE two-column format, 10pt), including all the figures, references, and appendices. Submission implies the willingness of at least one author to attend the workshop and present the paper. Accepted papers will be included in the proceedings of IFIP ICFC 2017 and published in the IFIP. Further details on the required paper format, as well as a link to the EDAS submission site can be found at the workshop?s website. === Committees === ++ Workshop Chairs ++ George Polyzos, Athens University of Economics and Business Dirk Trossen, InterDigital Europe Kun Yang, University of Essex ++ Technical Program Chairs ++ Dirk Kutscher, Huawei Ioannis Psaras, University College London ++ Organising Committee ++ Mays AL-Naday, University of Essex Pekka Nikander, Ll co-op, Aalto University B?rje Ohlman, Ericsson Research Martin J Reed, University of Essex ++ Technical Program Committee ++ Mohammed AL-Khalidi, University of Essex Mays AL-Naday, University of Essex Shingo Ata, Osaka University Giovanna Carofiglio, Cisco Toru Hasegawa, Osaka University Petri Laari, Ericsson Research Chathura Magurawalage, University of Essex Nicola Blefari Melazzi, University of Rome ? Tor Vergata Marc Mosko, PARC B?rje Ohlman, Ericsson Research Christos Papadopoulos, Colorado State University Michalis Polychronakis, Stony Brook University Ioannis Psaras, University College London Janne Riihij?rvi, RWTH Aachen University Eve Schooler, Intel (US) Nikos Thomos, University of Essex Dirk Trossen, InterDigital Europe Gareth Tyson, Queen Mary University of London Matthias W?hlisch, Freie Universit?t Berlin Cedric Westphal, Huawei (US) Mick Wilson, Fujitsu (UK) George Xylomenos, Athens University of Economics and Business Lixia Zhang, UCLA -------------- next part -------------- An HTML attachment was scrubbed... URL: From mobinranjbar at hotmail.com Wed Jan 25 11:07:03 2017 From: mobinranjbar at hotmail.com (Mobin Ranjbar) Date: Wed, 25 Jan 2017 19:07:03 +0000 Subject: [Ndn-interest] Problem related to ndnSIM with Redis integration in Content-Store Message-ID: Hi friends, I am going to replace Table data structure with Redis in-memory database in Content-Store for benchmarking purpose. I have downloaded a C++ client for Redis called Redox that has some .h and .hpp files. I have added #include parts in cs-entry.cpp and run ./waf. But there are some errors following below: ./libns3-dev-ndnSIM-debug.so: undefined reference to `ev_io_start` ./libns3-dev-ndnSIM-debug.so: undefined reference to `redisAsyncHandleRead` ./libns3-dev-ndnSIM-debug.so: undefined reference to `ev_io_stop` ./libns3-dev-ndnSIM-debug.so: undefined reference to `redisAsyncHandleWrite` ` I figured out that it does not find those headers but I do not know where do I have to put header definition to make './waf' aware of new module. Any idea about this problem? Where should .h and .hpp files be defined? I have defined them in ndn-all.hpp but no hopes. Thanks for your help. ________ Mobin Ranjbar Software Engineer, Big Data Evangelist and Startup Guy Co-Founder of Iran Startups Founder of Shariksho Editor in Chief at Techly.co Founder of FaraFekr Technology Founder of Hadoop.ir Founder of Big Data Watcher Website | Twitter | Linkedin | skype: mobinranjbar -------------- next part -------------- An HTML attachment was scrubbed... URL: From agawande at memphis.edu Wed Jan 25 14:46:14 2017 From: agawande at memphis.edu (Ashlesh Gawande (agawande)) Date: Wed, 25 Jan 2017 22:46:14 +0000 Subject: [Ndn-interest] Fw: NLSR 0.3.1 release In-Reply-To: <3c6ad960-c281-f945-bd21-7a185c026212@memphis.edu> References: <3c6ad960-c281-f945-bd21-7a185c026212@memphis.edu> Message-ID: ________________________________ From: NLSR Helpdesk List on behalf of Nick Gordon Sent: Tuesday, January 24, 2017 3:35 PM To: NLSR-HELP-L at LISTSERV.MEMPHIS.EDU Subject: NLSR 0.3.1 release Everyone, We are happy to announce the release of version 0.3.1 of Named-data Link State Routing Protocol (NLSR). Detailed release notes can be found at: http://named-data.net/doc/NLSR/0.3.1/RELEASE-NOTES.html More information about NLSR, tutorials, installation and configuration guides, and other useful information can be found at: http://named-data.net/doc/NLSR/0.3.1/ * * * NLSR Developers and Contributors: Vince Lehman, A K M Mahmudul Hoque, Adam Alyyan, Syed Obaid Amin, Muktadir Chowdhury, Ashlesh Gawande, Minsheng Zhang, Nicholas Gordon, Laqin Fan, Lan Wang, Alexander Afanasyev, Spyridon Mastorakis, Jiewen Tan, Yingdi Yu, Lixia Zhang, Junxiao Shi, Eric Newberry, Beichuan Zhang Thanks, Nicholas Gordon -------------- next part -------------- An HTML attachment was scrubbed... URL: From aa at CS.UCLA.EDU Wed Jan 25 21:49:30 2017 From: aa at CS.UCLA.EDU (Alex Afanasyev) Date: Thu, 26 Jan 2017 00:49:30 -0500 Subject: [Ndn-interest] NFD version 0.5.1 release Message-ID: <589B21A4-7AFA-4DE1-9061-A475C15C79F7@cs.ucla.edu> Dear all, We are pleased to announce the release of version 0.5.1 of Named Data Networking Forwarding Daemon (NFD). The detailed notes for the release: https://named-data.net/doc/NFD/0.5.1/RELEASE_NOTES.html Source code, instruction how to install NFD on Ubuntu Linux (14.04, 16.04, and 16.10) and macOS (10.10, 10.11, 10.12), tutorials, HOWTOs, a FAQ and other useful resources are available on the official NFD website: https://named-data.net/doc/NFD/0.5.1/ Binary packages of Ubuntu Linux will be available soon in our main PPA repository (https://launchpad.net/~named-data/+archive/ubuntu/ppa) and are available in the dev-channel PPA (https://launchpad.net/~named-data/+archive/ubuntu/ppa-dev) **NEW** PPA binary packages now include support for arm64, armhf, and ppc64el CPU architectures. * * * Other related updates: - ndn-cxx library to version 0.5.1 https://named-data.net/doc/ndn-cxx/0.5.1/RELEASE_NOTES.html - NLSR to version 0.3.1 https://named-data.net/doc/NLSR/0.3.1/RELEASE-NOTES.html - NDN Essential Tools to version 0.4: https://github.com/named-data/ndn-tools * * * The NDN/NFD Team: Alexander Afanasyev, Junxiao Shi, Beichuan Zhang, Lixia Zhang, Ilya Moiseenko, Yingdi Yu, Wentao Shang, Yanbiao Li, Spyridon Mastorakis, Yi Huang, Jerald Paul Abraham, Steve DiBenedetto, Chengyu Fan, Christos Papadopoulos, Davide Pesavento, Giulio Grassi, Giovanni Pau, Hang Zhang, Tian Song, Haowei Yuan, Hila Ben Abraham, Patrick Crowley, Syed Obaid Amin, Vince Lehman, Lan Wang, Eric Newberry, Yukai Tu, Muktadir Chowdhury, and others (https://named-data.net/project/participants/) From NourElHouda.BenYoussef at wevioo.com Thu Jan 26 04:56:42 2017 From: NourElHouda.BenYoussef at wevioo.com (Nour El Houda Ben Youssef) Date: Thu, 26 Jan 2017 12:56:42 +0000 Subject: [Ndn-interest] NDN forwarding strategies Message-ID: <712FE4E7257849499414892DD92704BC7AA0D23A@INFRAEX02.oxia.corp> Dear community I would like to ask about NDN forwarding strategies? What are the strategies supported and where to find documentation on each strategy ? I already visited NFD wiki: https://redmine.named-data.net/projects/nfd/wiki/StrategyChoice It mentions 6 strategies with no further information on each one I know also that there has been a talk on flooding and smart flooding strategies but I see no information in NFD wiki Best regards [logoslogan.png] Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris - Tunis - Dubai - Alger -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image003.png Type: image/png Size: 4997 bytes Desc: image003.png URL: From NourElHouda.BenYoussef at wevioo.com Thu Jan 26 05:11:28 2017 From: NourElHouda.BenYoussef at wevioo.com (Nour El Houda Ben Youssef) Date: Thu, 26 Jan 2017 13:11:28 +0000 Subject: [Ndn-interest] NDN overhead Message-ID: <712FE4E7257849499414892DD92704BC7AA0D254@INFRAEX02.oxia.corp> Dear community I think overhead with NDN is a very fluctuant metric To work properly I noticed that there is sync interests/data exchanged which I categorize as overhead There is also LSA packets, what are exactly these packets and should we include them n overhead metric Best regards [logoslogan.png] Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris - Tunis - Dubai - Alger -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 4997 bytes Desc: image001.png URL: From mhasabet at gmail.com Thu Jan 26 05:12:20 2017 From: mhasabet at gmail.com (Muhammad Hosain Abdollahi Sabet) Date: Thu, 26 Jan 2017 16:42:20 +0330 Subject: [Ndn-interest] NDN forwarding strategies In-Reply-To: <712FE4E7257849499414892DD92704BC7AA0D23A@INFRAEX02.oxia.corp> References: <712FE4E7257849499414892DD92704BC7AA0D23A@INFRAEX02.oxia.corp> Message-ID: Nour El Houda, You may check out nfd developer guide: https://named-data.net/publications/techreports/ndn-0021-7-nfd-developer-guide/ There is a chapter dedicated to forwarding strategies in which you can probably find what you're looking for. -- Sabet On Thu, Jan 26, 2017 at 4:26 PM, Nour El Houda Ben Youssef < NourElHouda.BenYoussef at wevioo.com> wrote: > Dear community > > > > I would like to ask about NDN forwarding strategies? > > > > What are the strategies supported and where to find documentation on each > strategy ? > > > > I already visited NFD wiki: https://redmine.named-data. > net/projects/nfd/wiki/StrategyChoice > > > > It mentions 6 strategies with no further information on each one > > > > I know also that there has been a talk on flooding and smart flooding > strategies but I see no information in NFD wiki > > > > Best regards > > > > > > *[image: logoslogan.png]* > > *Nour El Houda BEN YOUSSEF KOUB?A*|Doctorante > > Technopark El Ghazela 2088 Tunis- Tunisia > > Phone: +216 31 34 00 14 > > Mobile: +216 40 01 73 56 > > www.wevioo.com > > Paris ? Tunis - Dubai ? Alger > > > > > > > > > > > > _______________________________________________ > Ndn-interest mailing list > Ndn-interest at lists.cs.ucla.edu > http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest > > -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image003.png Type: image/png Size: 4997 bytes Desc: not available URL: From NourElHouda.BenYoussef at wevioo.com Thu Jan 26 05:30:42 2017 From: NourElHouda.BenYoussef at wevioo.com (Nour El Houda Ben Youssef) Date: Thu, 26 Jan 2017 13:30:42 +0000 Subject: [Ndn-interest] NDN forwarding strategies In-Reply-To: References: <712FE4E7257849499414892DD92704BC7AA0D23A@INFRAEX02.oxia.corp> Message-ID: <712FE4E7257849499414892DD92704BC7AA0D26E@INFRAEX02.oxia.corp> Thank you It was indeed very helpful De : Muhammad Hosain Abdollahi Sabet [mailto:mhasabet at gmail.com] Envoy? : jeudi 26 janvier 2017 14:13 ? : Nour El Houda Ben Youssef Cc : ndn-interest at lists.cs.ucla.edu Objet : Re: [Ndn-interest] NDN forwarding strategies Nour El Houda, You may check out nfd developer guide: https://named-data.net/publications/techreports/ndn-0021-7-nfd-developer-guide/ There is a chapter dedicated to forwarding strategies in which you can probably find what you're looking for. -- Sabet On Thu, Jan 26, 2017 at 4:26 PM, Nour El Houda Ben Youssef > wrote: Dear community I would like to ask about NDN forwarding strategies? What are the strategies supported and where to find documentation on each strategy ? I already visited NFD wiki: https://redmine.named-data.net/projects/nfd/wiki/StrategyChoice It mentions 6 strategies with no further information on each one I know also that there has been a talk on flooding and smart flooding strategies but I see no information in NFD wiki Best regards [logoslogan.png] Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris ? Tunis - Dubai ? Alger _______________________________________________ Ndn-interest mailing list Ndn-interest at lists.cs.ucla.edu http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 4997 bytes Desc: image001.png URL: From zpymyyn at hotmail.com Thu Jan 26 05:47:10 2017 From: zpymyyn at hotmail.com (Zhou Pengyuan) Date: Thu, 26 Jan 2017 13:47:10 +0000 Subject: [Ndn-interest] data owner(namespace owner) and producer Message-ID: Hi all, I just read the "Named Data Networking Next Phase (NDN-NP) Project May 2015 - April 2016 Annual Report?. And found a question in chapter 3, what?s the difference between data owner and producer (Figure 3.1)? Thanks. Best, Pengyuan University of Helsinki -------------- next part -------------- An HTML attachment was scrubbed... URL: From lanwang at memphis.edu Thu Jan 26 07:04:27 2017 From: lanwang at memphis.edu (Lan Wang (lanwang)) Date: Thu, 26 Jan 2017 15:04:27 +0000 Subject: [Ndn-interest] NDN overhead In-Reply-To: <712FE4E7257849499414892DD92704BC7AA0D254@INFRAEX02.oxia.corp> References: <712FE4E7257849499414892DD92704BC7AA0D254@INFRAEX02.oxia.corp> Message-ID: <782F4BBE-A368-4495-8762-CA7F3026FDB4@memphis.edu> On Jan 26, 2017, at 7:11 AM, Nour El Houda Ben Youssef > wrote: Dear community I think overhead with NDN is a very fluctuant metric To work properly I noticed that there is sync interests/data exchanged which I categorize as overhead There is also LSA packets, what are exactly these packets and should we include them n overhead metric LSA is link state advertisement. They are generated by the routing protocol NLSR. You can refer to the paper here: https://named-data.net/wp-content/uploads/2016/01/ndn-0037-1-nlsr.pdf Lan Best regards Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris ? Tunis - Dubai ? Alger _______________________________________________ Ndn-interest mailing list Ndn-interest at lists.cs.ucla.edu http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest -------------- next part -------------- An HTML attachment was scrubbed... URL: From NourElHouda.BenYoussef at wevioo.com Fri Jan 27 01:41:19 2017 From: NourElHouda.BenYoussef at wevioo.com (Nour El Houda Ben Youssef) Date: Fri, 27 Jan 2017 09:41:19 +0000 Subject: [Ndn-interest] hyperbolic routing question Message-ID: <712FE4E7257849499414892DD92704BC7AA0D2C5@INFRAEX02.oxia.corp> Dear community I was ranning through Hyperbolic routing steps If I got well HR process, when a consumer needs a content, it issues an interest with the content name and the coordinates fetched in NDNS What are exactly these coordinates, are they the content's producer geographical coordinates? Best regards [logoslogan.png] Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris - Tunis - Dubai - Alger -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 4997 bytes Desc: image001.png URL: From aa at CS.UCLA.EDU Fri Jan 27 11:30:59 2017 From: aa at CS.UCLA.EDU (Alex Afanasyev) Date: Fri, 27 Jan 2017 11:30:59 -0800 Subject: [Ndn-interest] data owner(namespace owner) and producer In-Reply-To: References: Message-ID: > On Jan 26, 2017, at 5:47 AM, Zhou Pengyuan wrote: > > Hi all, > > I just read the "Named Data Networking Next Phase (NDN-NP) Project May 2015 - April 2016 Annual Report?. > > And found a question in chapter 3, what?s the difference between data owner and producer (Figure 3.1)? For example, your iPhone is a data producer for the pictures you're taking. But iPhone itself is not an owner of the pictures, you are. In name-based access control (figure 3.1 that you're referring to), you would be represented by some software entity that will enforce a specific policy for data secrecy that you will define. -- Alex From zpymyyn at hotmail.com Fri Jan 27 12:40:35 2017 From: zpymyyn at hotmail.com (Zhou Pengyuan) Date: Fri, 27 Jan 2017 20:40:35 +0000 Subject: [Ndn-interest] =?gb2312?b?tPC4tDogIGRhdGEgb3duZXIobmFtZXNwYWNl?= =?gb2312?b?IG93bmVyKSBhbmQgcHJvZHVjZXI=?= In-Reply-To: References: , Message-ID: Hi Alex, Thanks for the answer. I still have some confusion. For instance, if I submit my own movie to a platform such as Google Play, they user can buy or rent it there. Then who will be producer and owner? Thanks. Best, Pengyuan ________________________________ ???: Alex Afanasyev ????: 2017?1?28? 3:30 ???: Zhou Pengyuan ??: ndn-interest at lists.cs.ucla.edu ??: Re: [Ndn-interest] data owner(namespace owner) and producer > On Jan 26, 2017, at 5:47 AM, Zhou Pengyuan wrote: > > Hi all, > > I just read the "Named Data Networking Next Phase (NDN-NP) Project May 2015 - April 2016 Annual Report?. > > And found a question in chapter 3, what?s the difference between data owner and producer (Figure 3.1)? For example, your iPhone is a data producer for the pictures you're taking. But iPhone itself is not an owner of the pictures, you are. In name-based access control (figure 3.1 that you're referring to), you would be represented by some software entity that will enforce a specific policy for data secrecy that you will define. -- Alex -------------- next part -------------- An HTML attachment was scrubbed... URL: From NourElHouda.BenYoussef at wevioo.com Mon Jan 30 00:39:54 2017 From: NourElHouda.BenYoussef at wevioo.com (Nour El Houda Ben Youssef) Date: Mon, 30 Jan 2017 08:39:54 +0000 Subject: [Ndn-interest] ASF overhead Message-ID: <712FE4E7257849499414892DD92704BC7AC9527C@INFRAEX02.oxia.corp> Dear community I was trying to evaluate overhead under various forwarding/ routing strategies in mini-ndn with NLSR /best-route combination LSA/sync packets are used to compute overhead with HR/ASF which packets are used to compute overhead, as ndndump files were analyzed no probing packets were found ! best regards [logoslogan.png] Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris - Tunis - Dubai - Alger -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 4997 bytes Desc: image001.png URL: From agawande at memphis.edu Mon Jan 30 07:43:20 2017 From: agawande at memphis.edu (Ashlesh Gawande (agawande)) Date: Mon, 30 Jan 2017 15:43:20 +0000 Subject: [Ndn-interest] ASF overhead In-Reply-To: <712FE4E7257849499414892DD92704BC7AC9527C@INFRAEX02.oxia.corp> References: <712FE4E7257849499414892DD92704BC7AC9527C@INFRAEX02.oxia.corp> Message-ID: For the ASF strategy, what we did was to set the Nonce of ndnping to zero and count all non-zero Nonce as probing overhead for HR. Because there was no other way to distinguish between probe and ping as the interest is same. You may also set the Nonce of the probe to some special value here instead of calling refreshNonce: https://github.com/named-data/NFD/blob/master/daemon/fw/asf-strategy.cpp#L158 Just reposting from mini-ndn list as this might be better suited here. Ashlesh ________________________________ From: Ndn-interest on behalf of Nour El Houda Ben Youssef Sent: Monday, January 30, 2017 2:39:54 AM To: ndn-interest at lists.cs.ucla.edu Subject: [Ndn-interest] ASF overhead Dear community I was trying to evaluate overhead under various forwarding/ routing strategies in mini-ndn with NLSR /best-route combination LSA/sync packets are used to compute overhead with HR/ASF which packets are used to compute overhead, as ndndump files were analyzed no probing packets were found ! best regards [logoslogan.png] Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris - Tunis - Dubai - Alger -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 4997 bytes Desc: image001.png URL: From NourElHouda.BenYoussef at wevioo.com Mon Jan 30 13:04:20 2017 From: NourElHouda.BenYoussef at wevioo.com (Nour El Houda Ben Youssef) Date: Mon, 30 Jan 2017 21:04:20 +0000 Subject: [Ndn-interest] ASF overhead In-Reply-To: References: <712FE4E7257849499414892DD92704BC7AC9527C@INFRAEX02.oxia.corp> Message-ID: <712FE4E7257849499414892DD92704BC7AC962B7@INFRAEX02.oxia.corp> Thank you Ashlesh Just another pragmatic question Isn't the rationale behind CCN to decouple consumers and produces? In another words, when a consumer issues an interest, he does not know the identity of the producer With HR when we issue an interest, we need to add its producer coordinates, doesn't this maneuver violate CCN principles Best regards De : Ashlesh Gawande (agawande) [mailto:agawande at memphis.edu] Envoy? : lundi 30 janvier 2017 16:43 ? : Nour El Houda Ben Youssef; ndn-interest at lists.cs.ucla.edu Objet : Re: ASF overhead For the ASF strategy, what we did was to set the Nonce of ndnping to zero and count all non-zero Nonce as probing overhead for HR. Because there was no other way to distinguish between probe and ping as the interest is same. You may also set the Nonce of the probe to some special value here instead of calling refreshNonce: https://github.com/named-data/NFD/blob/master/daemon/fw/asf-strategy.cpp#L158 Just reposting from mini-ndn list as this might be better suited here. Ashlesh ________________________________ From: Ndn-interest > on behalf of Nour El Houda Ben Youssef > Sent: Monday, January 30, 2017 2:39:54 AM To: ndn-interest at lists.cs.ucla.edu Subject: [Ndn-interest] ASF overhead Dear community I was trying to evaluate overhead under various forwarding/ routing strategies in mini-ndn with NLSR /best-route combination LSA/sync packets are used to compute overhead with HR/ASF which packets are used to compute overhead, as ndndump files were analyzed no probing packets were found ! best regards [logoslogan.png] Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris - Tunis - Dubai - Alger -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 4997 bytes Desc: image001.png URL: From lanwang at memphis.edu Mon Jan 30 16:01:04 2017 From: lanwang at memphis.edu (Lan Wang (lanwang)) Date: Tue, 31 Jan 2017 00:01:04 +0000 Subject: [Ndn-interest] ASF overhead In-Reply-To: <712FE4E7257849499414892DD92704BC7AC962B7@INFRAEX02.oxia.corp> References: <712FE4E7257849499414892DD92704BC7AC9527C@INFRAEX02.oxia.corp> , <712FE4E7257849499414892DD92704BC7AC962B7@INFRAEX02.oxia.corp> Message-ID: <5D149572-FAF2-4062-9B42-BEDC163DD5FC@memphis.edu> Just want to mention that in order to verify the data, the consumer needs to retrieve the producer's key as well. I am not sure if not knowing the identity of the producer is something that the architecture tries to achieve. Lan On Jan 30, 2017, at 4:05 PM, Nour El Houda Ben Youssef > wrote: Thank you Ashlesh Just another pragmatic question Isn't the rationale behind CCN to decouple consumers and produces? In another words, when a consumer issues an interest, he does not know the identity of the producer With HR when we issue an interest, we need to add its producer coordinates, doesn't this maneuver violate CCN principles Best regards De : Ashlesh Gawande (agawande) [mailto:agawande at memphis.edu] Envoy? : lundi 30 janvier 2017 16:43 ? : Nour El Houda Ben Youssef; ndn-interest at lists.cs.ucla.edu Objet : Re: ASF overhead For the ASF strategy, what we did was to set the Nonce of ndnping to zero and count all non-zero Nonce as probing overhead for HR. Because there was no other way to distinguish between probe and ping as the interest is same. You may also set the Nonce of the probe to some special value here instead of calling refreshNonce: https://github.com/named-data/NFD/blob/master/daemon/fw/asf-strategy.cpp#L158 Just reposting from mini-ndn list as this might be better suited here. Ashlesh ________________________________ From: Ndn-interest > on behalf of Nour El Houda Ben Youssef > Sent: Monday, January 30, 2017 2:39:54 AM To: ndn-interest at lists.cs.ucla.edu Subject: [Ndn-interest] ASF overhead Dear community I was trying to evaluate overhead under various forwarding/ routing strategies in mini-ndn with NLSR /best-route combination LSA/sync packets are used to compute overhead with HR/ASF which packets are used to compute overhead, as ndndump files were analyzed no probing packets were found ! best regards Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris - Tunis - Dubai - Alger _______________________________________________ Ndn-interest mailing list Ndn-interest at lists.cs.ucla.edu http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest -------------- next part -------------- An HTML attachment was scrubbed... URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: image001.png Type: image/png Size: 4997 bytes Desc: image001.png URL: From lanwang at memphis.edu Mon Jan 30 19:13:22 2017 From: lanwang at memphis.edu (Lan Wang (lanwang)) Date: Tue, 31 Jan 2017 03:13:22 +0000 Subject: [Ndn-interest] hyperbolic routing question In-Reply-To: <712FE4E7257849499414892DD92704BC7AA0D2C5@INFRAEX02.oxia.corp> References: <712FE4E7257849499414892DD92704BC7AA0D2C5@INFRAEX02.oxia.corp> Message-ID: <5C754D20-0FE6-4D20-BA4F-94B99929A915@memphis.edu> On Jan 27, 2017, at 3:41 AM, Nour El Houda Ben Youssef > wrote: Dear community I was ranning through Hyperbolic routing steps If I got well HR process, when a consumer needs a content, it issues an interest with the content name and the coordinates fetched in NDNS What are exactly these coordinates, are they the content?s producer geographical coordinates? Right now we use the hyperbolic coordinates of the producer as the data?s coordinates. They are not simply geographical coordinates. They are usually based on an embedding of the network topology (embedded in the hyperbolic space). Lan Best regards Nour El Houda BEN YOUSSEF KOUB?A|Doctorante Technopark El Ghazela 2088 Tunis- Tunisia Phone: +216 31 34 00 14 Mobile: +216 40 01 73 56 www.wevioo.com Paris ? Tunis - Dubai ? Alger _______________________________________________ Ndn-interest mailing list Ndn-interest at lists.cs.ucla.edu http://www.lists.cs.ucla.edu/mailman/listinfo/ndn-interest -------------- next part -------------- An HTML attachment was scrubbed... URL: From charif.mahmoudi at nist.gov Tue Jan 31 12:01:50 2017 From: charif.mahmoudi at nist.gov (Mahmoudi, Charif (IntlAssoc)) Date: Tue, 31 Jan 2017 20:01:50 +0000 Subject: [Ndn-interest] Inter-domain routing Message-ID: Hi, We are trying to address some of the inter-domain routing challenges in ICN. We are looking for pointers to existing efforts. We found solutions intra-domain efforts like NLSR (https://doi.org/10.1145/2491224.2491231 ) and CORBA (https://doi.org/10.1109/CCNC.2014.6994403 ). However, not as much on inter-domain routing. Is someone in the community is aware of past/ongoing efforts toward inter-domain routing, please send us some pointers. Thanks for your help, Charif -------------- next part -------------- An HTML attachment was scrubbed... URL: From zpymyyn at gmail.com Thu Jan 26 05:45:25 2017 From: zpymyyn at gmail.com (Pengyuan Zhou) Date: Thu, 26 Jan 2017 15:45:25 +0200 Subject: [Ndn-interest] data owner(namespace owner) and producer Message-ID: <39B0B003-DED1-41F4-9543-8841FF7C7CB3@gmail.com> Hi all, I just read the "Named Data Networking Next Phase (NDN-NP) Project May 2015 - April 2016 Annual Report?. And found a question in chapter 3, what?s the difference between data owner and producer (Figure 3.1)? Thanks. Best, Pengyuan University of Helsinki From mayutan.arumaithurai at gmail.com Tue Jan 31 04:28:43 2017 From: mayutan.arumaithurai at gmail.com (Mayutan A.) Date: Tue, 31 Jan 2017 13:28:43 +0100 Subject: [Ndn-interest] ACM SIGCOMM 2017: Call for TUTORIALS (Deadline: February 17, 2017) Message-ID: ==================================================== Call for Tutorials ACM SIGCOMM 2017 UCLA, Los Angeles, CA, USA on August 21-25, 2017 http://conferences.sigcomm.org/sigcomm/2017/cf-tutorials.html ==================================================== We seek to extend the SIGCOMM experience by tutorials on selected topics given by renowned scientists and practitioners in their fields. We therefore solicit proposals for full-day or half-day tutorials on topics relevant to the SIGCOMM community. Tutorials must cover advanced topics that fit the scope of SIGCOMM and are of current interest to the SIGCOMM community. Tutorials may be lectures, interactive workshops, hands-on training, or any combination of the above. Exploring diverse ways of interacting with the audience and cross disciplinary topics are welcome. WHERE TO SUBMIT Tutorial proposals should be submitted in PDF format, should not exceed three (3) pages in total, and be sent to tutorialchairs17 at sigcomm.org. PROPOSALS MUST INCLUDE - A motivation for the tutorial (why this, why now, why at SIGCOMM?) - An outline of the tutorial content, including its tentative schedule (over a half-day or full-day) - The type of tutorial (e.g., lecture vs. hands-on) - References to previous iterations of the tutorial (if applicable) including their date, venue, topics and number of participants and the motivation for the new proposal - Venue requirements for the tutorial room (please note that our capabilities in fulfilling unusual requests are limited) - Requirements for the attendees (e.g., must bring own laptop or other hardware, familiarity with certain technologies or topics, etc.) - Any restrictions (e.g., number of participants) IMPORTANT NOTES -It is recommended that there are up to three speakers for a full-day tutorial and up to two speakers for a half-day tutorial. - Tutorials will likely be held in parallel with the workshops, i.e., Monday and/or Friday of the SIGCOMM week. - Upon acceptance of a tutorial proposal, either the tutorial co-chair or the tutorial speakers can request a cancellation of the tutorial if there is clear evidence indicating low attendance of the tutorial by the early registration deadline. ==================================================== IMPORTANT DATES Proposals due: February 17, 2017 Notification of Acceptance: February 24, 2017 ==================================================== -------------- next part -------------- An HTML attachment was scrubbed... URL: From mayutan.arumaithurai at gmail.com Tue Jan 31 04:30:57 2017 From: mayutan.arumaithurai at gmail.com (Mayutan A.) Date: Tue, 31 Jan 2017 13:30:57 +0100 Subject: [Ndn-interest] ACM SIGCOMM 2017: Call for (9) WORKSHOPS Message-ID: ==================================================== Call for (9) Workshops ACM SIGCOMM 2017 UCLA, Los Angeles, CA, USA on August 21-25, 2017 ==================================================== We are pleased to inform that ACM SIGCOMM 2017 will have the following 9 workshops: 1) ACM SIGCOMM 2017 Workshop on Mobile Edge Communications (MECOMM?2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-mecomm.html 2) ACM SIGCOMM 2017 Workshop on Mobility in the Evolving Internet Architecture (MobiArch?2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-mobiarch.html 3) ACM SIGCOMM 2017 Workshop on Kernel-Bypass Networks (KBNets?17) http://conferences.sigcomm.org/sigcomm/2017/workshop-kbnets.html 4) ACM SIGCOMM 2017 Workshop on Big Data Analytics and Machine Learning for Data Communication Networks (Big-DAMA 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-big-dama.html 5)ACM SIGCOMM 2017 2nd Workshop on QoE-based Analysis and Management of Data Communication Networks (Internet-QoE 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-internet-qoe.html 6) ACM SIGCOMM 2017 1st International Workshop on Hot Topics in Container Networking and Networked Systems (HotConNet?17) http://conferences.sigcomm.org/sigcomm/2017/workshop-hotconnet.html 7) ACM SIGCOMM 2017 Reproducibility Workshop (Reproducibility?17) http://conferences.sigcomm.org/sigcomm/2017/workshop-reproducibility.html 8)ACM SIGCOMM 2017 Workshop on Virtual Reality and Augmented Reality Network (VR/AR Network 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-vrar-network.html 9)ACM SIGCOMM 2017 The Third Workshop on Networking and Programming Languages (NetPL 2017) http://conferences.sigcomm.org/sigcomm/2017/workshop-netpl.html -------------- next part -------------- An HTML attachment was scrubbed... URL: From lixia at CS.UCLA.EDU Tue Jan 31 17:21:39 2017 From: lixia at CS.UCLA.EDU (Lixia Zhang) Date: Tue, 31 Jan 2017 17:21:39 -0800 Subject: [Ndn-interest] data owner(namespace owner) and producer In-Reply-To: <39B0B003-DED1-41F4-9543-8841FF7C7CB3@gmail.com> References: <39B0B003-DED1-41F4-9543-8841FF7C7CB3@gmail.com> Message-ID: <1C57BE81-33CB-42BC-A700-8C0D5048DEB0@cs.ucla.edu> > On Jan 26, 2017, at 5:45 AM, Pengyuan Zhou wrote: > > Hi all, > > I just read the "Named Data Networking Next Phase (NDN-NP) Project May 2015 - April 2016 Annual Report?. > > And found a question in chapter 3, what?s the difference between data owner and producer (Figure 3.1)? data producer is the one which produced the bits (e.g. your fitbit) data owner is the one who owns/controls the data (e.g. you own your fitbit data) of course in many applications the two can be the same entity. hope this helps. Lixia