Search

Mohammad Hanif

from San Francisco, CA
Age ~74
Get Report
Also known as:
Mohammed H Hanif, Muhammed Hanif, Mohamad Hanif, Mohamd Hanif, Mohammad Hinis, Mohamad Hanly, Muhammed Ramzan
Phone and address:
1688 Pine St, San Francisco, CA 94109
(415) 202-0133
Related to:
Mohammad A Khan, 69Dnashia AkramMohammad Arif, 57Mohammad Munir, 59
Connected to:
Abu HanifArslan M Hanif, 42Aslam M Hanif, 58Haroon Hanif, 58Hasan Hanif, 29Kadir M Hanif, 66Mehdi M Hanif, 58Mohammed Hanif, 49Mohsin Hanif, 42Naim Hanif, 44

Mohammad Hanif Phones & Addresses

  • 1688 Pine St, San Francisco, CA 94109 (415) 202-0133
  • 767 15Th St, San Francisco, CA 94118 (415) 386-9281
  • 375 14Th St, San Francisco, CA 94118 (415) 386-9281
  • Menlo Park, CA
  • 375 14Th Ave APT 205, San Francisco, CA 94118 (510) 467-8928

Resumes

Resumes

Mohammad Hanif Photo 1

Senior Director, Engineering

View page
Location:
San Francisco, CA
Industry:
Computer Networking
Work:
Broadcom
Senior Director, Engineering
Brocade Dec 2008 - Nov 2017
Senior Director, Software Engineering
Cern Mar 2015 - Jun 2017
Contributing Board Member, Cern Openlab
Foundry Networks Apr 2004 - Dec 2008
Senior Manager, Software Engineering
Nexthop Technologies Mar 2003 - Apr 2004
Senior Software Engineer
Education:
University of Arizona 1990 - 1991
Master of Science, Masters, Computer Science University of Arizona 1987 - 1989
Bachelors, Bachelor of Science, Computer Engineering Ned University of Engineering and Technology 1984 - 1986
Bachelor of Engineering, Bachelors, Computer Systems Engineering
Skills:
Tcp/Ip
Ethernet
Routing
Software Development
Ospf
Ip
Mpls
Embedded Systems
Cloud Computing
Data Center
Software Engineering
Switches
Routing Protocols
Perl
Snmp
Routers
Rip
C++
Security
Qos
Network Architecture
Distributed Systems
Nat
Vpls
Virtualization
Device Drivers
Internet Protocol Suite
Leadership
Programming
Frame Relay
Ipv6
Internet Protocol
Servers
Multiprotocol Label Switching
Lan Switching
Bgp
Multicast
People Skills
High Availability
System Architecture
System Deployment
Saas
Software As A Service
Open Shortest Path First
Quality of Service
Object Oriented Design
Machine Learning
Networking
Linux
Software Design
Languages:
English
Urdu
Certifications:
Software Defined Networking
Startup Engineering
Software As A Service
Machine Learning
Mining Massive Datasets
Introduction To Big Data With Apache Spark
Scalable Machine Learning
Mohammad Hanif Photo 2

Mohammad Hanif

View page
Work:
Maansurgical International 2010 - 2015
Orthopedic Dental Implant and Etc
Mohammad Hanif Photo 3

Accounts Officer

View page
Industry:
Accounting
Work:
Resco Biscuit & Bread Factory Bscic Industrial State Jhumjumpur Jessore
Accounts Officer
Mohammad Hanif Photo 4

Mohammad Hanif

View page
Skills:
Microsoft Word
Microsoft Office
Microsoft Excel
Powerpoint
Mohammad Hanif Photo 5

Mohammad Hanif

View page
Mohammad Hanif Photo 6

Mohammad Hanif

View page
Mohammad Hanif Photo 7

Mohammad Hanif

View page
Location:
United States
Mohammad Hanif Photo 8

Mohammad Fahad Hanif Chandler, AZ

View page
Work:
Freescale Semiconductor Inc.

