Agenda-at-a-Glance

October 22: Introduction to ONAP: Tutorial

• 8:30-9:00 am Registration and Breakfast
• 9:00-9:30 am Introduction, Mazin Gilbert, AT&T
• 9:30-10:30 am ONAP Architecture Overview, Chaker Al Hakim, Huawei
• 10:30-11:00 am Coffee Break
• 11:00 am-12:00 pm ONAP Instantiation, Michael O’Brien, Amdocs
• 12:00-1:00 pm Lunch
• 1:00-3:00 pm Deep Dive in Specific Areas
  • Service Design and Inventory, Ben Cheung, Nokia
  • DCAE/Microservices, Lusheng Ji, AT&T
  • ONAP Optimization Framework, P N Shankar, AT&T
• 3:00-3:30 pm Coffee Break
• 3:30-5:30 pm Deep Dive in Specific Areas (Cont.)
  • Control Loops and Policies, Pam Dragosh, AT&T
  • ML/Analytics on ONAP, He Yan/Ioannis Broustis, AT&T
• 6:00 pm Offsite Dinner, Gran Morsi, 22 Warren St., New York, NY 10007

October 23: ONAP as an Innovation Platform: Hands-On/Use Case Experiences

• 8:30-9:00 am Registration and Breakfast
• 9:00 am – 12:30 pm Student & Faculty Tracks
• 12:30-1:30 pm Lunch
• 1:30-2:30 pm Academic Presentations and Panel
  • POWDER, Kobus Van der Merwe, University of Utah
  • COSMOS, Dipankar Raychaudhuri, Rutgers University
  • Panel: Phil Robb (Chair), Kobus Van der Merwe, Dipankar Raychaudhuri
• 2:30-3:00 pm Coffee Break
• 3:00-3:45 pm Breakout Session I: ONAP Research Challenges and Opportunities
• 3:50-4:35 pm Breakout Session II: ONAP Research Challenges and Opportunities
• 4:40-5:00 pm Breakout Discussion Summary
• 5:00-5:30 pm Closing Remarks, Phil Robb, Linux Foundation

Student Track: Hands-On Experiences

• 9:00-9:30 am Introduction and Big Picture, Brian Freeman, AT&T
• 9:30-10:30 am Hands-on Development Experiences, Brian Freeman and Marco Platania, AT&T
  • ONAP Instantiation and VNF Descriptor
  • Service Design, Instantiation, and Closed Loop Design
• 10:30-11:00 am Coffee Break
• 11:00 am-12:30 pm Hands-on Development Experiences (Cont.), Brian Freeman and Marco Platania, AT&T
  • ONAP Instantiation and VNF Descriptor
  • Service Design, Instantiation, and Closed Loop Control

Faculty Track: ONAP Use Case Experiences

• 9:00-9:30 am ONAP Use Case Overview, Jennifer Yates, AT&T
• 9:30-10:30 am Use Cases
  • SON, Wireless, and 5G, N. K. Shankar/Ioannis Broustis, AT&T
  • VNF Life Cycle Management, CM, and Multi-cloud, Ajay Mahimkar/Matti Hiltunen, AT&T
• 10:30-11:00 am Coffee Break
• 11:00 am-12:30 pm Use Cases (cont.)
  • SON, Wireless, and 5G
  • VNF Life Cycle Management, CM, and Multi-cloud

Venue Location:
33 Thomas St.
New York City, NY 10007

There are many hotels near the Summit venue. Attendees are responsible for securing their own accommodations.

Airport Information:

From John F. Kennedy Airport (JFK)
Estimated Taxi Cost: $56.50
Estimated Time by Taxi: 35-50 minutes
Estimated Public Transit Cost: $10.00
Estimated Time by Public Transit: 35-50 minutes

From LaGuardia Airport (LGA)
Estimated Taxi Cost: $20-30
Estimated Time by Taxi: 20-35 minutes
Estimated Public Transit Cost: $5.00
Estimated Time by Public Transit: 35-50 minutes

Public Transportation: Bus, train and subway are all options to/from the venue and airport. Please refer to the MTA website for helpful information on public transportation.

Subway – 2, 3, A, C, E, and R stop near 33 Thomas St.

Train – The HOBOKEN-WTC station is the closest to 33 Thomas St.

Bus – M9, X1, X17, X27, and X28 all stop near 33 Thomas St.

Please bring your laptop in order to fully participate and contribute to the event.

Breakfast, lunch and breaks will be provided on Day 1 and Day 2.

Dinner will be provided on Day 1.

The NSF is sponsoring travel grants for qualified academic attendees (particularly students). Attendees who need financial support are encouraged to apply for the travel grants. Higher priority will be given to students who demonstrate serious research interests in ONAP/SDN and who would not be able to attend the event without a travel grant. The evaluation will be based on the registration write up detailed above and a letter from the advisor stating the financial need. If applying for the travel grant, your advisor letter must be submitted in your event application.