• When & Where: Seminars are generally (please, check the timeline and location before coming!) held on:
    • Wednesday afternoon at LINCS (14h-15h, Salle de Conseil) and
    • Thursday afternoon at Barrault (14h-15h, Amphi Saphir).
  • Contact us: if you wish to give a talk, please contact

[Next talks] Archives: [All] [2012] [2011] [2010] [2009] [2008]

23/04/2014DaeYoung Kim (CNU)Some Thoughts on Loc/ID Separation
30/04/2014Uri Yechiali (Tel-Aviv University)Tandem Jackson Networks, Asymmetric Inclusion Processes and Catalan Numbers
14/05/2014Thomas Bonald (Telecom ParisTech)Application of queuing theory to traffic engineering

Date:23/04/2014, 14h - 15h
Room:LINCS, Salle de Conseil
Speaker:DaeYoung Kim (CNU)
Talk:Some Thoughts on Loc/ID Separation
Abstract:Locator(Loc)/identifier(ID) Separation(LIS) was conceived to mitigate the explosion of the DFZ routing table. To be literally exact, every host would be given a Loc in addition to an ID. The talk asserts that provision of Locs in this fashion does not help combat the problem at all; it would only inherit the same fate with the current IP address.What would really help would be use of two-tier Locs, with one set local to a site and another globally relevant. That is to day, use of local addressing(Loc) would be the only exit. Some LIS proposals like ILNP and LISP achieve this by their own tricky definition of Locs. The talk asserts what they really implement is adoption of local addressing, rather than LIS.In LISP, EID(endpoint ID) is also used for routing within a site, thus is semantically overloaded in the same way as IP address is. This also implies semantic overloading isn't the real problem from the start, thus there'd be no rationale for LIS. Semantic overloading (for both identification and location) of an address is rather an intrinsic nature of networking. What people really need is local addressing.If time permits, the talk also would suggest use of ISIS to make the best use of EID in LISP.
Biography:DY is a professor of CNU(Chungnam National University) in South Corea, in the department of Information Communications Engineering, since 1983. He got a bachelor degree from SNU(Seoul National University) and a MS and a PhD degree, both from KAIST(Korea Advanced Institute of Science and Technology), before joining CNU. He's been working on various fields of networking, with recent focus on Future Internet. He's also been active in standardization and REN(research and educational networking) activities, and is current Chair of ISO/IEC JTC 1/SC 6, where OSI once was made, and Chair of APAN(Asia-Pacific Advanced Network), a non-profit consortium similar to Internet 2 (US) and Terena (EU).
Links:back to the list item, list top or summary top

Date:30/04/2014, 14h - 15h
Room:LINCS, Salle du Conseil
Speaker:Uri Yechiali (Tel-Aviv University)
Talk:Tandem Jackson Networks, Asymmetric Inclusion Processes and Catalan Numbers
Abstract:The Tandem Jackson Networkis a system of n sites (queues)in series, where single particles (customers, jobs, packets, etc.) move, one by one anduni-directionally,from one site to the next until they leave the system. (Think, for example, on aproduction line, or on a line in a cafeteria).When each site is a M/M/1 queue, the Tandem Jackson Network is famous for its product-form solution of the multi-dimensional Probability Generating Function of the site occupancies. In contrast, the Asymmetric Inclusion Process (ASIP) is a series of n Markovian queues (sites), each with unbounded capacity, but with unlimited-size batch service. That is, when service is completed at sitek,all particles present there move simultaneously to sitek+1,and form a cluster with the particles present in the latter site. We analyze the ASIP and show that its multi-dimensional Probability Generating Function(PGF) does notposses a product-form solution. We then present a method to calculate this PGF. We further show that homogeneous systems are �optimal� and derive limit laws (when the number of sites becomes large) for various variables (e.g. busy period, draining time, etc.). Considering the occupancies of the sites (queue sizes) we show that occupation probabilities in the ASIP obey a discrete two-dimensional boundary value problem. Solving this problem wefind explicit expressions for the probability that site k is occupied by m particles (m=0,1,2,..).Catalan's numbersare shown to naturally arise in the context of these occupation probabilities. This is a joint work with ShlomiReuveni and IddoEiazar.
Links:back to the list item, list top or summary top

Date:14/05/2014, 14h - 15h
Room:LINCS, Salle du Conseil
Speaker:Thomas Bonald (Telecom ParisTech)
Talk:Application of queuing theory to traffic engineering
Links:back to the list item, list top or summary top