Feb 2014 to 2000
RFIC Design Engineer
Applied Micro Circuits Corporation
San Diego, CA
Dec 2012 to Jan 2014
Staff Design Engineer
SiTune Corporation
San Jose, CA
Feb 2012 to Nov 2012
RFIC Circuit Design Engineer - (CoOp student)
The University of Texas at Dallas, TX (USA)
Dallas, TX
2008 to 2012
Research Assistant
Freescale Semiconductor Inc., Tempe-AZ (USA).

May 2011 to Nov 2011
Analog/RFIC Circuit Design Engineer - (Intern student)
Fibcom India Ltd

Nov 2005 to Aug 2006
Executive Engineer
Education:
The University of Texas at Dallas
Dallas, TX
2008 to 2013
Doctor of Science in Electrical Engineering
The University of Texas at Dallas
Dallas, TX
2006 to 2008
Master of Science in Electrical Engineering
Skills:
Cadence, Analog, PLL, VCO, Agilent ADS, Synopsys, HFSS, SONNET, EMX, VeloceRF, Agilent VNA, Spectrum Analyzer, Oscilloscope, Frequency counter, Power meter, HSPICE, PERL, SKILL, Verilog AMS, VHDL, MATLAB

Business Records

Name / Title
Company / Classification
Phones & Addresses
Mohammad Hanif
Packettrail, LLC
Software Application Development
5424-10 Sunol Blvd, Pleasanton, CA 94566
Mohammad R Hanif
HANIF IMAGES, LLC

Publications

Us Patents

Techniques For Determining Local Repair Connections

View page
US Patent:
8040792, Oct 18, 2011
Filed:
Aug 2, 2007
Appl. No.:
11/833168
Inventors:
Mohammad Hanif - Pleasanton CA, US
Ivy Hsu - Pleasanton CA, US
Assignee:
Foundry Networks, LLC - San Jose CA
International Classification:
G01R 31/08
US Classification:
370218, 709239, 370228
Abstract:
Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Dynamic Configuration Of Liveliness Detection

View page
US Patent:
8165032, Apr 24, 2012
Filed:
Mar 27, 2009
Appl. No.:
12/412786
Inventors:
Mohammad Hanif - Pleasanton CA, US
Lisa Hong Nguyen - San Jose CA, US
Assignee:
Brocade Communications Systems, Inc. - San Jose CA
International Classification:
H04L 12/26
US Classification:
370248, 370242, 370252
Abstract:
Techniques for dynamically establishing and configuring a liveliness detection session for a local repair connection of a connection. In one set of embodiments, a signaling message is received at a node configured to maintain a local repair connection for a connection. A configuration parameter is identified in the signaling message, where the configuration parameter pertains to a liveliness detection mechanism or protocol. A liveliness detection session is then established for the local repair connection based on the configuration parameter.

Techniques For Determining Local Repair Paths Using Cspf

View page
US Patent:
8358576, Jan 22, 2013
Filed:
Oct 3, 2007
Appl. No.:
11/866861
Inventors:
Mohammad Hanif - Pleasanton CA, US
Assignee:
Foundry Networks, LLC - San Jose CA
International Classification:
G01R 31/08
US Classification:
370216, 370217, 370218, 370225
Abstract:
Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Techniques For Determining Local Repair Paths Using Cspf

View page
US Patent:
8599681, Dec 3, 2013
Filed:
Dec 20, 2012
Appl. No.:
13/722534
Inventors:
Mohammad Hanif - Pleasanton CA, US
Assignee:
Foundry Networks, LLC - San Jose CA
International Classification:
G01R 31/08
US Classification:
370216, 370217, 370218, 370225
Abstract:
Techniques for computing a path for a local repair connection to be used to protect a connection traversing an original path from an ingress node to an egress node. The computed path originates at a node (start node) in the original path and terminates at another node (end node) in the original path that is downstream from the start node. A Constraint Shortest Path First (CSPF) algorithm may be used to compute the path. The computed path is such that it satisfies one or more constraints and does not traverse a path from a first node in the original path to a second node in the original path, wherein the first and second nodes are upstream from the start node in the original path and the second node is downstream from the first node in the original path. A local repair connection may then be signaled using the computed path.

Techniques For Determining Optimized Local Repair Paths

View page
US Patent:
20090292942, Nov 26, 2009
Filed:
Aug 2, 2007
Appl. No.:
11/833167
Inventors:
Sandeep Bhat - Sunnyvale CA, US
Mohammad Hanif - Pleasanton CA, US
Sriniwas Polavarapu - San Jose CA, US
Assignee:
Foundry Networks, Inc. - Santa Clara CA
International Classification:
G06F 11/00
US Classification:
714 4, 714E11001
Abstract:
Techniques for finding an optimized local repair path that may be used to signal a local repair connection for a protected connection. The optimized local repair path starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. Various techniques may be used for finding an optimized local repair path.

Techniques For Determining Local Repair Connections

View page
US Patent:
20120033542, Feb 9, 2012
Filed:
Oct 14, 2011
Appl. No.:
13/274216
Inventors:
Mohammad Hanif - Pleasanton CA, US
Ivy Hsu - Pleasanton CA, US
Assignee:
Foundry Networks, LLC - San Jose CA
International Classification:
H04L 12/26
US Classification:
370217
Abstract:
Techniques for configuring a local repair connection for a protected connection including determining a path for the local repair connection. The path traversed by a local repair connection starts at a node in the path associated with the protected connection and ends at a merge point node in the path associated with the protected connection that is downstream from the start node. In one embodiment, the merge point node may even be more than two hops downstream from the start node in the path associated with the protected connection. The local repair path may include zero or more nodes that are not included in the path associated with the protected connection. Techniques are also described for optimizing the path associated with a local repair connection.

Faster Failovers For Fast Reroute (Frr) Lsps

View page
US Patent:
20130044586, Feb 21, 2013
Filed:
Aug 14, 2012
Appl. No.:
13/585688
Inventors:
Mohammad Hanif - Pleasanton CA, US
Dilip Kumar - Tucson AZ, US
Minjie Dai - San Jose CA, US
Lisa Hong Nguyen - San Jose CA, US
Sundeep Kumar Singh - Bangalore, IN
Assignee:
Brocade Communications Systems, Inc. - San Jose CA
International Classification:
H04L 12/26
US Classification:
370218
Abstract:
Techniques for reducing the latency in performing a failover from a protected connection to its backup connection when a network event is detected affecting the protected connection. In an MPLS network, techniques are provided for failing a protected LSP to a backup LSP in a fast and efficient manner. In one embodiment, the faster failover is facilitated by storing protected LSPs and their backup LSPs information in the data plane, such as locally on a linecard.

Method And System For Assigning Threads To Active Sessions

View page
US Patent:
61416770, Oct 31, 2000
Filed:
Oct 13, 1995
Appl. No.:
8/542834
Inventors:
Mohammad Hanif - Fremont CA
Kazuhisa Yanagihara - Santa Cruz CA
Assignee:
Apple Computer, Inc. - Cupertino CA
International Classification:
G06G 900
US Classification:
709100
Abstract:
A method and system for processing active AFP sessions by a multithreaded file system process. The file server is coupled to entities on a network, wherein an open AFP session is created when the file server and an entity on the network establish communication, and an active AFP session is created when an AFP session has a pending request. The method and system comprises monitoring the file server for active AFP sessions. When a first active AFP session having at least one AFP request becomes available, the method and system assigns a first one of the threads to the first active AFP session for processing. The method and system preempts the processing of the first active AFP session by the first one of the threads when additional active AFP sessions are available so that the first one of the threads becomes available to process additional active AFP sessions, whereby equal processing time is provided to each one of the active AFP sessions.

Wikipedia References

Mohammad Hanif Photo 9

Mohammad Hanif (Scholar)

Mohammad Hanif Photo 10

Mohammad Hanif (Iranian Writer)

Control profile
Mohammad Hanif from San Francisco, CA, age ~74 Get Report